Fetching the paper…
Reading the bibliography…
We investigate how hardware specifications can impact the final run time and the required number of physical qubits to achieve a quantum advantage in the fault tolerant regime.
R. P. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics
1982
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,” Proceedings of the Annual ACM Symposium on Theory of Computing
1996
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing
1997
Earlier work this paper cites.
E. Knill, R. Laflamme, and W. H. Zurek, “Resilient quantum computation: Error models and thresholds,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
1998
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, “Quantum codes on a lattice with boundary,” 11 1998
1998
Earlier work this paper cites.
D. Gottesman, “The Heisenberg Representation of Quantum Computers,” 7 1998
1998
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics
2002
Earlier work this paper cites.
P. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” pp. 124–134, Institute of Electrical and Electronics Engineers (IEEE), 2002
2002
Earlier work this paper cites.
A. Y. Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics
2003
Earlier work this paper cites.
R. Raussendorf, S. Bravyi, and J. Harrington, “Long-range quantum entanglement in noisy cluster states,” Physical Review A - Atomic, Molecular, and Optical Physics
2005
Earlier work this paper cites.
S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Physical Review A - Atomic, Molecular, and Optical Physics
2005
Earlier work this paper cites.
R. Raussendorf, J. Harrington, and K. Goyal, “A fault-tolerant one-way quantum computer,” Annals of Physics
2006
Earlier work this paper cites.
C. M. Dawson and M. A. Nielsen, “The Solovay-Kitaev algorithm,” Quantum Information and Computation
2006
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, “Fault-tolerant quantum computation with constant error rate,” SIAM Journal on Computing
2008
Earlier work this paper cites.
E. Torrontegui, S. Ibáñez, X. Chen, A. Ruschhaupt, D. Guéry-Odelin, and J. G. Muga, “Fast atomic transport without vibrational heating,” Physical Review A - Atomic, Molecular, and Optical Physics
2011
Earlier work this paper cites.
H. K. Lau and D. F. James, “Decoherence and dephasing errors caused by the dc Stark effect in rapid ion transport,” Physical Review A - Atomic, Molecular, and Optical Physics
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,” Physical Review A - Atomic, Molecular, and Optical Physics
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 - Atomic, Molecular, and Optical Physics
2012
Earlier work this paper cites.
S. Bravyi and J. Haah, “Magic-state distillation with low overhead,” Physical Review A - Atomic, Molecular, and Optical Physics
2012
Earlier work this paper cites.
A. G. Fowler, “Time-optimal quantum computation,” 2012
2012
Earlier work this paper cites.
A. Walther, F. Ziesel, T. Ruster, S. T. Dawkins, K. Ott, M. Hettrich, K. Singer, F. Schmidt-Kaler, and U. Poschinger, “Controlling fast transport of cold trapped ions,” Physical Review Letters
2012
Earlier work this paper cites.
R. Bowler, J. Gaebler, Y. Lin, T. R. Tan, D. Hanneke, J. D. Jost, J. P. Home, D. Leibfried, and D. J. Wineland, “Coherent diabatic ion transport and separation in a multizone trap array,” Physical Review Letters
2012
Earlier work this paper cites.
A. G. Fowler, S. J. Devitt, and C. Jones, “Surface code implementation of block code state distillation,” Scientific Reports
2013
Earlier work this paper cites.
C. Jones, “Low-overhead constructions for the fault-tolerant Toffoli gate,” Physical Review A - Atomic, Molecular, and Optical Physics
2013
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
2014
Earlier work this paper cites.
A. Peruzzo, J. McClean, P. Shadbolt, M. H. Yung, X. Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications
2014
Earlier work this paper cites.
M. Amy, D. Maslov, and M. Mosca, “Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
2014
Cited alongside, same era.
J. Wallman, C. Granade, R. Harper, and S. T. Flammia, “Estimating the coherence of noise,” New Journal of Physics
2015
Cited alongside, same era.
R. Nigmatullin, C. J. Ballance, N. D. Beaudrap, and S. C. Benjamin, “Minimally complex ion traps as modules for quantum communication and computing,” New Journal of Physics
2016
Cited alongside, same era.
Y. Li and S. C. Benjamin, “Hierarchical surface code for network quantum computing with modules of arbitrary size,” PHYSICAL REVIEW A
2016
Cited alongside, same era.
C. J. Ballance, T. P. Harty, N. M. Linke, M. A. Sepiol, and D. M. Lucas, “High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits,” Physical Review Letters
A. W. Cross, L. S. Bishop, S. Sheldon, P. D. Nation, and J. M. Gambetta, “Validating quantum computers using randomized model circuits,” Physical Review A
2019
Later among the works it cites.
N. de Beaudrap and S. Herbert, “Quantum linear network coding for entanglement distribution in restricted architectures,” Quantum
2019
Later among the works it cites.
M. Vasmer and D. E. Browne, “Three-dimensional surface codes: Transversal gates and fault-tolerant architectures,” Physical Review A
2019
Later among the works it cites.
D. Litinski, “A game of surface codes: Large-scale quantum computing with lattice surgery,” Quantum
2019
Later among the works it cites.
C. Gidney and A. G. Fowler, “Flexible layout of surface code computations using AutoCCZ states,” arXiv
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
J. P. Gaebler, T. R. Tan, Y. Lin, Y. Wan, R. Bowler, A. C. Keith, S. Glancy, K. Coakley, E. Knill, D. Leibfried, and D. J. Wineland, “High-Fidelity Universal Gate Set for Be 9 + Ion Qubits,” Physical Review Letters
2016
Cited alongside, same era.
J. O’gorman, N. H. Nickerson, P. Ross, J. J. Morton, and S. C. Benjamin, “A silicon-based surface code quantum computer,” npj Quantum Information
2016
Cited alongside, same era.
G. H. Low and I. L. Chuang, “Optimal Hamiltonian Simulation by Quantum Signal Processing,” Physical Review Letters
2016
Cited alongside, same era.
Y. R. Sanders, J. J. Wallman, and B. C. Sanders, “Bounding quantum gate error rate based on reported average fidelity,” New Journal of Physics
2016
Cited alongside, same era.
R. Kueng, D. M. Long, A. C. Doherty, and S. T. Flammia, “Comparing Experiments to the Fault-Tolerance Threshold,” Physical Review Letters
2016
Cited alongside, same era.
N. Abdessaied, M. Amy, M. Soeken, and R. Drechsler, “Technology mapping of reversible circuits to Clifford+T quantum circuits,” Proceedings of The International Symposium on Multiple-Valued Logic
2016
Cited alongside, same era.
E. T. Campbell, B. M. Terhal, and C. Vuillot, “Roads towards fault-tolerant universal quantum computation,” Nature
2017
Cited alongside, same era.
G. H. Low and I. L. Chuang, “Hamiltonian simulation by qubitization,” Quantum
2019
Later among the works it cites.
D. W. Berry, C. Gidney, M. Motta, J. R. McClean, and R. Babbush, “Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization,” Quantum
2019
Later among the works it cites.
Z. Li, J. Li, N. S. Dattani, C. J. Umrigar, and G. K. L. Chan, “The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations,” Journal of Chemical Physics
2019
Later among the works it cites.
D. Litinski, “Magic state distillation: Not as costly as you think,” Quantum
2019
Later among the works it cites.
C. Gidney and A. G. Fowler, “Efficient magic state factories with a catalyzed —CCZi ? 2—Ti transformation,” Quantum
2019
Later among the works it cites.
M. Gutiérrez, M. Müller, and A. Bermúdez, “Transversality and lattice surgery: Exploring realistic routes toward coupled logical qubits with trapped-ion quantum processors,” Physical Review A
2019
Later among the works it cites.
M. Webber, S. Herbert, S. Weidt, and W. Hensinger, “Efficient qubit routing for a globally connected trapped ion quantum computer,” arXiv
2020
Later among the works it cites.
J. Roffe, D. R. White, S. Burton, and E. Campbell, “Decoding across the quantum LDPC code landscape,” arXiv
2020
Later among the works it cites.
L. J. Stephenson, D. P. Nadlinger, B. C. Nichol, S. An, P. Drmota, T. G. Ballance, K. Thirumalai, J. F. Goodwin, D. M. Lucas, and C. J. Ballance, “High-Rate, High-Fidelity Entanglement of Qubits Across an Elementary Quantum Network,” Physical Review Letters
2020
Later among the works it cites.
T. R. Scruby, D. E. Browne, P. Webster, and M. Vasmer, “Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code,” arXiv
2020
Later among the works it cites.
V. von Burg, G. H. Low, T. Häner, D. S. Steiger, M. Reiher, M. Roetteler, and M. Troyer, “Quantum computing enhanced computational catalysis,” arXiv
2020
Later among the works it cites.
J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. McClean, N. Wiebe, and R. Babbush, “Even more efficient quantum computations of chemistry through tensor hypercontraction,” arXiv
2020
Later among the works it cites.
T. Häner, S. Jaques, M. Naehrig, M. Roetteler, and M. Soeken, “Improved Quantum Circuits for Elliptic Curve Discrete Logarithms,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2020
Later among the works it cites.
S. T. Flammia and J. J. Wallman, “Efficient Estimation of Pauli Channels,” ACM Transactions on Quantum Computing
2020
Later among the works it cites.
E. J. Zhang, S. Srinivasan, N. Sundaresan, D. F. Bogorin, Y. Martin, J. B. Hertzberg, J. Timmerwilke, E. J. Pritchett, J.-B. Yau, C. Wang, W. Landers, E. P. Lewandowski, A. Narasgond, S. Rosenblatt, G. A. Keefe, I. Lauer, M. B. Rothwell, D. T. McClure, O. E. Dial, J. S. Orcutt, M. Brink, and J. M. Chow, “High-fidelity superconducting quantum processors via laser-annealing of transmon qubits,” 12 2020
2020
Later among the works it cites.
Y. Xu, J. Chu, J. Yuan, J. Qiu, Y. Zhou, L. Zhang, X. Tan, Y. Yu, S. Liu, J. Li, F. Yan, and D. Yu, “High-Fidelity, High-Scalability Two-Qubit Gate Scheme for Superconducting Qubits,” Physical Review Letters
2020
Later among the works it cites.
A. Deshpande, A. Mehta, T. Vincent, N. Quesada, M. Hinsche, M. Ioannou, L. Madsen, J. Lavoie, H. Qi, J. Eisert, D. Hangleiter, B. Fefferman, and I. Dhand, “Quantum Computational Supremacy via High-Dimensional Gaussian Boson Sampling,” 2 2021
2021
Closest in time.
R. Srinivas, S. C. Burd, H. M. Knaack, R. T. Sutherland, A. Kwiatkowski, S. Glancy, E. Knill, D. J. Wineland, D. Leibfried, A. C. Wilson, D. T. Allcock, and D. H. Slichter, “High-fidelity laser-free universal control of trapped ion qubits,” Nature
2021
Closest in time.
J. Eli 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,” Quantum
2021
Closest in time.
C. Gidney and M. Ekerå, “How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits,” Quantum
2021
Closest in time.