Fetching the paper…
Reading the bibliography…
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers.
1902
Earlier work this paper cites.
P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134
1994
Earlier work this paper cites.
A. Y. Kitaev, Quantum measurements and the Abelian
1995
Earlier work this paper cites.
S. Östlund and S. Rommer, Thermodynamic limit of density matrix renormalization, Phys. Rev. Lett. 75
1995
Earlier work this paper cites.
L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79
1997
Earlier work this paper cites.
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
D. Gottesman, The Heisenberg
1998
Earlier work this paper cites.
T. Schoning, A probabilistic algorithm for k-SAT
1999
Earlier work this paper cites.
F. Massacci and L. Marraro, Logical cryptanalysis as a SAT
2000
Earlier work this paper cites.
G. L. Long, Y. S. Li, W. L. Zhang, and C. C. Tu, Dominant gate imperfection in Grover’s
2000
Earlier work this paper cites.
L. K. Grover, From Schrödinger’s
2001
Earlier work this paper cites.
S. Beauregard, Circuit for Shor’s
2002
Earlier work this paper cites.
G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation, Contemporary Mathematics 305
2002
Earlier work this paper cites.
H. Ramesh and V. Vinay, String matching in O(n+m)
2003
Earlier work this paper cites.
F. Verstraete, J. J. García-Ripoll, and J. I. Cirac, Matrix product density operators: Simulation of finite-temperature and dissipative systems, Phys. Rev. Lett. 93
2004
Earlier work this paper cites.
S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70
2004
Earlier work this paper cites.
W. P. Baritompa, D. W. Bulger, and G. R. Wood, Grover’s
2005
Earlier work this paper cites.
A. Braunstein, M. Mézard, and R. Zecchina, Survey propagation: An algorithm for satisfiability, Random Structures & Algorithms 27
2005
Earlier work this paper cites.
C. Dürr, M. Heiligman, P. Hoyer, and M. Mhalla, Quantum query complexity of some graph problems, SIAM Journal on Computing 35
2006
Earlier work this paper cites.
I. Mironov and L. Zhang, Applications of SAT
2006
Earlier work this paper cites.
D. Perez-Garcia, F. Verstraete, M. M. Wolf, and J. I. Cirac, Matrix product state representations, Quantum Info. Comput. 7
2007
Earlier work this paper cites.
I. P. McCulloch, From density-matrix renormalization group to matrix product states, Journal of Statistical Mechanics: Theory and Experiment 2007
2007
Earlier work this paper cites.
F. Corblin, L. Bordeaux, Y. Hamadi, E. Fanchon, and L. Trilling, A SAT
2007
Earlier work this paper cites.
D. Dong, C. Chen, H. Li, and T.-J. Tarn, Quantum reinforcement learning, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 38
2008
Earlier work this paper cites.
G. M. Crosswhite and D. Bacon, Finite automata for caching in matrix product algorithms, Phys. Rev. A 78
2008
Earlier work this paper cites.
O. Regev and L. Schiff, Impossibility of a quantum speed-up with a faulty oracle, in International Colloquium on Automata, Languages, and Programming (Springer, 2008) pp. 773–781
2008
Earlier work this paper cites.
C. P. Gomes, H. Kautz, A. Sabharwal, and B. Selman, Satisfiability solvers, Foundations of Artificial Intelligence 3
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103
2009
Earlier work this paper cites.
E. M. Stoudenmire and S. R. White, Minimally entangled typical thermal state algorithms, New Journal of Physics 12
2010
Earlier work this paper cites.
R. Paturi and P. Pudlak, On the complexity of circuit satisfiability, in Proceedings of the Forty-Second ACM Symposium on Theory of Computing , STOC ’10 (Association for Computing Machinery, New York, NY, USA, 2010) p. 241–250
2010
Cited alongside, same era.
B. Pirvu, V. Murg, J. I. Cirac, and F. Verstraete, Matrix product operator representations, New Journal of Physics 12
2010
Cited alongside, same era.
I. Oseledets and E. Tyrtyshnikov, TT-cross
2010
Cited alongside, same era.
G. Evenbly and G. Vidal, Tensor network states and geometry, Journal of Statistical Physics 145
2011
Cited alongside, same era.
D. Savostyanov and I. Oseledets, Fast adaptive interpolation of multi-dimensional arrays in tensor train format, in The 2011 International Workshop on Multidimensional (nD) Systems (IEEE, 2011) pp. 1–8
2011
Cited alongside, same era.
2018
Later among the works it cites.
R. Orús, Tensor networks for complex quantum systems, Nature Reviews Physics 1
2019
Later among the works it cites.
S. Kourtis, C. Chamon, E. R. Mucciolo, and A. E. Ruckenstein, Fast counting with tensor networks, SciPost Phys. 7
2019
Later among the works it cites.
2019
Later among the works it cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al. , Quantum supremacy using a programmable superconducting processor, Nature 574
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Dewes, R. Lauro, F. R. Ong, V. Schmitt, P. Milman, P. Bertet, D. Vion, and D. Esteve, Quantum speeding-up of computation demonstrated in a superconducting two-qubit processor, Phys. Rev. B 85
2012
Cited alongside, same era.
A. J. Ferris and G. Vidal, Perfect sampling with unitary tensor networks, Phys. Rev. B 85
2012
Cited alongside, same era.
C. Chamon and E. R. Mucciolo, Virtual parallel computing and a search algorithm using matrix product states, Phys. Rev. Lett. 109
2012
Cited alongside, same era.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A 86
2012
Cited alongside, same era.
A. Garcia-Saez and J. I. Latorre, An exact tensor network for the 3SAT
2012
Cited alongside, same era.
E. Aïmeur, G. Brassard, and S. Gambs, Quantum speed-up for unsupervised learning, Machine Learning 90
2013
Cited alongside, same era.
A. SaiToh, A multiprecision C++ library for matrix-product-state simulation of quantum computing: Evaluation of numerical errors, in Journal of Physics: Conference Series , Vol. 454 (IOP Publishing, 2013) p. 012064
2013
Cited alongside, same era.
2019
Later among the works it cites.
X. Waintal, What determines the ultimate precision of a quantum computer, Phys. Rev. A 99
2019
Later among the works it cites.
C. Gidney and A. G. Fowler, Efficient magic state factories with a catalyzed | C C Z ⟩ |CCZ\rangle to 2 | T ⟩ 2|T\rangle transformation, Quantum 3
2019
Later among the works it cites.
A. Y. Wei, P. Naik, A. W. Harrow, and J. Thaler, Quantum algorithms for jet clustering, Phys. Rev. D 101
2020
Later among the works it cites.
N. Stamatopoulos, D. J. Egger, Y. Sun, C. Zoufal, R. Iten, N. Shen, and S. Woerner, Option Pricing using Quantum Computers, Quantum 4
2020
Later among the works it cites.
Y. Zhou, E. M. Stoudenmire, and X. Waintal, What limits the simulation of quantum computers?, Phys. Rev. X 10
2020
Later among the works it cites.
S. Dolgov and D. Savostyanov, Parallel cross interpolation for high-precision calculation of high-dimensional integrals, Computer Physics Communications 246
2020
Later among the works it cites.
K. Zhang and V. E. Korepin, Depth optimization of quantum search algorithms beyond Grover’s
2020
Later among the works it cites.
S. Jaques, M. Naehrig, M. Roetteler, and F. Virdia, Implementing Grover
2020
Later among the works it cites.
J. Gray and S. Kourtis, Hyper-optimized tensor network contraction, Quantum 5
2021
Later among the works it cites.
S. Ramos-Calderer, E. Bellini, J. I. Latorre, M. Manzano, and V. Mateu, Quantum search for scaled hash function preimages, Quantum Information Processing 20
2021
Later among the works it cites.
R. Babbush, J. R. McClean, M. Newman, C. Gidney, S. Boixo, and H. Neven, Focus beyond quadratic speedups for error-corrected quantum advantage, PRX Quantum 2
2021
Later among the works it cites.
2021
Later among the works it cites.
B. Pokharel and D. Lidar, Better-than-classical Grover
2022
Later among the works it cites.
L. Ma and C. Yang, Low rank approximation in simulations of quantum algorithms, Journal of Computational Science 59
2022
Later among the works it cites.
T. Rakovszky, C. W. von Keyserlingk, and F. Pollmann, Dissipation-assisted operator evolution method for capturing hydrodynamic transport, Phys. Rev. B 105
2022
Later among the works it cites.
L. Perron and V. Furnon, Or-tools (2022)
2022
Later among the works it cites.
F. Pan, K. Chen, and P. Zhang, Solving the sampling problem of the sycamore quantum circuits, Phys. Rev. Lett. 129
2022
Later among the works it cites.
Y. Núñez Fernández, M. Jeannin, P. T. Dumitrescu, T. Kloss, J. Kaye, O. Parcollet, and X. Waintal, Learning feynman diagrams with tensor trains, Phys. Rev. X 12
2022
Later among the works it cites.
J. C. Napp, R. L. L. Placa, A. M. Dalzell, F. G. S. L. Brandao, and A. W. Harrow, Efficient classical simulation of random shallow 2d quantum circuits, Phys. Rev. X 12
2022
Later among the works it cites.
S. Chen, J. Cotler, H.-Y. Huang, and J. Li, The complexity of nisq (2022), arxiv:2210.07234
2022
Later among the works it cites.
2023
Closest in time.
T. Ayral, T. Louvet, Y. Zhou, C. Lambert, E. M. Stoudenmire, and X. Waintal, Density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity, PRX Quantum 4
2023
Closest in time.
2023
Closest in time.
J. Tindall, M. Fishman, E. M. Stoudenmire, and D. Sels, Efficient tensor network simulation of ibm’s eagle kicked ising experiment, PRX Quantum 5
2024
Closest in time.