Balanced Product Quantum Codes

Nikolas P. Breuckmann; Jens N. Eberhardt

doi:10.1109/TIT.2021.3097347

Balanced Product Quantum Codes

Nikolas P. Breuckmann^*, Jens N. Eberhardt

^*Corresponding author for this work

School of Mathematics

Research output: Contribution to journal › Article (Academic Journal) › peer-review

17 Citations (Scopus)

6 Downloads (Pure)

Abstract

This work provides the first explicit and non-random family of [[N,K,D]] LDPC quantum codes which encode K in Theta left({N{frac {4}{5}}}right) logical qubits with distance D in Omega left({N{frac {3}{5}}}right). The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product. Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the mathrm {polylog}(N)sqrt {N} distance barrier. However, their constructions are based on probabilistic arguments which only guarantee the code parameters with high probability whereas our bounds hold unconditionally. Further, balanced products allow for non-abelian twisting of the check matrices, leading to a construction of LDPC quantum codes that can be shown to have Kin Theta (N) and that we conjecture to have linear distance Din Theta (N).

Original language	English
Pages (from-to)	6653 - 6674
Number of pages	22
Journal	IEEE Transactions on Information Theory
Volume	67
Issue number	10
Early online date	19 Jul 2021
DOIs	https://doi.org/10.1109/TIT.2021.3097347
Publication status	Published - 19 Jul 2021

Bibliographical note

Funding Information:
Manuscript received January 13, 2021; revised May 17, 2021; accepted June 16, 2021. Date of publication July 19, 2021; date of current version September 15, 2021. The work of Nikolas P. Breuckmann was supported in part by the University College London Quantum Science and Technology Institute (UCLQ) Fellowship and in part by the Engineering and Physical Sciences Research Council (EPSRC) Prosperity Partnership in Quantum Software for Simulation and Modelling under Grant EP/S005021/1. (Corresponding author: Nikolas P. Breuckmann.) Nikolas P. Breuckmann is with the Department of Physics and Astronomy and the Department of Computer Science, University College London, London WC1E 6BT, U.K. (e-mail: nikobreu@gmail.com).

Publisher Copyright:
© 1963-2012 IEEE.

Keywords

Quantum codes
quantum error-correction
quantum fault-tolerance

Access to Document

10.1109/TIT.2021.3097347

Full-text PDF (accepted manuscript)
This is the accepted author manuscript (AAM). The final published version (version of record) is available online via IEEE at https://ieeexplore.ieee.org/document/9490244. Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 0.99 MBLicence: CC BY

Handle.net

Persistent link

Cite this

@article{c7241a04e902493693655d15f40ab1ee,

title = "Balanced Product Quantum Codes",

abstract = "This work provides the first explicit and non-random family of [[N,K,D]] LDPC quantum codes which encode K in Theta left({N{frac {4}{5}}}right) logical qubits with distance D in Omega left({N{frac {3}{5}}}right). The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product. Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the mathrm {polylog}(N)sqrt {N} distance barrier. However, their constructions are based on probabilistic arguments which only guarantee the code parameters with high probability whereas our bounds hold unconditionally. Further, balanced products allow for non-abelian twisting of the check matrices, leading to a construction of LDPC quantum codes that can be shown to have Kin Theta (N) and that we conjecture to have linear distance Din Theta (N).",

keywords = "Quantum codes, quantum error-correction, quantum fault-tolerance",

author = "Breuckmann, {Nikolas P.} and Eberhardt, {Jens N.}",

note = "Funding Information: Manuscript received January 13, 2021; revised May 17, 2021; accepted June 16, 2021. Date of publication July 19, 2021; date of current version September 15, 2021. The work of Nikolas P. Breuckmann was supported in part by the University College London Quantum Science and Technology Institute (UCLQ) Fellowship and in part by the Engineering and Physical Sciences Research Council (EPSRC) Prosperity Partnership in Quantum Software for Simulation and Modelling under Grant EP/S005021/1. (Corresponding author: Nikolas P. Breuckmann.) Nikolas P. Breuckmann is with the Department of Physics and Astronomy and the Department of Computer Science, University College London, London WC1E 6BT, U.K. (e-mail: nikobreu@gmail.com). Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2021",

month = jul,

day = "19",

doi = "10.1109/TIT.2021.3097347",

language = "English",

volume = "67",

pages = "6653 -- 6674",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "10",

}

TY - JOUR

T1 - Balanced Product Quantum Codes

AU - Breuckmann, Nikolas P.

AU - Eberhardt, Jens N.

N1 - Funding Information: Manuscript received January 13, 2021; revised May 17, 2021; accepted June 16, 2021. Date of publication July 19, 2021; date of current version September 15, 2021. The work of Nikolas P. Breuckmann was supported in part by the University College London Quantum Science and Technology Institute (UCLQ) Fellowship and in part by the Engineering and Physical Sciences Research Council (EPSRC) Prosperity Partnership in Quantum Software for Simulation and Modelling under Grant EP/S005021/1. (Corresponding author: Nikolas P. Breuckmann.) Nikolas P. Breuckmann is with the Department of Physics and Astronomy and the Department of Computer Science, University College London, London WC1E 6BT, U.K. (e-mail: nikobreu@gmail.com). Publisher Copyright: © 1963-2012 IEEE.

PY - 2021/7/19

Y1 - 2021/7/19

N2 - This work provides the first explicit and non-random family of [[N,K,D]] LDPC quantum codes which encode K in Theta left({N{frac {4}{5}}}right) logical qubits with distance D in Omega left({N{frac {3}{5}}}right). The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product. Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the mathrm {polylog}(N)sqrt {N} distance barrier. However, their constructions are based on probabilistic arguments which only guarantee the code parameters with high probability whereas our bounds hold unconditionally. Further, balanced products allow for non-abelian twisting of the check matrices, leading to a construction of LDPC quantum codes that can be shown to have Kin Theta (N) and that we conjecture to have linear distance Din Theta (N).

AB - This work provides the first explicit and non-random family of [[N,K,D]] LDPC quantum codes which encode K in Theta left({N{frac {4}{5}}}right) logical qubits with distance D in Omega left({N{frac {3}{5}}}right). The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product. Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the mathrm {polylog}(N)sqrt {N} distance barrier. However, their constructions are based on probabilistic arguments which only guarantee the code parameters with high probability whereas our bounds hold unconditionally. Further, balanced products allow for non-abelian twisting of the check matrices, leading to a construction of LDPC quantum codes that can be shown to have Kin Theta (N) and that we conjecture to have linear distance Din Theta (N).

KW - Quantum codes

KW - quantum error-correction

KW - quantum fault-tolerance

UR - http://www.scopus.com/inward/record.url?scp=85111005740&partnerID=8YFLogxK

U2 - 10.1109/TIT.2021.3097347

DO - 10.1109/TIT.2021.3097347

M3 - Article (Academic Journal)

SN - 0018-9448

VL - 67

SP - 6653

EP - 6674

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 10

ER -

Balanced Product Quantum Codes

Abstract

Bibliographical note

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this