Characterising port-based teleportation as universal simulator of qubit channels
暂无分享,去创建一个
[1] Michal Horodecki,et al. Optimal port-based teleportation , 2017, 1707.08456.
[2] Charles H. Bennett,et al. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.
[3] Satoshi Ishizaka,et al. Quantum teleportation scheme by selecting one of multiple output ports , 2009, 0901.2975.
[4] I. Chuang,et al. Quantum Teleportation is a Universal Computational Primitive , 1999, quant-ph/9908010.
[5] H. Kimble,et al. Teleportation of continuous quantum variables , 1998, Technical Digest. Summaries of Papers Presented at the International Quantum Electronics Conference. Conference Edition. 1998 Technical Digest Series, Vol.7 (IEEE Cat. No.98CH36236).
[6] G. Bowen,et al. Teleportation as a depolarizing quantum channel, relative entropy, and classical capacity. , 2001, Physical review letters.
[7] Alexander Semenovich Holevo,et al. Quantum Systems, Channels, Information: A Mathematical Introduction , 2019 .
[8] Satoshi Ishizaka,et al. Asymptotic teleportation scheme as a universal programmable quantum processor. , 2008, Physical review letters.
[9] S. Braunstein,et al. Quantum Information with Continuous Variables , 2004, quant-ph/0410100.
[10] Stefano Pirandola,et al. Fundamental limits to quantum channel discrimination , 2018, npj Quantum Information.
[11] Matthias Christandl,et al. Asymptotic Performance of Port-Based Teleportation , 2018, Communications in Mathematical Physics.
[12] Akira Furusawa,et al. Hybrid quantum information processing , 2013, 1409.3719.
[13] Gorjan Alagic,et al. #p , 2019, Quantum information & computation.
[14] Ion Nechita,et al. Almost all quantum channels are equidistant , 2016, 1612.00401.
[15] Stefano Pirandola. Bounds for multi-end communication over quantum networks , 2019 .
[16] Enrico Pisoni. code on Zenodo , 2020 .
[17] John Watrous,et al. The Theory of Quantum Information , 2018 .
[18] Isaac L. Chuang,et al. Quantum Computation and Quantum Information (10th Anniversary edition) , 2011 .
[19] Rafail Ostrovsky,et al. Position-Based Quantum Cryptography: Impossibility and Constructions , 2011, IACR Cryptol. ePrint Arch..
[20] Man-Duen Choi. Completely positive linear maps on complex matrices , 1975 .
[21] S. Lloyd,et al. Optimization and learning of quantum programs , 2019, 1905.01318.
[22] Samuel L. Braunstein,et al. Theory of channel simulation and bounds for private communication , 2017, Quantum Science and Technology.
[23] Stefano Pirandola,et al. Simulation of non-Pauli channels , 2017 .
[24] A. Isar,et al. ABOUT QUANTUM-SYSTEMS , 2004 .
[25] S. Pirandola,et al. General Benchmarks for Quantum Repeaters , 2015, 1512.04945.
[26] Seth Lloyd,et al. Gaussian quantum information , 2011, 1110.3234.
[27] Salman Beigi,et al. Simplified instantaneous non-local quantum computation with applications to position-based cryptography , 2011, 1101.1065.
[28] Stefano Pirandola,et al. End-to-end capacities of a quantum communication network , 2019, Communications Physics.
[29] A. Jamiołkowski. Linear transformations which preserve trace and positive semidefiniteness of operators , 1972 .
[30] P. Alam. ‘Z’ , 2021, Composites Engineering: An A–Z Guide.
[31] Seth Lloyd,et al. Convex optimization of programmable quantum computers , 2019, npj Quantum Information.
[32] J. Eisert,et al. Advances in quantum teleportation , 2015, Nature Photonics.