Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes

Shin Nishio,1, 2, 3, ∗ Nicolò Lo Piparo,2, 3 Michael Hanks,4 William John Munro,5, 3 and Kae Nemoto2, 3, 1, † 1Department of Informatics, School of Multidisciplinary Sciences, SOKENDAI (The Graduate University for Advanced Studies), 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan 2Quantum Information Science and Technology Unit, Okinawa Institute of Science and Technology Graduate University, Onna-son, Kunigami-gun, Okinawa 904-0495, Japan 3National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan 4QOLS, Blackett Laboratory, Imperial College London, London SW7 2AZ, United Kingdom 5NTT Basic Research Laboratories & NTT Research Center for Theoretical Quantum Physics, NTT Corporation, 3-1 Morinosato-Wakamiya, Atsugi, Kanagawa, 243-0198, Japan.

[1]  W. Munro,et al.  Aggregating quantum networks , 2020, Physical Review A.

[2]  Kae Nemoto,et al.  Resource reduction for distributed quantum information processing using quantum multiplexed photons , 2019, Physical review letters.

[3]  Nicolo' Lo Plparo,et al.  Quantum Multiplexing , 2018, 2019 Conference on Lasers and Electro-Optics (CLEO).

[4]  Liang Jiang,et al.  One-way quantum repeaters with quantum Reed-Solomon codes , 2018, 1801.06706.

[5]  F. Moore,et al.  Polynomial Codes Over Certain Finite Fields , 2017 .

[6]  Petra Kaufmann,et al.  Physical Fundamentals Of Remote Sensing , 2016 .

[7]  W. Munro,et al.  Inside Quantum Repeaters , 2015, IEEE Journal of Selected Topics in Quantum Electronics.

[8]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[9]  William H. Pierce.  Failure-Tolerant Computer Design , 2014 .

[10]  Norbert Lütkenhaus,et al.  Ultrafast and fault-tolerant quantum communication across long distances. , 2013, Physical review letters.

[11]  Charles Herder.  BLIND QUANTUM COMPUTATION , 2012 .

[12]  G. L. Guardia.  Constructions of new families of nonbinary quantum codes , 2009 .

[13]  Jacob M. Taylor,et al.  Quantum repeater with encoding , 2008, 0809.3629.

[14]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[15]  H. J. Kimble,et al.  The quantum internet , 2008, Nature.

[16]  T.C.Ralph,et al.  Efficient Toffoli Gates Using Qudits , 2008, 0806.0654.

[17]  J. B. Wang,et al.  Efficient quantum circuit implementation of quantum walks , 2007, 0706.0304.

[18]  Pong C. Yuen,et al.  Protecting Face Biometric Data on Smartcard with Reed-Solomon Code , 2006, 2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'06).

[19]  J. Fiurášek.  Linear-optics quantum Toffoli and Fredkin gates , 2006, quant-ph/0602220.

[20]  Santosh Kumar,et al.  Nonbinary Stabilizer Codes Over Finite Fields , 2005, IEEE Transactions on Information Theory.

[21]  Alexei Gilchrist,et al.  Loss-tolerant optical qubits. , 2005, Physical review letters.

[22]  David J. C. MacKay,et al.  Sparse-graph codes for quantum error correction , 2004, IEEE Transactions on Information Theory.

[23]  Julia Kempe,et al.  Quantum random walks: An introductory overview , 2003, quant-ph/0303081.

[24]  R. Portugal,et al.  Grover's Algorithm: Quantum Database Search ∗ , 2003, quant-ph/0301079.

[25]  Won-Young Hwang.  Quantum key distribution with high loss: toward global secure communication. , 2003, Physical review letters.

[26]  Martin Rötteler,et al.  Efficient Quantum Circuits for Non-qubit Quantum Error-correcting Codes , 2002 .

[27]  A. Russell,et al.  Quantum Walks on the Hypercube , 2001, RANDOM.

[28]  Andris Ambainis,et al.  One-dimensional quantum walks , 2001, STOC '01.

[29]  J. Cirac,et al.  Long-distance quantum communication with atomic ensembles and linear optics , 2001, Nature.

[30]  Andris Ambainis,et al.  Quantum walks on graphs , 2000, STOC '01.

[31]  J. Preskill,et al.  Encoding a qubit in an oscillator , 2000, quant-ph/0008040.

[32]  Markus Grassl,et al.  Quantum Reed-Solomon Codes , 1999, AAECC.

[33]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[34]  J. Cirac,et al.  Distributed quantum computation over noisy channels , 1998, quant-ph/9803017.

[35]  H. Chau,et al.  Unconditional security of quantum key distribution over arbitrarily long distances , 1998, Science.

[36]  Daniel Gottesman,et al.  Stabilizer Codes and Quantum Error Correction , 1997, quant-ph/9705052.

[37]  R. Cleve,et al.  Efficient computations of encodings for quantum error correction , 1996, quant-ph/9607030.

[38]  A. Kitaev.  Quantum Error Correction with Imperfect Gates , 1997 .

[39]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[40]  Shor,et al.  Good quantum error-correcting codes exist. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[41]  Barenco,et al.  Quantum networks for elementary arithmetic operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[42]  Shor,et al.  Scheme for reducing decoherence in quantum computer memory. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[43]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[44]  Aharonov,et al.  Quantum random walks. , 1993, Physical review. A, Atomic, molecular, and optical physics.

[45]  Ekert,et al.  Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.

[46]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .