Fetching the paper…
Reading the bibliography…
In this perspective, we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algorithm with only a small polynomial speedup over the best classical alternative.
1905
Earlier work this paper cites.
Gene M. Amdahl, “Validity of the single processor approach to achieving large scale computing capabilities,” in AFIPS ’67 (Spring): Proceedings of the April 18-20, 1967, Spring Joint Computer Conference (1967) pp. 483–485
1967
Earlier work this paper cites.
Richard P Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
S. Kirkpatrick, C. Gelatt Jr., and M. Vecchi, “Optimization by Simulated Annealing,” Science 220
1983
Earlier work this paper cites.
John L. Gustafson, “Reevaluating Amdahl’s law,” Communications of the ACM 31
1988
Earlier work this paper cites.
P W Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” Proceedings 35th Annual Symposium on Foundations of Computer Science , 124–134 (1994)
1994
Earlier work this paper cites.
Seth Lloyd, “Universal Quantum Simulators,” Science 273
1996
Earlier work this paper cites.
Lov K Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing , STOC ’96 (ACM, New York, NY, USA, 1996) pp. 212–219
1996
Earlier work this paper cites.
Klaus Mølmer and Anders Sørensen, “Multiparticle entanglement of hot trapped ions,” Physical Review Letters 82
1999
Earlier work this paper cites.
Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp, “Quantum amplitude amplification and estimation,” in Quantum Computation and Information , edited by Vitaly I Voloshin, Samuel J. Lomonaco, and Howard E. Brandt (American Mathematical Society, Washington D.C., 2002) Chap. 3, pp. 53–74
2002
Earlier work this paper cites.
David Kielpinski, Chris Monroe, and David J Wineland, “Architecture for a large-scale ion-trap quantum computer,” Nature 417
2002
Earlier work this paper cites.
Alexei Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics 303
2003
Earlier work this paper cites.
Juan José García-Ripoll, Peter Zoller, and J Ignacio Cirac, “Speed optimized two-qubit gates with laser coherent control techniques for ion trap quantum computing,” Physical Review Letters 91
2003
Earlier work this paper cites.
Esma Aïmeur, Gilles Brassard, and Sébastien Gambs, “Machine learning in a quantum world,” in Advances in Artificial Intelligence , edited by Luc Lamontagne and Mario Marchand (Springer Berlin Heidelberg, Berlin, Heidelberg, 2006) pp. 431–442
2006
Earlier work this paper cites.
2006
Earlier work this paper cites.
Robert Raussendorf and Jim Harrington, “Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions,” Physical Review Letters 98
2007
Earlier work this paper cites.
2009
Earlier work this paper cites.
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd, “Quantum Algorithm for Linear Systems of Equations,” Physical Review Letters 103
2009
Earlier work this paper cites.
Bryan Eastin and Emanuel Knill, “Restrictions on Transversal Encoded Quantum Gate Sets,” Physical Review Letters 102
2009
Earlier work this paper cites.
Sergey Bravyi, David Poulin, and Barbara Terhal, “Tradeoffs for reliable quantum information storage in 2d systems,” Physical Review Letters 104
2010
Earlier work this paper cites.
Sergey Bravyi, “Subsystem codes with spatially local generators,” Physical Review A 83
2011
Earlier work this paper cites.
Austin G Fowler, Matteo Mariantoni, John M Martinis, and Andrew N Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A 86
2012
Earlier work this paper cites.
Austin G Fowler, “Time-optimal quantum computation,” arXiv:1210.4626 (2012)
2012
Earlier work this paper cites.
Cody Jones, “Low-overhead constructions for the fault-tolerant Toffoli gate,” Physical Review A 87
2013
Earlier work this paper cites.
Bryan Eastin, “Distilling one-qubit magic states into Toffoli states,” Physical Review A 87
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
Sergey Bravyi and Robert König, “Classification of topologically protected gates for local stabilizer codes,” Physical review letters 110
2013
Earlier work this paper cites.
Adam Paetznick and Ben W Reichardt, “Universal fault-tolerant quantum computation with only transversal gates and error correction,” Physical Review Letters 111
2013
Cited alongside, same era.
Jean-Pierre Tillich and Gilles Zémor, “Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength,” IEEE Transactions on Information Theory 60
2013
Cited alongside, same era.
2013
Cited alongside, same era.
C Monroe, R Raussendorf, A Ruthven, KR Brown, P Maunz, L-M Duan, and J Kim, “Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects,” Physical Review A 89
2014
Cited alongside, same era.
2018
Later among the works it cites.
VM Schäfer, CJ Ballance, K Thirumalai, LJ Stephenson, TG Ballance, AM Steane, and DM Lucas, “Fast quantum logic gates with trapped-ion qubits,” Nature 555
2018
Later among the works it cites.
Colin J Trout, Muyuan Li, Mauricio Gutiérrez, Yukai Wu, Sheng-Tao Wang, Luming Duan, and Kenneth R Brown, “Simulating the performance of a distance-3 surface code in a linear ion trap,” New Journal of Physics 20
2018
Later among the works it cites.
Vlad Negnevitsky, Matteo Marinelli, Karan K Mehta, H-Y Lo, Christa Flühmann, and Jonathan P Home, “Repeated multi-qubit readout and feedback with a mixed-species trapped-ion register,” Nature 563
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Naomi H Nickerson, Joseph F Fitzsimons, and Simon C Benjamin, “Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links,” Physical Review X 4
2014
Cited alongside, same era.
Dominic W Berry, “High-order quantum algorithm for solving linear differential equations,” Journal of Physics A: Mathematical and Theoretical 47
2014
Cited alongside, same era.
Jonas T Anderson, Guillaume Duclos-Cianci, and David Poulin, “Fault-tolerant conversion between the steane and reed-muller quantum codes,” Physical Review Letters 113
2014
Cited alongside, same era.
Tomas Jochym-O’Connor and Raymond Laflamme, “Using concatenated quantum codes for universal fault-tolerant quantum gates,” Physical Review Letters 112
2014
Cited alongside, same era.
Ashley Montanaro, “Quantum speedup of Monte Carlo methods,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471
2015
Cited alongside, same era.
2015
Cited alongside, same era.
David Hucul, Ismail V Inlek, Grahame Vittorini, Clayton Crocker, Shantanu Debnath, Susan M Clark, and Christopher Monroe, “Modular entanglement of atomic qubits using photons and phonons,” Nature Physics 11
2015
Cited alongside, same era.
S V Isakov, I N Zintchenko, T F Ronnow, and M Troyer, “Optimized simulated annealing code for Ising spin glasses,” Computer Physics Communications 192
2015
Cited alongside, same era.
2018
Later among the works it cites.
Earl Campbell, Ankur Khurana, and Ashley Montanaro, “Applying quantum algorithms to constraint satisfaction problems,” Quantum 3
2019
Later among the works it cites.
2019
Later among the works it cites.
Colin D Bruzewicz, John Chiaverini, Robert McConnell, and Jeremy M Sage, “Trapped-ion quantum computing: Progress and challenges,” Applied Physics Reviews 6
2019
Later among the works it cites.
Kevin A Landsman, Yukai Wu, Pak Hong Leung, Daiwei Zhu, Norbert M Linke, Kenneth R Brown, Luming Duan, and C Monroe, “Two-qubit entangling gates within arbitrarily long chains of trapped ions,” Physical Review A 100
2019
Later among the works it cites.
Stephen Crain, Clinton Cahall, Geert Vrijsen, Emma E Wollman, Matthew D Shaw, Varun B Verma, Sae Woo Nam, and Jungsang Kim, “High-speed low-crosstalk detection of a 171 yb+ qubit using superconducting nanowire single photon detectors,” Communications Physics 2
2019
Later among the works it cites.
Michael Vasmer and Dan E Browne, “Three-dimensional surface codes: Transversal gates and fault-tolerant architectures,” Physical Review A 100
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Yuval R. Sanders, Dominic W. Berry, Pedro C. S. Costa, Louis W. Tessler, Nathan Wiebe, Craig Gidney, Hartmut Neven, and Ryan Babbush, “Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization,” PRX Quantum 1
2020
Closest in time.
Ian D. Kivlichan, Craig Gidney, Dominic W. Berry, Nathan Wiebe, Jarrod McClean, Wei Sun, Zhang Jiang, Nicholas Rubin, Austin Fowler, Alán Aspuru-Guzik, Hartmut Neven, and Ryan Babbush, “Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization,” Quantum 4
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
E Torrontegui, D Heinrich, M I Hussain, R Blatt, and J J García-Ripoll, “Ultra-fast two-qubit ion gate using sequences of resonant pulses,” New Journal of Physics 22
2020
Closest in time.
Nikodem Grzesiak, Reinhold Blümel, Kenneth Wright, Kristin M Beck, Neal C Pisenti, Ming Li, Vandiver Chaplin, Jason M Amini, Shantanu Debnath, Jwo-Sy Chen, et al. , “Efficient arbitrary simultaneously entangling gates on a trapped-ion quantum computer,” Nature Communications 11
2020
Closest in time.
2020
Closest in time.
Matthew B. Hastings, “Classical and Quantum Algorithms for Tensor Principal Component Analysis,” Quantum 4
2020
Closest in time.
2020
Closest in time.
LJ Stephenson, DP Nadlinger, BC Nichol, S An, P Drmota, TG Ballance, K Thirumalai, JF Goodwin, DM Lucas, and CJ Ballance, “High-rate, high-fidelity entanglement of qubits across an elementary quantum network,” Physical Review Letters 124
2020
Closest in time.
2020
Closest in time.
Benjamin J Brown, “A fault-tolerant non-clifford gate for the surface code in two dimensions,” Science advances 6
2020
Closest in time.
2020
Closest in time.