Fetching the paper…
Reading the bibliography…
Demonstrating a quantum computational speedup is a crucial milestone for near-term quantum technology.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1910
Earlier work this paper cites.
R. P. Feynman, Simulating physics with computers , Int J. Theor Phys 21
1982
Earlier work this paper cites.
L. Stockmeyer, On approximation algorithms for # P , SIAM J. Comput. 14
1985
Earlier work this paper cites.
L. Welch and E. Berlekamp, Error correction for algebraic block codes , US Patent , US4633470 (1986)
1986
Earlier work this paper cites.
R. Lipton, New directions in testing , Dist. Comp. Crypt. 2
1991
Earlier work this paper cites.
R. Paturi, On the degree of polynomials that approximate symmetric Boolean functions , Proc. ACM STOC , 468 (1992)
1992
Earlier work this paper cites.
S. Lloyd, Universal quantum simulators , Science 273
1996
Earlier work this paper cites.
B. Nachtergaele, The spectral gap for some spin chains with disrete symmetry breaking , Commun. Math. Phys. 175
1996
Earlier work this paper cites.
P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer , SIAM J. Sci. Statist.Comput. 41
1999
Earlier work this paper cites.
J.-L. Brylinski and R. Brylinski, Universal quantum gates , (2001), arXiv:quant-ph/0108062
2001
Earlier work this paper cites.
M. J. Bremner, C. M. Dawson, J. L. Dodd, A. Gilchrist, A. W. Harrow, D. Mortimer, M. A. Nielsen, and T. J. Osborne, A practical scheme for quantum computation with any two-qubit entangling gate , Phys. Rev. Lett. 89
2002
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games , Quant. Inf. Comp. 4
2004
Earlier work this paper cites.
J. Emerson, R. Alicki, and K. Zyczkowski, Scalable noise estimation with random unitary operators , J. Opt. B , 347 (2005)
2005
Earlier work this paper cites.
E. A. Rakhmanov, Bounds for polynomials with a unit discrete norm , Ann. Math. 165
2007
Earlier work this paper cites.
W. G. Brown, Y. S. Weinstein, and L. Viola, Quantum pseudorandomness from cluster-state quantum computation , Phys. Rev. A 77
2008
Earlier work this paper cites.
A. W. Harrow and R. A. Low, Random quantum circuits are approximate 2-designs , Commun. Math. Phys. 291
2009
Earlier work this paper cites.
D. Aharonov, I. Arad, Z. Landau, and U. Vazirani, The detectability lemma and quantum gap amplification , Prof. Ann. ACM Symp. T. Comp. , 417426 (2009)
2009
Cited alongside, same era.
I. Bloch, J. Dalibard, and S. Nascimbene, Quantum simulations with ultracold quantum gases , Nature Phys. 8
2012
Cited alongside, same era.
S. Trotzky, Y.-A. Chen, A. Flesch, I. P. McCulloch, U. Schollwöck, J. Eisert, and I. Bloch, Probing the relaxation towards equilibrium in an isolated strongly correlated one-dimensional Bose gas , Nature Phys. 8
2012
Cited alongside, same era.
O. Szehr, F. Dupuis, M. Tomamichel, and R. Renner, Decoupling with unitary approximate two-designs , New J. Phys. 15
2013
Cited alongside, same era.
C. Hirche and C. Morgan, Efficient achievability for quantum protocols using decoupling theorems , Proc. 2014 IEEE Int. Symp. Info. Theory , 536 (2014)
2017
Later among the works it cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Achieving quantum supremacy with sparse and noisy commuting quantum computations , Quantum 1
2017
Later among the works it cites.
J. Miller, S. Sanders, and A. Miyake, Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification , Phys. Rev. A 96
2017
Later among the works it cites.
A. Mantri, R. F. Demarie, and J. F. Fitzsimons, Universality of quantum computation with cluster states and (X,Y)-plane measurements , Sci. Rep. 7
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
F. Dupuis, M. Berta, J. Wullschleger, and R. Renner, One-shot decoupling , Commun. Math. Phys. 328
2014
Cited alongside, same era.
S. Braun, M. Friesdorf, J. S. Hodgman, M. Schreiber, J. P. Ronzheimer, A. Riera, M. del Rey, I. Bloch, J. Eisert, and U. Schneider, Emergence of coherence and the dynamics of quantum phase transitions , PNAS 112
2015
Cited alongside, same era.
T. Cubitt, D. Perez-Garcia, and M. M. Wolf, Undecidability of the spectral gap , Nature 528
2015
Cited alongside, same era.
J.-y. Choi, S. Hild, J. Zeiher, P. Schauß, A. Rubio-Abadal, T. Yefsah, V. Khemani, D. A. Huse, I. Bloch, and C. Gross, Exploring the many-body localization transition in two dimensions , Science 352
2016
Cited alongside, same era.
A. Anshu, I. Arad, and T. Vidick, A simple proof of the detectability lemma and spectral gap amplification , Phys. Rev. B 93
2016
Cited alongside, same era.
M. Reiher, N. Wiebe, K. M. Svore, D. Wecker, and M. Troyer, Elucidating reaction mechanisms on quantum computers , Proc. Natl. Ac. Sc. 114
2017
Cited alongside, same era.
H. Bernien, S. Schwartz, A. Keesling, H. Levine, A. Omran, H. Pichler, S. Choi, A. S. Zibrov, M. Endres, M. Greiner, V. Vuletic, and M. D. Lukin, Probing many-body dynamics on a 51-atom quantum simulator , Nature 551
2017
Cited alongside, same era.
2018
Later among the works it cites.
J. Bermejo-Vega, D. Hangleiter, M. Schwarz, R. Raussendorf, and J. Eisert, Architectures for quantum simulation showing a quantum speedup , Phys. Rev. X 8
2018
Later among the works it cites.
D. Hangleiter, J. Bermejo-Vega, M. Schwarz, and J. Eisert, Anticoncentration theorems for schemes showing a quantum speedup , Quantum 2
2018
Later among the works it cites.
2018
Later among the works it cites.
A. Bouland, J. F. Fitzsimons, and D. E. Koh, Complexity classification of conjugated Clifford circuits , in Proc. 33rd Comp. Compl. Conf. (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018) p. 21
2018
Later among the works it cites.
I. Roth, R. Kueng, S. Kimmel, Y.-K. Liu, D. Gross, J. Eisert, and M. Kliesch, Recovering quantum gates from few average gate fidelities , Phys. Rev. Lett. 121
2018
Later among the works it cites.
R. Mezher, J. Ghalbouni, J. Dgheim, and D. Markham, Efficient quantum pseudorandomness with simple graph states , Phys. Rev. A 97
2018
Later among the works it cites.
2018
Later among the works it cites.
R. Movassagh, Efficient unitary paths and quantum computational supremacy: A proof of average-case hardness of Random Circuit Sampling , (2018), arXiv:1810:04681
2018
Later among the works it cites.
2018
Later among the works it cites.
D. Litinski, A game of surface codes: Large-scale quantum computing with lattice surgery , Quantum 3
2019
Closest in time.
D. Hangleiter, M. Kliesch, J. Eisert, and C. Gogolin, Sample complexity of device-independently certified “quantum supremacy” , Phys. Rev. Lett. 122
2019
Closest in time.