Fetching the paper…
Reading the bibliography…
In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates.
S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary, “bibfield journal “bibinfo journal arXiv:quant-ph/9811052“ (“bibinfo year 1998)
1998
Earlier work this paper cites.
D. Gottesman, A. Kitaev, and J. Preskill, Encoding a qubit in an oscillator, “bibfield journal “bibinfo journal Phys. Rev. A“ “textbf “bibinfo volume 64,“ “bibinfo pages 012310 (“bibinfo year 2001)
2001
Earlier work this paper cites.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, “bibfield journal “bibinfo journal Ann. Phys.“ “textbf “bibinfo volume 303,“ “bibinfo pages 2 (“bibinfo year 2003)
2003
Earlier work this paper cites.
2004
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, “bibfield journal “bibinfo journal Phys. Rev. A“ “textbf “bibinfo volume 71,“ “bibinfo pages 022316 (“bibinfo year 2005)
2005
Earlier work this paper cites.
D. E. Browne and T. Rudolph, Resource-efficient linear optical quantum computation, “bibfield journal “bibinfo journal Phys. Rev. Lett.“ “textbf “bibinfo volume 95,“ “bibinfo pages 010501 (“bibinfo year 2005)
2005
Earlier work this paper cites.
H. Bombin, Topological order with a twist: Ising anyons from an Abelian model, “bibfield journal “bibinfo journal Phys. Rev. Lett.“ “textbf “bibinfo volume 105,“ “bibinfo pages 030403 (“bibinfo year 2010)
2010
Earlier work this paper cites.
B. Coecke and R. Duncan, Interacting quantum observables: Categorical algebra and diagrammatics, “bibfield journal “bibinfo journal New Journal of Physics“ “textbf “bibinfo volume 13,“ “bibinfo pages 043016 (“bibinfo year 2011)
2011
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, “bibfield journal “bibinfo journal Phys. Rev. A“ “textbf “bibinfo volume 86,“ “bibinfo pages 032324 (“bibinfo year 2012)
2012
Earlier work this paper cites.
S. Bravyi and J. Haah, Magic-state distillation with low overhead, “bibfield journal “bibinfo journal Phys. Rev. A“ “textbf “bibinfo volume 86,“ “bibinfo pages 052329 (“bibinfo year 2012)
2012
Earlier work this paper cites.
C. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, “bibfield journal “bibinfo journal New J. Phys.“ “textbf “bibinfo volume 14,“ “bibinfo pages 123011 (“bibinfo year 2012)
2012
Earlier work this paper cites.
C. Jones, Low-overhead constructions for the fault-tolerant Toffoli gate, “bibfield journal “bibinfo journal Phys. Rev. A“ “textbf “bibinfo volume 87,“ “bibinfo pages 022328 (“bibinfo year 2013)
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
B. M. Terhal, Quantum error correction for quantum memories, “bibfield journal “bibinfo journal Rev. Mod. Phys.“ “textbf “bibinfo volume 87,“ “bibinfo pages 307 (“bibinfo year 2015)
2015
Earlier work this paper cites.
Y. Li, A magic state’s fidelity can be superior to the operations that created it, “bibfield journal “bibinfo journal New J. Phys.“ “textbf “bibinfo volume 17,“ “bibinfo pages 023037 (“bibinfo year 2015)
2015
Earlier work this paper cites.
M. Gimeno-Segovia, P. Shadbolt, D. E. Browne, and T. Rudolph, From three-photon Greenberger-Horne-Zeilinger states to ballistic universal quantum computation, “bibfield journal “bibinfo journal Phys. Rev. Lett.“ “textbf “bibinfo volume 115,“ “bibinfo pages 020502 (“bibinfo year 2015)
2015
Earlier work this paper cites.
E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, “bibfield journal “bibinfo journal Nature“ “textbf “bibinfo volume 549,“ “bibinfo pages 172 (“bibinfo year 2017)
2017
Earlier work this paper cites.
B. J. Brown, K. Laubscher, M. S. Kesselring, and J. R. Wootton, Poking holes and cutting corners to achieve Clifford gates with the surface code, “bibfield journal “bibinfo journal Phys. Rev. X“ “textbf “bibinfo volume 7,“ “bibinfo pages 021029 (“bibinfo year 2017)
2017
Earlier work this paper cites.
G. H. Low and I. L. Chuang, Optimal Hamiltonian simulation by quantum signal processing, “bibfield journal “bibinfo journal Phys. Rev. Lett.“ “textbf “bibinfo volume 118,“ “bibinfo pages 010501 (“bibinfo year 2017)
2017
Cited alongside, same era.
E. T. Campbell and M. Howard, Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost, “bibfield journal “bibinfo journal Phys. Rev. A“ “textbf “bibinfo volume 95,“ “bibinfo pages 022316 (“bibinfo year 2017)
2017
Cited alongside, same era.
2018
Cited alongside, same era.
J. Haah and M. B. Hastings, Codes and protocols for distilling T T , controlled- S S , and Toffoli gates, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 2,“ “bibinfo pages 71 (“bibinfo year 2018)
2018
R. Duncan, A. Kissinger, S. Perdrix, and J. van de Wetering, Graph-theoretic simplification of quantum circuits with the ZX-calculus, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 4,“ “bibinfo pages 279 (“bibinfo year 2020)
2020
Later among the works it cites.
A. Kissinger and J. van de Wetering, Reducing the number of non-Clifford gates in quantum circuits, “bibfield journal “bibinfo journal Phys. Rev. A“ “textbf “bibinfo volume 102,“ “bibinfo pages 022406 (“bibinfo year 2020)
2020
Later among the works it cites.
2020
Later among the works it cites.
I. D. Kivlichan, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, W. Sun, Z. Jiang, N. Rubin, A. Fowler, A. Aspuru-Guzik, H. Neven, and R. Babbush, Improved fault-tolerant quantum simulation of condensed-phase correlated electrons via trotterization, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 4,“ “bibinfo pages 296 (“bibinfo year 2020)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
2018
Cited alongside, same era.
D. Litinski and F. v. Oppen, Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 2,“ “bibinfo pages 62 (“bibinfo year 2018)
2018
Cited alongside, same era.
C. Gidney, Halving the cost of quantum addition, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 2,“ “bibinfo pages 74 (“bibinfo year 2018)
2018
Cited alongside, same era.
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, “bibfield journal “bibinfo journal Phys. Rev. X“ “textbf “bibinfo volume 8,“ “bibinfo pages 041015 (“bibinfo year 2018)
2018
Cited alongside, same era.
2018
Cited alongside, same era.
D. Litinski, A game of surface codes: Large-scale quantum computing with lattice surgery, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 3,“ “bibinfo pages 128 (“bibinfo year 2019“natexlaba)
2019
Cited alongside, same era.
D. Litinski, Magic state distillation: Not as costly as you think, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 3,“ “bibinfo pages 205 (“bibinfo year 2019“natexlabb)
2019
Cited alongside, same era.
C. Gidney and A. G. Fowler, Efficient magic state factories with a catalyzed | C C Z ⟩ |CCZ\rangle to 2 | T ⟩ 2|T\rangle transformation, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 3,“ “bibinfo pages 135 (“bibinfo year 2019)
2019
Cited alongside, same era.
2020
Later among the works it cites.
2020
Later among the works it cites.
C. Gidney and M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 5,“ “bibinfo pages 433 (“bibinfo year 2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
E. T. Campbell, Early fault-tolerant simulations of the Hubbard model, “bibfield journal “bibinfo journal Quantum Science and Technology“ “textbf “bibinfo volume 7,“ “bibinfo pages 015007 (“bibinfo year 2021)
2021
Later among the works it cites.
S. Chakrabarti, R. Krishnakumar, G. Mazzola, N. Stamatopoulos, S. Woerner, and W. J. Zeng, A threshold for quantum advantage in derivative pricing, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 5,“ “bibinfo pages 463 (“bibinfo year 2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
J. E. Bourassa, R. N. Alexander, M. Vasmer, A. Patil, I. Tzitrin, T. Matsuura, D. Su, B. Q. Baragiola, S. Guha, G. Dauphinais, K. K. Sabapathy, N. C. Menicucci, and I. Dhand, Blueprint for a scalable photonic fault-tolerant quantum computer, “bibfield journal “bibinfo journal Quantum“ “textbf “bibinfo volume 5,“ “bibinfo pages 392 (“bibinfo year 2021)
2021
Later among the works it cites.
2021
Later among the works it cites.
C. Chamberland and E. T. Campbell, Universal quantum computing with twist-free and temporally encoded lattice surgery, “bibfield journal “bibinfo journal PRX Quantum“ “textbf “bibinfo volume 3,“ “bibinfo pages 010331 (“bibinfo year 2022)
2022
Closest in time.
C. Chamberland, K. Noh, P. Arrangoiz-Arriola, E. T. Campbell, C. T. Hann, J. Iverson, H. Putterman, T. C. Bohdanowicz, S. T. Flammia, A. Keller, G. Refael, J. Preskill, L. Jiang, A. H. Safavi-Naeini, O. Painter, and F. G. Brandão, Building a fault-tolerant quantum computer using concatenated cat codes, “bibfield journal “bibinfo journal PRX Quantum“ “textbf “bibinfo volume 3,“ “bibinfo pages 010329 (“bibinfo year 2022)
2022
Closest in time.
I. H. Kim, Y.-H. Liu, S. Pallister, W. Pol, S. Roberts, and E. Lee, Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules, “bibfield journal “bibinfo journal Phys. Rev. Research“ “textbf “bibinfo volume 4,“ “bibinfo pages 023019 (“bibinfo year 2022)
2022
Closest in time.
2022
Closest in time.