Fetching the paper…
Reading the bibliography…
We study the general framework of quantum channel simulation, that is, the ability of a quantum channel to simulate another one using different classes of codes.
C. E. Shannon, “A mathematical theory of communication,” The Bell System Technical Journal , vol. 27, no. 3, pp. 379–423, 1948
1948
Earlier work this paper cites.
C. E. Shannon, “The zero error capacity of a noisy channel,” IRE Transactions on Information Theory , vol. 2, no. 3, pp. 8–19, 1956
1956
Earlier work this paper cites.
A. Uhlmann, “The “transition probability” in the state space of a *-algebra,” Reports on Mathematical Physics , vol. 9, no. 2, pp. 273–279, 1976
1976
Earlier work this paper cites.
F. Hiai and D. Petz, “The proper formula for relative entropy and its asymptotics in quantum probability,” Communications in Mathematical Physics , vol. 143, no. 1, pp. 99–114, dec 1991
1991
Earlier work this paper cites.
L. Vandenberghe and S. Boyd, “Semidefinite Programming,” SIAM Review , vol. 38, no. 1, pp. 49–95, 1996
1996
Earlier work this paper cites.
A. Y. Kitaev, “Quantum computations: algorithms and error correction,” Russian Mathematical Surveys , vol. 52, no. 6, pp. 1191–1249, dec 1997
1997
Earlier work this paper cites.
C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted classical capacity of noisy quantum channels,” Physical Review Letters , vol. 83, no. 15, p. 3081, 1999
1999
Earlier work this paper cites.
E. M. Rains, “A semidefinite program for distillable entanglement,” IEEE Transactions on Information Theory , vol. 47, no. 7, pp. 2921–2933, 2001
2001
Earlier work this paper cites.
C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem,” IEEE Transactions on Information Theory , vol. 48, no. 10, pp. 2637–2655, 2002
2002
Earlier work this paper cites.
D. Kretschmann and R. F. Werner, “Tema con variazioni: quantum channel capacity,” New Journal of Physics , vol. 6, no. 1, p. 26, 2004
2004
Earlier work this paper cites.
R. Renner, “Security of quantum key distribution,” PhD thesis, ETH Zurich , vol. 6, no. 01, pp. 1–127, 2005
2005
Earlier work this paper cites.
G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Transforming quantum operations: Quantum supermaps,” EPL (Europhysics Letters) , vol. 83, no. 3, p. 30004, 2008
2008
Earlier work this paper cites.
M. Hayashi, “Information spectrum approach to second-order coding rate in channel coding,” IEEE Transactions on Information Theory , vol. 55, no. 11, pp. 4947–4966, 2009
2009
Earlier work this paper cites.
J. Watrous, “Semidefinite Programs for Completely Bounded Norms,” Theory of Computing , vol. 5, no. 1, pp. 217–238, 2009
2009
Earlier work this paper cites.
N. Datta, “Min-and max-relative entropies and a new entanglement monotone,” IEEE Transactions on Information Theory , vol. 55, no. 6, pp. 2816–2826, 2009
2009
Earlier work this paper cites.
N. Datta, “Max-relative entropy of entanglement, alias log robustness,” International Journal of Quantum Information , vol. 7, no. 02, pp. 475–491, 2009
2009
Earlier work this paper cites.
M. Christandl, R. König, and R. Renner, “Postselection technique for quantum channels with applications to quantum cryptography,” Physical Review Letters , vol. 102, no. 2, p. 020504, 2009
2009
Earlier work this paper cites.
Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2307–2359, 2010
2010
Cited alongside, same era.
F. Buscemi and N. Datta, “Distilling entanglement from arbitrary resources,” Journal of Mathematical Physics , vol. 51, no. 10, p. 102201, 2010
2010
Cited alongside, same era.
M. Berta, M. Christandl, and R. Renner, “The quantum reverse Shannon theorem based on one-shot information theory,” Communications in Mathematical Physics , vol. 306, no. 3, pp. 579–615, 2011
2011
Cited alongside, same era.
T. S. Cubitt, D. Leung, W. Matthews, and A. Winter, “Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations,” IEEE Transactions on Information Theory , vol. 57, no. 8, pp. 5509–5523, 2011
2011
Cited alongside, same era.
M. Berta, M. Christandl, and D. Touchette, “Smooth Entropy Bounds on One-Shot Quantum State Redistribution,” IEEE Transactions on Information Theory , vol. 62, no. 3, pp. 1425–1439, 2016
2016
Later among the works it cites.
A. Anshu, R. Jain, P. Mukhopadhyay, A. Shayeghi, and P. Yao, “New One Shot Quantum Protocols With Application to Communication Complexity,” IEEE Transactions on Information Theory , vol. 62, no. 12, pp. 7566–7577, 2016
2016
Later among the works it cites.
T. Cooney, M. Mosonyi, and M. M. Wilde, “Strong Converse Exponents for a Quantum Channel Discrimination Problem and Quantum-Feedback-Assisted Communication,” Communications in Mathematical Physics , vol. 344, no. 3, pp. 797–829, jun 2016
2016
Later among the works it cites.
N. Datta, M. Tomamichel, and M. M. Wilde, “On the second-order asymptotics for entanglement-assisted communication,” Quantum Information Processing , pp. 1–23, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. M. Renes and R. Renner, “Noisy channel coding via privacy amplification and information reconciliation,” IEEE Transactions on Information Theory , vol. 57, no. 11, pp. 7377–7385, 2011
2011
Cited alongside, same era.
2012
Cited alongside, same era.
W. Matthews, “A Linear Program for the Finite Block Length Converse of Polyanskiy–Poor–Verdú Via Nonsignaling Codes,” IEEE Transactions on Information Theory , vol. 58, no. 12, pp. 7036–7044, 2012
2012
Cited alongside, same era.
M. Berta, F. G. S. L. Brandao, M. Christandl, and S. Wehner, “Entanglement Cost of Quantum Channels,” IEEE Transactions on Information Theory , vol. 59, no. 10, pp. 6779–6795, 2013
2013
Cited alongside, same era.
N. Datta and M.-H. Hsieh, “One-shot entanglement-assisted quantum and classical communication,” IEEE Transactions on Information Theory , vol. 59, no. 3, pp. 1929–1939, 2013
2013
Cited alongside, same era.
N. Datta, J. M. Renes, R. Renner, and M. M. Wilde, “One-Shot Lossy Quantum Data Compression,” IEEE Transactions on Information Theory , vol. 59, no. 12, pp. 8057–8076, 2013
2013
Cited alongside, same era.
C. H. Bennett, I. Devetak, A. W. Harrow, P. W. Shor, and A. Winter, “The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels,” IEEE Transactions on Information Theory , vol. 60, no. 5, pp. 2926–2959, 2014
2014
Cited alongside, same era.
W. Matthews and S. Wehner, “Finite blocklength converse bounds for quantum channels,” IEEE Transactions on Information Theory , vol. 60, no. 11, pp. 7317–7329, 2014
2014
Cited alongside, same era.
A. Winter, “Tight Uniform Continuity Bounds for Quantum Entropies: Conditional Entropy, Relative Entropy Distance and Energy Constraints,” Communications in Mathematical Physics , vol. 347, no. 1, pp. 291–313, oct 2016
2016
Later among the works it cites.
K. Ben Dana, M. García Díaz, M. Mejatty, and A. Winter, “Resource theory of coherence: Beyond states,” Physical Review A , vol. 95, no. 6, p. 062327, 2017
2017
Later among the works it cites.
2018
Closest in time.
X. Wang, W. Xie, and R. Duan, “Semidefinite programming strong converse bounds for classical capacity,” IEEE Transactions on Information Theory , vol. 64, no. 1, pp. 640–653, 2018
2018
Closest in time.
G. Gour and M. M. Wilde, “Entropy of a quantum channel,” arXiv:1808.06980 , 2018
2018
Closest in time.
M. G. Díaz, K. Fang, X. Wang, M. Rosati, M. Skotiniotis, J. Calsamiglia, and A. Winter, “Using and reusing coherence to realize quantum processes,” Quantum , vol. 2, p. 100, 2018
2018
Closest in time.
2018
Closest in time.
F. Leditzky, E. Kaur, N. Datta, and M. M. Wilde, “Approaches for approximate additivity of the holevo information of quantum channels,” Physical Review A , vol. 97, no. 1, p. 012332, 2018
2018
Closest in time.
2018
Closest in time.
K. Fang, X. Wang, M. Tomamichel, and R. Duan, “Non-asymptotic entanglement distillation,” IEEE Transactions on Information Theory , vol. 65, no. 10, pp. 6454–6465, Oct 2019
2019
Closest in time.
G. Gour, “Comparison of quantum channels by superchannels,” IEEE Transactions on Information Theory , vol. 65, no. 9, pp. 5880–5904, Sep. 2019
2019
Closest in time.
X. Wang, K. Fang, and R. Duan, “Semidefinite programming converse bounds for quantum communication,” IEEE Transactions on Information Theory , vol. 65, no. 4, pp. 2583–2592, April 2019
2019
Closest in time.