Fetching the paper…
Reading the bibliography…
Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource overheads.
P. W. Shor, in Proceedings of the 37th Symposium on Foundations of Computer Science, (IEEE Computer Society Press, 1996), pp. 56-65
1996
Earlier work this paper cites.
A. M. Steane, Active Stabilization, Quantum Computation, and Quantum State Synthesis, Phys. Rev. Lett. 78
1997
Earlier work this paper cites.
D. Gottesman, Theory of fault-tolerant quantum computation, Phys. Rev. A 57
1998
Earlier work this paper cites.
S. B. Bravyi, A. Y. Kitaev, Quantum codes on a lattice with boundary, arXiv preprint quant-ph/9811052 (1998)
1998
Earlier work this paper cites.
M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, England, 2000)
2000
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, J. Preskill, Topological quantum memory, J. Math. Phys. (N.Y.) 43
2002
Earlier work this paper cites.
D. J. C. MacKay, G. Mitchison, P. L. McFadden, Sparse Graph Codes for Quantum Error-Correction, IEEE Transactions on Information Theory, 50
2004
Earlier work this paper cites.
E. Knill, Quantum computing with realistically noisy devices, Nature 434
2005
Earlier work this paper cites.
E. Knill, Scalable quantum computing in the presence of large detected-error rates, Phys. Rev. A 71
2005
Earlier work this paper cites.
H. Bombin, M. A. Martin-Delgado, Topological Quantum Distillation, Phys. Rev. Lett. 97
2006
Earlier work this paper cites.
D. Poulin, Optimal and efficient decoding of concatenated quantum block codes, Phys. Rev. A 74
2006
Earlier work this paper cites.
R. Raussendorf, J. Harrington, Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions, Phys. Rev. Lett. 98
2007
Earlier work this paper cites.
R. Raussendorf, J. Harrington, K. Goyal, Topological fault-tolerance in cluster state quantum computation, New J. Phys. 9
2007
Earlier work this paper cites.
A. G. Fowler, A. M. Stephens, P. Groszkowski, High-threshold universal quantum computation on the surface code, Phys. Rev. A 80
2009
Earlier work this paper cites.
A. G. Fowler, Two-dimensional color-code quantum computation, Phys. Rev. A 83
2011
Earlier work this paper cites.
D. Horsman, A. G. Fowler, S. Devitt, R. Van Meter, Surface code quantum computing by lattice surgery, New J. Phys. 14
2012
Earlier work this paper cites.
N. C. Jones, R. Van Meter, A. G. Fowler, P. L. McMahon, J. Kim, T. D. Ladd, Y. Yamamoto, Layered architecture for quantum computing, Phys. Rev. X 2
2012
Earlier work this paper cites.
A. G. Fowler, M. Mariantoni, J. M. Martinis, A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86
2012
Earlier work this paper cites.
A. A. Kovalev, L. P. Pryadko, Quantum Kronecker sum-product low-density parity-check codes with finite rate, Phys. Rev. A 88
2013
Earlier work this paper cites.
H. Goto, H. Uchikawa, Fault-tolerant quantum computation with a soft-decision decoder for error correction and detection by teleportation, Sci. Rep. 3
2013
Earlier work this paper cites.
C. Jones, Multilevel distillation of magic states for quantum computing. Phys. Rev. A 87, 042305 (2013)
2013
Earlier work this paper cites.
D. Gottesman, Fault-tolerant quantum computation with constant overhead. Quantum Info. Comput. 14
2014
Earlier work this paper cites.
S. Bravyi, M. Suchara, A. Vargo, Efficient algorithms for maximum likelihood decoding in the surface code, Phys. Rev. A 90
2014
Cited alongside, same era.
H. Goto, Step-by-step magic state encoding for efficient fault-tolerant quantum computation, Sci. Rep. 4
2014
Cited alongside, same era.
B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87
2015
Cited alongside, same era.
A. Leverrier, J.-P. Tillich, G. Zemor, Quantum Expander Codes, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (2015)
2015
Cited alongside, same era.
H. Goto, Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code. Sci. Rep. 6, 19578 (2016)
2016
Cited alongside, same era.
M. A. Tremblay, N. Delfosse, M. E. Beverland, Constant-Overhead Quantum Error Correction with Thin Planar Connectivity, Phys. Rev. Lett. 129
2022
Later among the works it cites.
L. Z. Cohen, I. H. Kim, S. D. Bartlett, B. J. Brown, Low-overhead fault-tolerant quantum computing using long-range connectivity, Sci. Adv. 8
2022
Later among the works it cites.
L. Postler, S. Heußen, I. Pogorelov, M. Rispler, T. Feldker, M. Meth, C. D. Marciniak, R. Stricker, M. Ringbauer, R. Blatt, P. Schindler, M. Müller, T. Monz, Demonstration of fault-tolerant universal quantum gate operations, Nature 605
2022
Later among the works it cites.
T. M. Graham, Y. Song, J. Scott, C. Poole, L. Phuttitarn, K. Jooya, P. Eichler, X. Jiang, A. Marra, B. Grinkemeyer, M. Kwon, M. Ebert, J. Cherek, M. T. Lichtman, M. Gillette, J. Gilbert, D. Bowman, T. Ballance, C. Campbell, E. D. Dahl, O. Crawford, N. S. Blunt, B. Rogers, T. Noel, M. Saffman, Multi-qubit entanglement and algorithms on a neutral-atom quantum computer, Nature 604
2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
O. Fawzi, A. Grospellier, A. Leverrier, Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018)
2018
Cited alongside, same era.
O. Fawzi, A. Grospellier, A. Leverrier, Efficient decoding of random errors for quantum expander codes, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (2018)
2018
Cited alongside, same era.
A. Grospellier, A. Krishna, Numerical study of hypergraph product codes, arXiv:1810.03681 (2018)
2018
Cited alongside, same era.
R. Chao, B. W. Reichardt, Quantum Error Correction with Only Two Extra Qubits, Phys. Rev. Lett. 121
2018
Cited alongside, same era.
J. Roffe, D. R. White, S. Burton, E. Campbell, Decoding across the quantum low-density parity-check code landscape, Phys. Rev. Res. 2
2020
Cited alongside, same era.
C. Gidney, M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5
2021
Cited alongside, same era.
N. P. Breuckmann, J. N. Eberhardt, Quantum Low-Density Parity-Check Codes, PRX Quantum 2
2021
Cited alongside, same era.
Later among the works it cites.
D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuletić, M. D. Lukin, A quantum processor based on coherent transport of entangled atom arrays, Nature 604
2022
Later among the works it cites.
Google Quantum AI, Suppressing quantum errors by scaling a surface code logical qubit, Nature 614
2023
Later among the works it cites.
I. Dinur, M.-H. Hsieh, T.-C. Lin, T. Vidick, Good Quantum LDPC Codes with Linear Time Decoders, STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, June 2023, Pages 905-918
2023
Later among the works it cites.
A. Leverrier, G. Zémor, Decoding Quantum Tanner Codes, IEEE Transactions on Information Theory (Volume: 69, Issue: 8, August 2023)
2023
Later among the works it cites.
S. Gu, C. A. Pattison, E. Tang, An Efficient Decoder for a Linear Distance Quantum LDPC Code, STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (June 2023), 919
2023
Later among the works it cites.
2023
Later among the works it cites.
A. O. Quintavalle, P. Webster, M. Vasmer, Partitioning qubits in hypergraph product codes to implement logical gates, Quantum 7
2023
Later among the works it cites.
M. A. Webster, A. O. Quintavalle, S. D. Bartlett, Transversal diagonal logical operators for stabiliser codes, New J. Phys. 25
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ć, M. D. Lukin, High-fidelity parallel entangling gates on a neutral-atom quantum computer, Nature 622
2023
Later among the works it cites.
2024
Closest in time.
Q. Xu, J. P. B. Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz et al., Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays, Nat. Phys. https://doi.org/10.1038/s41567-024-02479-z (2024)
2024
Closest in time.
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature 627, 778–782 (2024)
2024
Closest in time.
H. Yamasaki, M. Koashi, Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation, Nat. Phys. 20
2024
Closest in time.
C. N. Self, M. Benedetti, D. Amaro, Protecting expressive circuits with a quantum error detection code. Nat. Phys. 20, 219–224 (2024)
2024
Closest in time.
K. Yamamoto, S. Duffield, Y. Kikuchi, D. M. Ramo, Demonstrating Bayesian quantum phase estimation with quantum error detection. Phys. Rev. Res. 6, 013221 (2024)
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
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. B. Ataides, N. Maskara, I. Cong, X. Gao, P. S. Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature 626
2024
Closest in time.