Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays

C. Gidney and A. G. Fowler, Flexible layout of surface code computations using AutoCCZ states, arXiv preprint arXiv:1905.08916 10.48550/arxiv.1905.08916 (2019a)

Original

1905

Earlier work this paper cites.

C. Gidney, Windowed quantum arithmetic, arXiv preprint arXiv:1905.07682 (2019a)

Original

1905

Earlier work this paper cites.

C. Gidney, Approximate encoded permutations and piecewise quantum adders, arXiv preprint arXiv:1905.08488 (2019b)

Original

1905

Earlier work this paper cites.

P. W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS , 124 (1994)

1994

Earlier work this paper cites.

A. Y. Kitaev, Quantum measurements and the Abelian Stabilizer Problem, arXiv preprint arXiv:quant-ph/9511026 (1995)

1995

Earlier work this paper cites.

P. W. Shor, Fault-tolerant quantum computation, in Proceedings of 37th conference on foundations of computer science (IEEE, 1996) pp. 56–65

1996

Earlier work this paper cites.

D. J. Wineland, C. Monroe, W. M. Itano, D. Leibfried, B. E. King, and D. M. Meekhof, Experimental Issues in Coherent Quantum-State Manipulation of Trapped Atomic Ions, Journal of Research of the National Institute of Standards and Technology 103

1998

Earlier work this paper cites.

C. Zalka, Fast versions of Shor’s quantum factoring algorithm, arXiv preprint arXiv:quant-ph/9806084 (1998)

1998

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.

C. Wang, J. Harrington, and J. Preskill, Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory, Annals of Physics 303

2003

Earlier work this paper cites.

H. Buhrman and H. Röhrig, Distributed Quantum Computing, in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , Vol. 2747 (Springer Verlag, 2003) pp. 1–20

2003

Earlier work this paper cites.

S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. P. Moulton, A new quantum ripple-carry addition circuit, arXiv preprint arXiv:quant-ph/0410184 (2004)

2004

Earlier work this paper cites.

T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore, A logarithmic-depth quantum carry-lookahead adder, Quantum Information and Computation 6

2004

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.

R. Van Meter and K. M. Itoh, Fast quantum modular exponentiation, Physical Review A 71

2005

Earlier work this paper cites.

T. S. Metodi, D. D. Thaker, A. W. Cross, F. T. Chong, and I. L. Chuang, A Quantum Logic Array microarchitecture: Scalable quantum data movement and computation, Proceedings of the Annual International Symposium on Microarchitecture, MICRO , 305 (2005)

2005

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.

M. G. Whitney, N. Isailovic, Y. Patel, and J. Kubiatowicz, A Fault Tolerant, Area Efficient Architecture for Shor’s Factoring Algorithm, Proceedings - International Symposium on Computer Architecture , 383 (2009)

2009

Earlier work this paper cites.

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2010) p. 676

2010

Earlier work this paper cites.

C. 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.

A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Physical Review A 86

2012

Earlier work this paper cites.

A. G. Fowler, Time-optimal quantum computation, arXiv preprint arXiv:1210.4626 10.48550/arxiv.1210.4626 (2012)

Original

2012

Earlier work this paper cites.

P. Pham and K. M. Svore, A 2D Nearest-Neighbor Quantum Architecture for Factoring in Polylogarithmic Depth, Quantum Information and Computation 13

2012

Earlier work this paper cites.

N. C. Jones, R. Van Meter, A. G. Fowler, P. L. McMahon, J. Kim, T. D. Ladd, and Y. Yamamoto, Layered Architecture for Quantum Computing, Physical Review X 2

2012

Earlier work this paper cites.

C. Monroe, R. Raussendorf, A. Ruthven, K. R. Brown, P. Maunz, L. M. Duan, and J. Kim, Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects, Physical Review A - Atomic, Molecular, and Optical Physics 89

2012

Earlier work this paper cites.

C. Jones, Low-overhead constructions for the fault-tolerant Toffoli gate, Physical Review A 87

2013

Earlier work this paper cites.

T. G. Tiecke, J. D. Thompson, N. P. De Leon, L. R. Liu, V. Vuletić, and M. D. Lukin, Nanophotonic quantum phase switch with a single atom, Nature 2014 508:7495 508

2014

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.

A. Kubica, B. Yoshida, and F. Pastawski, Unfolding the color code, New Journal of Physics 17

2015

Earlier work this paper cites.

J. E. Moussa, Transversal Clifford gates on folded surface codes, Physical Review A 94

2016

Earlier work this paper cites.

G. H. Low and I. L. Chuang, Hamiltonian Simulation by Qubitization, Quantum 3

2016

Earlier work this paper cites.

C. Jones, P. Brooks, and J. Harrington, Gauge color codes in two dimensions, Physical Review A 93

2016

Earlier work this paper cites.

E. Campbell, The Smallest Interesting Colour Code (2016)

2016

Earlier work this paper cites.

E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549

2017

Earlier work this paper cites.

M. Ekerå and J. Håstad, Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers, in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , Vol. 10346 LNCS (Springer Verlag, 2017) pp. 347–363, arXiv:1702.00249

Original

2017

Earlier work this paper cites.

J. O’Gorman and E. T. Campbell, Quantum computation with realistic magic-state factories, Physical Review A 95

2017

Earlier work this paper cites.

M. Reiher, N. Wiebe, K. M. Svore, D. Wecker, and M. Troyer, Elucidating reaction mechanisms on quantum computers, Proceedings of the National Academy of Sciences 114

2017

Earlier work this paper cites.

A. G. Fowler and C. Gidney, Low overhead quantum computation using lattice surgery, arXiv preprint arXiv:1808.06709 10.48550/arxiv.1808.06709 (2018)

Original

2018

Earlier work this paper cites.

C. Gidney, Halving the cost of quantum addition, Quantum 2

2018

Earlier work this paper cites.

R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity, Physical Review X 8

2018

Earlier work this paper cites.

J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2

2018

Earlier work this paper cites.

A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics, Proceedings of the Annual ACM Symposium on Theory of Computing , 193 (2018)

2018

Earlier work this paper cites.

C. Gidney and M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5

2019

Earlier work this paper cites.

D. Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum 3

2019

Earlier work this paper cites.

H. Levine, A. Keesling, G. Semeghini, A. Omran, T. T. Wang, S. Ebadi, H. Bernien, M. Greiner, V. Vuletić, H. Pichler, and M. D. Lukin, Parallel Implementation of High-Fidelity Multiqubit Gates with Neutral Atoms, Physical Review Letters 123

2019

Cited alongside, same era.

C. Vuillot, L. Lao, B. Criger, C. Garcia Almudéver, K. Bertels, and B. M. Terhal, Code deformation and lattice surgery are gauge fixing, New Journal of Physics 21

2019

Cited alongside, same era.

P. Panteleev and G. Kalachev, Degenerate Quantum LDPC Codes With Good Finite Length Performance, Quantum 5

2019

Cited alongside, same era.

V. Gheorghiu and M. Mosca, Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes, arXiv preprint arXiv:1902.02332 (2019)

Original

2019

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

Later among the works it cites.

X. Tan, F. Zhang, R. Chao, Y. Shi, and J. Chen, Scalable Surface-Code Decoders with Parallelization in Time, PRX Quantum 4

2023

Later among the works it cites.

H. Bombín, C. Dawson, Y.-H. Liu, N. Nickerson, F. Pastawski, and S. Roberts, Modular decoding: parallelizable real-time decoding for quantum computers, arXiv preprint arXiv:2303.04846 10.48550/arxiv.2303.04846 (2023)

Original

2023

Later among the works it cites.

O. Higgott, T. C. Bohdanowicz, A. Kubica, S. T. Flammia, and E. T. Campbell, Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes, Physical Review X 13

2023

Later among the works it cites.

H. Choi, F. T. Chong, D. Englund, and Y. Ding, Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations, arXiv preprint arXiv:2303.17380 (2023)