Unification of quantum information theory
暂无分享,去创建一个
[1] Alexander S. Holevo,et al. The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.
[2] A. Harrow,et al. Superdense coding of quantum states. , 2003, Physical review letters.
[3] Cleve,et al. Schumacher's quantum data compression as a quantum computation. , 1996, Physical review. A, Atomic, molecular, and optical physics.
[4] Page,et al. Average entropy of a subsystem. , 1993, Physical review letters.
[5] Sen. Average Entropy of a Quantum Subsystem. , 1996, Physical review letters.
[6] Aram W. Harrow,et al. Coherent Classical Communication , 2003 .
[7] Igor Devetak,et al. Low-Entanglement Remote State Preparation , 2001, OFC 2001.
[8] A. Winter. Compression of sources of probability distributions and density operators , 2002, quant-ph/0208131.
[9] Jeroen van de Graaf,et al. Cryptographic Distinguishability Measures for Quantum-Mechanical States , 1997, IEEE Trans. Inf. Theory.
[10] M. Horodecki,et al. Entanglement and thermodynamical analogies , 1998, quant-ph/9805072.
[11] H. Lo. Classical-communication cost in distributed quantum-information processing: A generalization of quantum-communication complexity , 1999, quant-ph/9912009.
[12] A. Uhlmann,et al. Stochasticity and Partial Order , 1982 .
[13] E. Lubkin. Entropy of an n‐system from its correlation with a k‐reservoir , 1978 .
[14] Kanno,et al. Proof of Page's conjecture on the average entropy of a subsystem. , 1994, Physical review letters.
[15] Andreas J. Winter,et al. On the Distributed Compression of Quantum Information , 2006, IEEE Transactions on Information Theory.
[16] Aram Harrow. Coherent communication of classical messages. , 2004, Physical review letters.
[17] Michal Horodecki. Optimal compression for mixed signal states , 2000 .
[18] Sánchez-Ruiz,et al. Simple proof of Page's conjecture on the average entropy of a subsystem. , 1995, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[19] D. Berry. Resources required for exact remote state preparation , 2004, quant-ph/0404004.
[20] Ashish V. Thapliyal,et al. Entanglement-Assisted Classical Capacity of Noisy Quantum Channels , 1999, Physical Review Letters.
[21] R. Jozsa. Fidelity for Mixed Quantum States , 1994 .
[22] R. Jozsa,et al. On quantum coding for ensembles of mixed states , 2000, quant-ph/0008024.
[23] G. Guo,et al. Faithful remote state preparation using finite classical bits and a nonmaximally entangled state , 2003, quant-ph/0307027.
[24] Michael D. Westmoreland,et al. Sending classical information via noisy quantum channels , 1997 .
[25] M. Fannes. A continuity property of the entropy density for spin lattice systems , 1973 .
[26] A. Winter,et al. Randomizing Quantum States: Constructions and Applications , 2003, quant-ph/0307104.
[27] Andreas J. Winter,et al. A Resource Framework for Quantum Shannon Theory , 2008, IEEE Transactions on Information Theory.
[28] Charles H. Bennett,et al. Concentrating partial entanglement by local operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[29] A. Uhlmann. The "transition probability" in the state space of a ∗-algebra , 1976 .
[30] A. Winter,et al. Distillation of secret key and entanglement from quantum states , 2003, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.
[31] Charles H. Bennett,et al. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.
[32] Howard Barnum,et al. On the reversible extraction of classical information from a quantum source , 2001, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[33] C. H. Bennett,et al. Remote state preparation. , 2000, Physical review letters.
[34] Andreas J. Winter. Identification Via Quantum Channels in the Presence of Prior Correlation and Feedback , 2006, GTIT-C.
[35] A. Winter,et al. Aspects of Generic Entanglement , 2004, quant-ph/0407049.
[36] M. Nielsen. Continuity bounds for entanglement , 1999, quant-ph/9908086.
[37] Aram W. Harrow,et al. A family of quantum protocols , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[38] N. J. Cerf,et al. Quantum conditional operator and a criterion for separability , 1997 .
[39] A. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel , 1973 .
[40] P. Hayden,et al. Generalized remote state preparation: Trading cbits, qubits, and ebits in quantum communication , 2003, quant-ph/0308143.
[41] Andreas J. Winter,et al. Quantum Reverse Shannon Theorem , 2009, ArXiv.
[42] Debbie W. Leung,et al. Remote preparation of quantum states , 2005, IEEE Transactions on Information Theory.
[43] Greg Kuperberg,et al. The capacity of hybrid quantum memory , 2002, IEEE Trans. Inf. Theory.
[44] R. A. McDonald,et al. Noiseless Coding of Correlated Information Sources , 1973 .
[45] S. Lloyd. Capacity of the noisy quantum channel , 1996, quant-ph/9604015.
[46] V. Milman,et al. Asymptotic Theory Of Finite Dimensional Normed Spaces , 1986 .
[47] A. Winter,et al. Trading quantum for classical resources in quantum data compression , 2002, quant-ph/0204038.
[48] D. Petz,et al. Quantum Entropy and Its Use , 1993 .
[49] Andreas Winter,et al. Partial quantum information , 2005, Nature.
[50] Schumacher,et al. Quantum coding. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[51] Peter W. Shor,et al. Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem , 2001, IEEE Trans. Inf. Theory.
[52] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[53] Andreas J. Winter. Quantum and classical message identification via quantum channels , 2005, Quantum Inf. Comput..
[54] A. Winter,et al. Quantum, classical, and total amount of correlations in a quantum state , 2004, quant-ph/0410091.
[55] I. Devetak. A triangle of dualities: reversibly decomposable quantum channels, source-channel duality, and time reversal , 2005 .
[56] A. Pati. Minimum classical bit for remote preparation and measurement of a qubit , 1999, quant-ph/9907022.
[57] Rudolf Ahlswede,et al. Identification via channels , 1989, IEEE Trans. Inf. Theory.
[58] Debbie W. Leung,et al. Classical capacity of a noiseless quantum channel assisted by noisy entanglement , 2001, Quantum Inf. Comput..
[59] Masato Koashi,et al. Operations that do not disturb partially known quantum states , 2002 .
[60] C. Adami,et al. Quantum extension of conditional probability , 1999 .
[61] Andris Ambainis,et al. Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption , 2004, APPROX-RANDOM.
[62] I. Devetak,et al. Triangle of dualities between quantum communication protocols. , 2006, Physical review letters.
[63] S. Lloyd,et al. Complexity as thermodynamic depth , 1988 .
[64] Igor Devetak. The private classical capacity and quantum capacity of a quantum channel , 2005, IEEE Transactions on Information Theory.
[65] Rudolf Ahlswede,et al. Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.
[66] Debbie W. Leung,et al. Quantum data hiding , 2002, IEEE Trans. Inf. Theory.
[67] Andreas J. Winter,et al. Coding theorem and strong converse for quantum channels , 1999, IEEE Trans. Inf. Theory.
[68] A. Winter,et al. “Squashed entanglement”: An additive entanglement measure , 2003, quant-ph/0308088.