Built on

R. P. Feynman, Simulating physics with computers, Int. J. Theor. Physics 21, 467-488 (1982)
1982
Earlier work this paper cites.
L. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79, 325 (1997), arXiv:quant-ph/9706033, https://doi.org/10.1103/PhysRevLett.79.325
1997
Earlier work this paper cites.
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput. 26, 1510-1523 (1997), arXiv:quant-ph/9701001, https://doi.org/10.1137/S0097539796300933
1997
Earlier work this paper cites.
P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Rev. 41, 303-332 (1999), https://doi.org/10.1137/S0036144598347011
1999
Earlier work this paper cites.
R. B. Laughlin and D. Pines, The theory of everything, PNAS 97, 28-31 (2000), https://doi.org/10.1073/pnas.97.1.28
2000
Earlier work this paper cites.
D. A. Spielman and S.-H. Teng, Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time, Journal of the ACM 51, 385-463 (2004), arXiv:cs/0111050, https://doi.org/10.1145/990308.990310
2004
Earlier work this paper cites.
D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, Adiabatic quantum computation is equivalent to standard quantum computation, SIAM Rev. 50, 755-787 (2008), arXiv:quant-ph/0405098
2008
Earlier work this paper cites.
S. Bravyi, D. DiVincenzo, R. I. Oliveira, and B. M. Terhal, The complexity of stoquastic local Hamiltonian problems, Quant. Inf. Comp. 8, 0361-0385 (2008), arXiv:quant-ph/0606140
2008
Earlier work this paper cites.
D. J. Bernstein, J. Buchmann, E. Dahmen, editors, Post-Quantum Cryptography
2009
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009), arXiv:0811.3171, https://doi.org/10.1103/PhysRevLett.103.150502
Original
2009
Earlier work this paper cites.
D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, Proceedings of Symposia in Applied Matthematics 68 (2010), arXiv:0904.2557
Original
2010
Earlier work this paper cites.
J. Preskill, Quantum computing and the entanglement frontier, 25th Solvay Conference on Physics (2011), arXiv:1203.5813
Original
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, Phys. Rev. A 86, 032324 (2012), arXiv:1208.0928, https://doi.org/10.1103/PhysRevA.86.032324
Original
2012
Earlier work this paper cites.
B. D. Clader, B. C. Jacobs, and C. R. Sprouse, Preconditioned quantum linear system algorithm, Phys. Rev. Lett. 110, 250504 (2013), arXiv:1301.2340, https://doi.org/10.1103/PhysRevLett.110.250504
Original
2013
Earlier work this paper cites.
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O’Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and J. M. Martinis, Superconducting quantum circuits at the surface code threshold for fault tolerance, Nature 508, 500-503 (2014), arXiv:1402.4848, https://doi.org/10.1038/nature13171
Original
2014
Earlier work this paper cites.
R. Alléaume, C. Branciard, J. Bouda, T. Debuisschert, M. Dianati, N. Gisin, M. Godfrey, P. Grangier, T. Länger, N. Lütkenhaus, C. Monyk, P. Painchault, M. Peev, A. Poppe, T. Pornin, J. Rarity, R. Renner, G. Ribordy, M. Riguidel, L. Salvail, A. Shields, H. Weinfurter, and A. Zeilinger, Using quantum key distribution for cryptographic purposes: a survey, Theoretical Computer Science 560, 62-81 (2014), arXiv:quant-ph/0701168, https://doi.org/10.1016/j.tcs.2014.09.018
2014
Earlier work this paper cites.
S. Khot, Hardness of approximation, Proceedings of the International Congress of Mathematicians (2014)
2014
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv:1411.4028 (2014)
Original
2014
Earlier work this paper cites.
T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup, Science 345, 420-424 (2014), https://doi.org/10.1126/science.1252319
2014
Earlier work this paper cites.

Similar

A. Montanaro, Quantum algorithms: an overview, npj Quantum Information, 15023 (2016), arXiv:1511.04206, https://doi.org/10.1038/npjqi.2015.23
Original
2015
Cited alongside, same era.
Y. LeCun, Y. Bengio, and G. Hinton, Deep learning, Nature 521, 436-444 (2015), https://doi.org/10.1038/nature14539
2015
Cited alongside, same era.
S. Aaronson, Read the fine print, Nature Physics 11, 291-293 (2015), https://doi.org/10.1038/nphys3272
2015
Cited alongside, same era.
D. Wecker, M. B. Hastings, N. Wiebe, B. K. Clark, C. Nayak, and M. Troyer, Solving strongly correlated electron models on a quantum computer, Phys. Rev. A 92, 062310 (2015), arXiv:1506.05135, https://doi.org/10.1103/PhysRevA.92.062318
Original
2015
Cited alongside, same era.
S. Das Sarma, M. Freedman, and C. Nayak, Majorana zero modes and topological quantum computation, npj Quantum Information 1, 15001 (2015), arXiv:1501.02813, https://doi.org/10.1038/npjqi.2015.1

Then

I. H. Kim, Noise-resilient preparation of quantum many-body ground states, arXiv:1703.00032 (2017)
Original
2017
Later among the works it cites.
I. H. Kim and B. Swingle, Robust entanglement renormalization on a noisy quantum computer, arXiv:1711.07500 (2017)
Original
2017
Later among the works it cites.
J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Nature 549, 195-202 (2017), arXiv:1611.09347, https://doi.org/10.1038/nature23474
Original
2017
Later among the works it cites.
X. Gao, Z. Zhang, and L. Duan, An efficient quantum algorithm for generative machine learning, arXiv:1711.02038 (2017)
Original
2017
Later among the works it cites.
P. C. S. Costa, S. Jordan, and A. Ostrander, Quantum algorithm for simulating the wave equation, arXiv:1711.05394 (2017)

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2018

Quantum Computing in the NISQ era and beyond

Preskill, John

Understand

Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future.

Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably.
NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away --- we should regard it as a significant step toward the more powerful quantum technologies of the future.
Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.

Built on

R. P. Feynman, Simulating physics with computers, Int. J. Theor. Physics 21, 467-488 (1982)
1982
Earlier work this paper cites.
L. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79, 325 (1997), arXiv:quant-ph/9706033, https://doi.org/10.1103/PhysRevLett.79.325
1997
Earlier work this paper cites.
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput. 26, 1510-1523 (1997), arXiv:quant-ph/9701001, https://doi.org/10.1137/S0097539796300933
1997
Earlier work this paper cites.
P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Rev. 41, 303-332 (1999), https://doi.org/10.1137/S0036144598347011
1999
Earlier work this paper cites.
R. B. Laughlin and D. Pines, The theory of everything, PNAS 97, 28-31 (2000), https://doi.org/10.1073/pnas.97.1.28
2000
Earlier work this paper cites.
D. A. Spielman and S.-H. Teng, Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time, Journal of the ACM 51, 385-463 (2004), arXiv:cs/0111050, https://doi.org/10.1145/990308.990310
2004
Earlier work this paper cites.
D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, Adiabatic quantum computation is equivalent to standard quantum computation, SIAM Rev. 50, 755-787 (2008), arXiv:quant-ph/0405098
2008
Earlier work this paper cites.
S. Bravyi, D. DiVincenzo, R. I. Oliveira, and B. M. Terhal, The complexity of stoquastic local Hamiltonian problems, Quant. Inf. Comp. 8, 0361-0385 (2008), arXiv:quant-ph/0606140
2008
Earlier work this paper cites.
D. J. Bernstein, J. Buchmann, E. Dahmen, editors, Post-Quantum Cryptography
2009
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009), arXiv:0811.3171, https://doi.org/10.1103/PhysRevLett.103.150502
Original
2009
Earlier work this paper cites.
D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, Proceedings of Symposia in Applied Matthematics 68 (2010), arXiv:0904.2557
Original
2010
Earlier work this paper cites.
J. Preskill, Quantum computing and the entanglement frontier, 25th Solvay Conference on Physics (2011), arXiv:1203.5813
Original
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, Phys. Rev. A 86, 032324 (2012), arXiv:1208.0928, https://doi.org/10.1103/PhysRevA.86.032324
Original
2012
Earlier work this paper cites.
B. D. Clader, B. C. Jacobs, and C. R. Sprouse, Preconditioned quantum linear system algorithm, Phys. Rev. Lett. 110, 250504 (2013), arXiv:1301.2340, https://doi.org/10.1103/PhysRevLett.110.250504
Original
2013
Earlier work this paper cites.
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O’Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and J. M. Martinis, Superconducting quantum circuits at the surface code threshold for fault tolerance, Nature 508, 500-503 (2014), arXiv:1402.4848, https://doi.org/10.1038/nature13171
Original
2014
Earlier work this paper cites.
R. Alléaume, C. Branciard, J. Bouda, T. Debuisschert, M. Dianati, N. Gisin, M. Godfrey, P. Grangier, T. Länger, N. Lütkenhaus, C. Monyk, P. Painchault, M. Peev, A. Poppe, T. Pornin, J. Rarity, R. Renner, G. Ribordy, M. Riguidel, L. Salvail, A. Shields, H. Weinfurter, and A. Zeilinger, Using quantum key distribution for cryptographic purposes: a survey, Theoretical Computer Science 560, 62-81 (2014), arXiv:quant-ph/0701168, https://doi.org/10.1016/j.tcs.2014.09.018
2014
Earlier work this paper cites.
S. Khot, Hardness of approximation, Proceedings of the International Congress of Mathematicians (2014)
2014
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv:1411.4028 (2014)
Original
2014
Earlier work this paper cites.
T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup, Science 345, 420-424 (2014), https://doi.org/10.1126/science.1252319
2014
Earlier work this paper cites.

Similar

A. Montanaro, Quantum algorithms: an overview, npj Quantum Information, 15023 (2016), arXiv:1511.04206, https://doi.org/10.1038/npjqi.2015.23
Original
2015
Cited alongside, same era.
Y. LeCun, Y. Bengio, and G. Hinton, Deep learning, Nature 521, 436-444 (2015), https://doi.org/10.1038/nature14539
2015
Cited alongside, same era.
S. Aaronson, Read the fine print, Nature Physics 11, 291-293 (2015), https://doi.org/10.1038/nphys3272
2015
Cited alongside, same era.
D. Wecker, M. B. Hastings, N. Wiebe, B. K. Clark, C. Nayak, and M. Troyer, Solving strongly correlated electron models on a quantum computer, Phys. Rev. A 92, 062310 (2015), arXiv:1506.05135, https://doi.org/10.1103/PhysRevA.92.062318
Original
2015
Cited alongside, same era.
S. Das Sarma, M. Freedman, and C. Nayak, Majorana zero modes and topological quantum computation, npj Quantum Information 1, 15001 (2015), arXiv:1501.02813, https://doi.org/10.1038/npjqi.2015.1

Then

I. H. Kim, Noise-resilient preparation of quantum many-body ground states, arXiv:1703.00032 (2017)
Original
2017
Later among the works it cites.
I. H. Kim and B. Swingle, Robust entanglement renormalization on a noisy quantum computer, arXiv:1711.07500 (2017)
Original
2017
Later among the works it cites.
J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Nature 549, 195-202 (2017), arXiv:1611.09347, https://doi.org/10.1038/nature23474
Original
2017
Later among the works it cites.
X. Gao, Z. Zhang, and L. Duan, An efficient quantum algorithm for generative machine learning, arXiv:1711.02038 (2017)
Original
2017
Later among the works it cites.
P. C. S. Costa, S. Jordan, and A. Ostrander, Quantum algorithm for simulating the wave equation, arXiv:1711.05394 (2017)

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Original

2015

Cited alongside, same era.

S. Boixo, S. V. Isakov, V. N. Smelyansky, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14, 595-600 (2018), arXiv:1608.00263 (2016), https://doi.org/10.1038/s41567-018-0124-x

Original

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, Phys. Rev. Lett. 117, 060504 (2016), arXiv:1512.04600, https://doi.org/10.1103/PhysRevLett.117.060504

Original

2016

Cited alongside, same era.

S. Muralidharan, L. Li, J. Kim, N Lütkenhaus, M. D. Lukin, and L. Jiang, Efficient long distance quantum communication, Scientific Reports 6, 20463 (2016), arXiv:1509.08435, https://doi.org/10.1038/srep20463

Original

2016

Cited alongside, same era.

J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, The theory of variational hybrid quantum-classical algorithms, New J. Phys. 18, 023023 (2016), arXiv:1509.04279, https://doi.org/10.1038/ncomms5213

Original

2016

Cited alongside, same era.

M. Jarret, S. P. Jordan, and B. Lackey, Adiabatic optimization versus diffusion Monte Carlo, Phys. Rev. A 94, 042318 (2016), arXiv:1607.03389, https://doi.org/10.1103/PhysRevA.94.042318

Original

2016

Cited alongside, same era.

A. Montanaro and S. Pallister, Quantum algorithms and the finite element method, Phys. Rev. A 93, 032324 (2016), arXiv:1512.05903, https://doi.org/10.1103/PhysRevA.93.032324

Original

2016

Cited alongside, same era.

I. Kerenidis and A. Prakash, Quantum recommendation systems, arXiv:1603.08675 (2016)

Original

2016

Cited alongside, same era.

Original

2017