Fetching the paper…
Reading the bibliography…
We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller (PQRM) codes.
I. Reed, “A class of multiple-error-correcting codes and the decoding scheme,” Transactions of the IRE Professional Group on Information Theory , vol. 4, no. 4, 1954
1954
Earlier work this paper cites.
D. E. Muller, “Application of Boolean algebra to switching circuit design and to error detection,” Transactions of the I.R.E. Professional Group on Electronic Computers , vol. EC-3, no. 3, 1954
1954
Earlier work this paper cites.
P. Stanek, “Two-element generation of the symplectic group,” Transactions of the American Mathematical Society , vol. 108, no. 3, 1963
1963
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, “The theory of error-correcting codes,” 1977
1977
Earlier work this paper cites.
W. Bosma, J. Cannon, and C. Playoust, “The Magma algebra system. I. The user language,” J. Symbolic Comput. , vol. 24, no. 3-4, 1997, computational algebra and number theory (London, 1993)
1993
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Physical Review A , vol. 54, no. 2, 1996
1996
Earlier work this paper cites.
A. Steane, “Multiple-particle interference and quantum error correction,” Proceedings of the Royal Society A , vol. 452, no. 1954, 1996
1996
Earlier work this paper cites.
E. Knill, R. Laflamme, and W. Zurek, “Threshold accuracy for quantum computation,” 1996
1996
Earlier work this paper cites.
L. Vaidman, L. Goldenberg, and S. Wiesner, “Error prevention scheme with four particles,” Physical Review A , vol. 54, no. 3, Sep. 1996
1996
Earlier work this paper cites.
A. M. Steane, “Active Stabilization, Quantum Computation, and Quantum State Synthesis,” Physical Review Letters , vol. 78, 1997
1997
Earlier work this paper cites.
J. Preskill, “Lecture notes for physics 229: Quantum information and computation,” 1998
1998
Earlier work this paper cites.
A. Steane, “Quantum Reed-Muller codes,” IEEE Transactions on Information Theory , vol. 45, no. 5, 1999
1999
Earlier work this paper cites.
A. M. Steane, “Efficient fault-tolerant quantum computing,” Nature , vol. 399, no. 6732, May 1999
1999
Earlier work this paper cites.
M. Grassl and T. Beth, “Quantum BCH codes,” 1999
1999
Earlier work this paper cites.
A. M. Steane, “Overhead and noise threshold of fault-tolerant quantum error correction,” Physical Review A , vol. 68, no. 4, Oct. 2003
2003
Earlier work this paper cites.
P. Aliferis, D. Gottesman, and J. Preskill, “Quantum accuracy threshold for concatenated distance-3 codes,” 2005
2005
Earlier work this paper cites.
S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Physical Review A , vol. 71, no. 2, Feb. 2005
2005
Earlier work this paper cites.
E. Knill, “Quantum computing with realistically noisy devices,” Nature , vol. 434, no. 7029, Mar. 2005
2005
Earlier work this paper cites.
I. Dumer and K. Shabunov, “Soft-decision decoding of Reed-Muller codes: recursive lists,” IEEE Transactions on Information Theory , vol. 52, no. 3, 2006
2006
Earlier work this paper cites.
E. Arikan, “A performance comparison of polar codes and Reed-Muller codes,” IEEE Communications Letters , vol. 12, no. 6, 2008
2008
Earlier work this paper cites.
——, “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Transactions on Information Theory , vol. 55, no. 7, 2009
2009
Earlier work this paper cites.
A. W. Cross, D. P. DiVincenzo, and B. M. Terhal, “A comparative code study for quantum fault-tolerance,” 2009
2009
Earlier work this paper cites.
B. Eastin and E. Knill, “Restrictions on transversal encoded quantum gate sets,” Physical Review Letters , vol. 102, no. 11, Mar. 2009
2009
Earlier work this paper cites.
K. Betsumiya and A. Munemasa, “On triply even binary codes,” Journal of the London Mathematical Society , vol. 86, no. 1, Feb. 2012
2012
Earlier work this paper cites.
S. Bravyi and J. Haah, “Magic-state distillation with low overhead,” Phys. Rev. A , vol. 86, Nov 2012
2012
Earlier work this paper cites.
J. M. Renes, F. Dupuis, and R. Renner, “Efficient polar coding of quantum information,” Phys. Rev. Lett. , vol. 109, Aug 2012
2012
Cited alongside, same era.
A. Paetznick and B. W. Reichardt, “Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code,” 2013
2013
Cited alongside, same era.
A. Paetznick and B. W. Reichardt, “Universal fault-tolerant quantum computation with only transversal gates and error correction,” Phys. Rev. Lett. , vol. 111, Aug 2013
2013
Cited alongside, same era.
M. Grassl and M. Roetteler, “Leveraging automorphisms of quantum codes for fault-tolerant quantum computation,” in 2013 IEEE International Symposium on Information Theory , Jul. 2013
2013
Cited alongside, same era.
J. T. Anderson, G. Duclos-Cianci, and D. Poulin, “Fault-tolerant conversion between the Steane and Reed-Muller quantum codes,” Physical Review Letters , vol. 113, no. 8, Aug. 2014
S. Huang, T. Jochym-O’Connor, and T. J. Yoder, “Homomorphic logical measurements,” 2022
2022
Later among the works it cites.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, “Logical quantum processor based on reconfigurable atom arrays,” Nature , vol. 626, no. 7997, Dec. 2023
2023
Later among the works it cites.
S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V. Vuletić, and M. D. Lukin, “High-fidelity parallel entangling gates on a neutral-atom quantum computer,” Nature , vol. 622, no. 7982, Oct. 2023
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Transactions on Information Theory , vol. 61, no. 5, 2015
2015
Cited alongside, same era.
H. Bombin, “Gauge color codes: Optimal transversal gates and gauge fixing in topological stabilizer codes,” 2015
2015
Cited alongside, same era.
S. Bravyi and A. Cross, “Doubled color codes,” arXiv preprint arXiv:1509.03239 , 2015
2015
Cited alongside, same era.
C. Chamberland, T. Jochym-O’Connor, and R. Laflamme, “Thresholds for universal concatenated quantum codes,” Phys. Rev. Lett. , vol. 117, Jun 2016
2016
Cited alongside, same era.
J. E. Moussa, “Transversal Clifford gates on folded surface codes,” Phys. Rev. A , vol. 94, Oct 2016
2016
Cited alongside, same era.
D. Barredo, S. de Léséleuc, V. Lienhard, T. Lahaye, and A. Browaeys, “An atom-by-atom assembler of defect-free arbitrary two-dimensional atomic arrays,” Science , vol. 354, no. 6315, 2016
2016
Cited alongside, same era.
M. Bardet, V. Dragoi, A. Otmani, and J.-P. Tillich, “Algebraic properties of polar codes from a new polynomial formalism,” in 2016 IEEE International Symposium on Information Theory (ISIT) , Jul. 2016
2016
Cited alongside, same era.
2023
Later among the works it cites.
A. Gong. (2023) PW-QPC-List-Decoder: List Decoder for the Polarization Weight family of Quantum Polar Code. [Online]. Available: https://github.com/gongaa/PW-QPC
2023
Later among the works it cites.
E. Abbe and C. Sandon, “A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels,” in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)
2023
Later among the works it cites.
A. Barg, N. J. Coble, D. Hangleiter, and C. Kang, “Geometric structure and transversal logic of quantum Reed-Muller codes,” 2024
2024
Closest in time.
S. Heußen and J. Hilder, “Efficient fault-tolerant code switching via one-way transversal CNOT gates,” 2024
2024
Closest in time.
N. P. Breuckmann and S. Burton, “Fold-transversal Clifford gates for quantum codes,” Quantum , vol. 8, Jun. 2024
2024
Closest in time.
J. N. Eberhardt and V. Steffan, “Logical operators and fold-transversal gates of bivariate bicycle codes,” 2024
2024
Closest in time.
D. Hangleiter, M. Kalinowski, D. Bluvstein, M. Cain, N. Maskara, X. Gao, A. Kubica, M. D. Lukin, and M. J. Gullans, “Fault-tolerant compiling of classically hard IQP circuits on hypercubes,” 2024
2024
Closest in time.
B. W. Reichardt, D. Aasen, R. Chao, A. Chernoguzov, W. van Dam, J. P. Gaebler, D. Gresh, D. Lucchetti, M. Mills, S. A. Moses, B. Neyenhuis, A. Paetznick, A. Paz, P. E. Siegfried, M. P. da Silva, K. M. Svore, Z. Wang, and M. Zanner, “Demonstration of quantum computation and error correction with a tesseract code,” 2024
2024
Closest in time.
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, “High-threshold and low-overhead fault-tolerant quantum memory,” Nature , vol. 627, no. 8005, Mar. 2024
2024
Closest in time.
A. Cross, Z. He, P. Rall, and T. Yoder, “Improved QLDPC surgery: Logical measurements and bridging codes,” 2024
2024
Closest in time.
Q. Xu, H. Zhou, G. Zheng, D. Bluvstein, J. P. B. Ataides, M. D. Lukin, and L. Jiang, “Fast and parallelizable logical computation with homological product codes,” 2024
2024
Closest in time.
A. Goswami, M. Mhalla, and V. Savin, “Factory-based fault-tolerant preparation of quantum polar codes encoding one logical qubit,” Phys. Rev. A , vol. 110, Jul 2024
2024
Closest in time.
A. Gong and J. M. Renes, “Improved logical error rate via list decoding of quantum polar codes,” in 2024 IEEE International Symposium on Information Theory (ISIT) , 2024
2024
Closest in time.
Z. Ye, Y. Li, H. Zhang, J. Wang, G. Yan, and Z. Ma, “Affine automorphism group of polar codes,” IEEE Transactions on Information Theory , vol. 70, no. 9, 2024
2024
Closest in time.
C. Gidney, N. Shutty, and C. Jones, “Magic state cultivation: growing T states as cheap as CNOT gates,” 2024
2024
Closest in time.
E. Camps-Moreno, H. H. López, G. L. Matthews, D. Ruano, R. San-José, and I. Soprunov, “An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance,” Quantum Information Processing , vol. 23, no. 6, Jun. 2024
2024
Closest in time.
M. Sullivan, “Code conversion with the quantum Golay code for a universal transversal gate set,” Phys. Rev. A , vol. 109, Apr 2024
2024
Closest in time.
S. P. Jain and V. V. Albert, “High-distance codes with transversal Clifford and T-gates,” 2024
2024
Closest in time.
G. Reeves and H. D. Pfister, “Reed–Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity,” IEEE Transactions on Information Theory , vol. 70, no. 2, 2024
2024
Closest in time.
L. Zhang, Y. Ren, Y. Shen, W. Zhou, A. Balatsoukas-Stimming, C. Zhang, and A. Burg, “A low-latency and high-performance scl decoder with frame-interleaving,” in 2024 IEEE International Symposium on Circuits and Systems (ISCAS) , 2024
2024
Closest in time.