Fetching the paper…
Reading the bibliography…
Atomic, molecular and optical (AMO) approaches to quantum computing are promising due to their increased connectivity, long coherence times and apparent scalability.
J. Edmonds, Paths, Trees, and Flowers, Canadian Journal of Mathematics 17
1965
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Physical Review A 71
2005
Earlier work this paper cites.
S. Bravyi, M. B. Hastings, and F. Verstraete, Lieb-Robinson Bounds and the Generation of Correlations and Topological Quantum Order, Physical Review Letters 97
2006
Earlier work this paper cites.
B. Eastin and E. Knill, Restrictions on Transversal Encoded Quantum Gate Sets, Physical Review Letters 102
2009
Earlier work this paper cites.
J.-P. Tillich and G. Zemor, Quantum LDPC codes with positive rate and minimum distance proportional to n 1 / 2 n^{1/2} , in 2009 IEEE International Symposium on Information Theory (2009) pp. 799–803, iSSN: 2157-8117
2009
Earlier work this paper cites.
M. B. Hastings, Topological Order at Nonzero Temperature, Physical Review Letters 107
2011
Earlier work this paper cites.
D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New Journal of Physics 14
2012
Earlier work this paper cites.
B. M. Terhal, Quantum error correction for quantum memories, Reviews of Modern Physics 87
2015
Earlier work this paper cites.
T. Jochym-O’Connor, A. Kubica, and T. J. Yoder, Disjointness of Stabilizer Codes and Limitations on Fault-Tolerant Logical Gates, Physical Review X 8
2018
Earlier work this paper cites.
C. Gidney, Halving the cost of quantum addition, Quantum 2
2018
Earlier work this paper cites.
C. Gidney and A. G. Fowler, Efficient magic state factories with a catalyzed $|CCZ\rangle$ to $2|T\rangle$ transformation, Quantum 3
2019
Earlier work this paper cites.
2021
Earlier work this paper cites.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Earlier work this paper cites.
N. Delfosse and N. H. Nickerson, Almost-linear time decoding algorithm for topological codes, Quantum 5
2021
Earlier work this paper cites.
N. P. Breuckmann and J. N. Eberhardt, Quantum Low-Density Parity-Check Codes, PRX Quantum 2
2021
Earlier work this paper cites.
P. Panteleev and G. Kalachev, Degenerate Quantum LDPC Codes With Good Finite Length Performance, Quantum 5
2021
Earlier work this paper cites.
F. A. An, A. Ransford, A. Schaffer, L. R. Sletten, J. Gaebler, J. Hostetter, and G. Vittorini, High Fidelity State Preparation and Measurement of Ion Hyperfine Qubits with I > 1 2 {I}\textgreater\frac{1}{2} , Physical Review Letters 129
2022
Earlier work this paper cites.
S. Krinner, N. Lacroix, A. Remm, A. Di Paolo, E. Genois, C. Leroux, C. Hellings, S. Lazar, F. Swiadek, J. Herrmann, G. J. Norris, C. K. Andersen, M. Müller, A. Blais, C. Eichler, and A. Wallraff, Realizing repeated quantum error correction in a distance-three surface code, Nature 605
2022
Earlier work this paper cites.
C. Chamberland and E. T. Campbell, Universal Quantum Computing with Twist-Free and Temporally Encoded Lattice Surgery, PRX Quantum 3
2022
Earlier work this paper cites.
2022
Cited alongside, same era.
2023
Cited alongside, same era.
L. Skoric, D. E. Browne, K. M. Barnes, N. I. Gillespie, and E. T. Campbell, Parallel window decoding enables scalable fault tolerant quantum computation, Nature Communications 14
2023
Cited alongside, same era.
2023
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
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 627
2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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 626
2024
Cited alongside, same era.
2024
Cited alongside, same era.
2024
Cited alongside, same era.
2024
Cited alongside, same era.
2024
Cited alongside, same era.
H. Ali, J. Marques, O. Crawford, J. Majaniemi, M. Serra-Peralta, D. Byfield, B. Varbanov, B. M. Terhal, L. DiCarlo, and E. T. Campbell, Reducing the error rate of a superconducting logical qubit using analog readout information, Physical Review Applied 22
2024
Cited alongside, same era.
M. Cain, C. Zhao, H. Zhou, N. Meister, J. P. B. Ataides, A. Jaffe, D. Bluvstein, and M. D. Lukin, Correlated Decoding of Logical Algorithms with Transversal Gates, Physical Review Letters 133
2024
Cited alongside, same era.
2024
Cited alongside, same era.
Q. Xu, J. P. Bonilla Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasić, M. D. Lukin, L. Jiang, and H. Zhou, Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays, Nature Physics 20
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
C. Poole, T. M. Graham, M. A. Perlin, M. Otten, and M. Saffman, Architecture for fast implementation of quantum low-density parity-check codes with optimized Rydberg gates, Physical Review A 111
2025
Closest in time.
Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature 638
2025
Closest in time.
2025
Closest in time.
K. Sahay, Y. Lin, S. Huang, K. R. Brown, and S. Puri, Error Correction of Transversal CNOT Gates for Scalable Surface-Code Computation, PRX Quantum 6
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
O. Higgott and C. Gidney, Sparse Blossom: correcting a million errors per core second with minimum-weight matching, Quantum 9
2025
Closest in time.
M. H. Shaw and B. M. Terhal, Lowering Connectivity Requirements for Bivariate Bicycle Codes Using Morphing Circuits, Physical Review Letters 134
2025
Closest in time.
N. Berthusen, D. Devulapalli, E. Schoute, A. M. Childs, M. J. Gullans, A. V. Gorshkov, and D. Gottesman, Toward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes, PRX Quantum 6
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
B. Barber, K. M. Barnes, T. Bialas, O. Buğdaycı, E. T. Campbell, N. I. Gillespie, K. Johar, R. Rajan, A. W. Richardson, L. Skoric, C. Topal, M. L. Turner, and A. B. Ziad, A real-time, scalable, fast and resource-efficient decoder for a quantum computer, Nature Electronics 8
2025
Closest in time.