Fetching the paper…
Reading the bibliography…
One of the main aims in the field of quantum simulation is to achieve a quantum speedup, often referred to as "quantum computational supremacy", referring to the experimental realization of a quantum device that computationally outperforms classical computers.
C. E. Porter and R. G. Thomas, “Fluctuations of nuclear reaction widths,”
1956
Earlier work this paper cites.
J. A. Bondy,
1976
Earlier work this paper cites.
L. G. Valiant, “The complexity of computing the permanent,” Th. Comp. Sc
1979
Earlier work this paper cites.
R. M. Karp and R. J. Lipton, “Some connections between nonuniform and uniform complexity classes,” in
1980
Earlier work this paper cites.
L. Stockmeyer, “On approximation algorithms for
1985
Earlier work this paper cites.
S. Toda, “PP is as hard as the polynomial-time hierarchy,” SIAM Journal on Computing
1991
Earlier work this paper cites.
P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,”
1994
Earlier work this paper cites.
S. Lloyd, “Universal quantum simulators,”
1996
Earlier work this paper cites.
P. W. Shor, “Fault-tolerant quantum computation,” in
1996
Earlier work this paper cites.
E. Knill, R. Laflamme, and W. Zurek, “Threshold accuracy for quantum computation,” preprint (1996),
1996
Earlier work this paper cites.
D. Jaksch, H.-J. Briegel, J. I. Cirac, C. W. Gardiner, and P. Zoller, “Entanglement of atoms via cold controlled collisions,” Phys. Rev. Lett
1999
Earlier work this paper cites.
M. A. Nielsen, “Conditions for a class of entanglement transformations,” Phys. Rev. Lett
1999
Earlier work this paper cites.
P. O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, “A new universal and fault-tolerant quantum basis,” Inf. Proc. Lett
2000
Earlier work this paper cites.
X. Zhou, D. W. Leung, and I. L. Chuang, “Methodology for quantum logic gate construction,”
2000
Earlier work this paper cites.
R. Raussendorf and H. J. Briegel, “A one-way quantum computer,”
2001
Earlier work this paper cites.
F. Haake,
2001
Earlier work this paper cites.
O. Mandel, M. Greiner, A. Widera, T. Rom, T. W. Hänsch, and I. Bloch, “Controlled collisions for multiparticle entanglement of optically trapped atoms,” Nature
2003
Earlier work this paper cites.
R. Raussendorf, D. E. Browne, and H. J. Briegel, “Measurement-based quantum computation on cluster states,”
2003
Earlier work this paper cites.
J. Emerson, Y. S. Weinstein, M. Saraceno, S. Lloyd, and D. G. Cory, “Pseudo-random unitary operators for quantum information processing,”
2003
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, “Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games,” Quantum Information & Computation
2004
Earlier work this paper cites.
F. Verstraete and J. I. Cirac, “Valence-bond states for quantum computation,” Phys. Rev. A
2004
Earlier work this paper cites.
M. Hein, J. Eisert, and H. J. Briegel, “Multi-particle entanglement in graph states,” Phys. Rev. A
2004
Earlier work this paper cites.
L. Fortnow, “Beyond NP: The work and legacy of Larry Stockmeyer,” in
2005
Earlier work this paper cites.
J. Emerson, E. Livine, and S. Lloyd, “Convergence conditions for random quantum circuits,”
2005
Earlier work this paper cites.
D. Poulin, “Stabilizer formalism for operator quantum error correction,” Phys. Rev. Lett
2005
Earlier work this paper cites.
A. Widera, F. Gerbier, S. Fölling, T. Gericke, O. Mandel, and I. Bloch, “Coherent collisional spin dynamics in optical lattices,” Phys. Rev. Lett
2005
Earlier work this paper cites.
S. Aaronson, “Quantum computing, postselection, and probabilistic polynomial-time,” Proc. Roy. Soc. A
2005
Earlier work this paper cites.
A. M. Childs, D. W. Leung, and M. A. Nielsen, “Unified derivations of measurement-based schemes for quantum computation,”
2005
Earlier work this paper cites.
M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest, and H.-J. Briegel, “Entanglement in graph states and its applications,” in
2006
Earlier work this paper cites.
D. Gross and J. Eisert, “Novel schemes for measurement-based quantum computation,” Phys. Rev. Lett
2007
Earlier work this paper cites.
S. Bravyi and R. Raussendorf, “Measurement-based quantum computation with the toric code states,”
2007
Cited alongside, same era.
D. Aharonov and M. Ben-Or, “Fault-tolerant quantum computation with constant error rate,”
2008
Cited alongside, same era.
W. G. Brown, Y. S. Weinstein, and L. Viola, “Quantum pseudorandomness from cluster-state quantum computation,”
2008
Cited alongside, same era.
M. Van den Nest, W. Dür, and H. J. Briegel, “Completeness of the classical 2D Ising model and universal quantum computation,”
2008
Cited alongside, same era.
W. S. Bakr, J. I. Gillen, A. Peng, S. Fölling, and M. Greiner, “A quantum gas microscope for detecting single atoms in a Hubbard-regime optical lattice,” Nature
2009
Cited alongside, same era.
2014
Later among the works it cites.
D. Wecker and K. M. Svore, “LIQUi
2014
Later among the works it cites.
A. Matsuo, K. Fujii, and N. Imoto, “Quantum algorithm for an additive approximation of Ising partition functions,”
2014
Later among the works it cites.
J. Eisert, M. Friesdorf, and C. Gogolin, “Quantum many-body systems out of equilibrium,”
2015
Later among the works it cites.
S. Braun, M. Friesdorf, S. 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 ofa quantum phase transitions,”
2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Shepherd and M. J. Bremner, “Temporally unstructured quantum computation,”
2009
Cited alongside, same era.
A. W. Harrow and R. A. Low, “Random quantum circuits are approximate 2-designs,” Commun. Math. Phys
2009
Cited alongside, same era.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, “Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy,” Proc. Roy. Soc
2010
Cited alongside, same era.
M. Cramer, M. B. Plenio, S. T. Flammia, R. Somma, D. Gross, S. D. Bartlett, O. Landon-Cardinal, D. Poulin, and Y.-K. Liu, “Efficient quantum state tomography,” Nat. Comm
2010
Cited alongside, same era.
W. S. Bakr, A. Peng, M. E. Tai, R. Ma, J. Simon, J. I. Gillen, S. Fölling, L. Pollet, and M. Greiner, “Probing the superfluid-to-mott insulator transition at the single-atom level,” Science
2010
Cited alongside, same era.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, “Classical simulation of commuting quantum computations implies collapse of the Polynomial Hierarchy,”
2011
Cited alongside, same era.
C. Weitenberg, M. Endres, J. F. Sherson, M. Cheneau, P. Schauß, T. Fukuhara, I. Bloch, and S. Kuhr, “Single-spin optaddressing in an atomic Mott insulator,” Nature
2011
Cited alongside, same era.
Later among the works it cites.
R. Curticapean, “Block interpolation: A framework for tight exponential-time counting complexity,” in
2015
Later among the works it cites.
M. Schreiber, S. S. Hodgman, P. Bordia, H. P. Lüschen, M. H. Fischer, R. Vosk, E. Altman, U. Schneider, and I. Bloch, “Observation of many-body localization of interacting fermions in a quasi-random optical lattice,” Science
2015
Later among the works it cites.
M. R. Geller, J. M. Martinis, A. T. Sornborger, P. C. Stancil, E. J. Pritchett, H. You, and A. Galiautdinov, “Universal quantum simulation with prethreshold superconducting qubits: Single-excitation subspace method,” Phys. Rev. A
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
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,”
2016
Later among the works it cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, “Average-case complexity versus approximate simulation of commuting quantum computations,”
2016
Later among the works it cites.
S. Bravyi and D. Gosset, “Improved classical simulation of quantum circuits dominated by Clifford gates,” Phys. Rev. Lett
2016
Later among the works it cites.
B. Fefferman and C. Umans, “On the power of quantum Fourier sampling,” in
2016
Later among the works it cites.
S. Aaronson, “P
2016
Later among the works it cites.
2016
Later among the works it cites.
C. Gross, (2016), private communication
2016
Later among the works it cites.
P. Hosur, X.-L. Qi, D. A. Roberts, and B. Yoshida, “Chaos in quantum channels,” J. High En. Phys
2016
Later among the works it cites.
F. G. S. L. Brandão, A. W. Harrow, and M. Horodecki, “Local random quantum circuits are approximate polynomial-designs,” Commun. Math. Phys
2016
Later among the works it cites.
B. Lekitsch, S. Weidt, A. G. Fowler, K. Mølmer, Simon J. D., C. Wunderlich, and W. K. Hensinger, “Blueprint for a microwave trapped ion quantum computer,”
2017
Closest in time.
P. Bordia, H. Lüschen, S. Scherg, S. Gopalakrishnan, M. Knap, U. Schneider, and I. Bloch, “Probing slow relaxation and many-body localization in two-dimensional quasiperiodic systems,”
2017
Closest in time.
2017
Closest in time.
X. Gao, S.-T. Wang, and L.-M. Duan, “Quantum supremacy for simulating a translation-invariant Ising spin model,”
2017
Closest in time.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, “Achieving quantum supremacy with sparse and noisy commuting quantum computations,”
2017
Closest in time.
A. Mantri, T. F. Demarie, and J. F. Fitzsimons, “Universality of quantum computation with cluster states and (X,Y)-plane measurements,”
2017
Closest in time.
2017
Closest in time.
C. Brand, H. Dell, and M. Roth, “Fine-grained dichotomies for the tutte plane and boolean #CSP,” in
2017
Closest in time.
D. Hangleiter, M. Kliesch, M. Schwarz, and J. Eisert, “Direct certification of a class of quantum simulations,”
2017
Closest in time.
2017
Closest in time.
K. Fujii and T. Morimae, “Quantum commuting circuits and complexity of Ising partition functions,” New J. Phys
2017
Closest in time.