Fetching the paper…
Reading the bibliography…
We design and analyze two new low depth algorithms for amplitude estimation (AE) achieving an optimal tradeoff between the quantum speedup and circuit depth.
P. Erdös and J. L. Selfridge, “Complete prime subsets of consecutive integers,” Proceedings of the Manitoba Conference on Numerical Mathematics, Winnipeg , p. 13, 1971
1971
Earlier work this paper cites.
C. Hipp and R. Michel, “On the Bernstein-v. Mises approximation of posterior distributions,” The Annals of Statistics , pp. 972–980, 1976
1976
Earlier work this paper cites.
W. Hoeffding, “Probability inequalities for sums of bounded random variables,” in The collected works of Wassily Hoeffding . Springer, 1994, pp. 409–426. [Online]. Available: https://doi.org/10.2307/2282952
1994
Earlier work this paper cites.
A. Y. Kitaev, “Quantum measurements and the abelian stabilizer problem,” arXiv preprint quant-ph/9511026 , 1995
1995
Earlier work this paper cites.
G. Brassard, P. Høyer, and A. Tapp, “Quantum counting,” in International Colloquium on Automata, Languages, and Programming . Springer, 1998, pp. 820–831. [Online]. Available: https://dx.doi.org/10.1007/BFb0055105
1998
Earlier work this paper cites.
L. K. Grover, “A framework for fast quantum mechanical algorithms,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing , 1998, pp. 53–62. [Online]. Available: https://dx.doi.org/10.1145/276698.276712
1998
Earlier work this paper cites.
D. S. Abrams and C. P. Williams, “Fast quantum algorithms for numerical integrals and stochastic processes,” arXiv:quant-ph/9908083 , 1999
1999
Earlier work this paper cites.
C. Zalka, “Grover’s quantum searching algorithm is optimal,” Physical Review A , vol. 60, no. 4, p. 2746, 1999. [Online]. Available: https://dx.doi.org/10.1103/PhysRevA.60.2746
1999
Earlier work this paper cites.
G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, “Quantum amplitude amplification and estimation,” Contemporary Mathematics , vol. 305, pp. 53–74, 2002. [Online]. Available: https://dx.doi.org/10.1090/conm/305/05215
2002
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical review letters , vol. 103, no. 15, p. 150502, 2009. [Online]. Available: https://dx.doi.org/10.1007/978-3-642-27848-8_771-1
2009
Earlier work this paper cites.
2011
Cited alongside, same era.
A. Ambainis, “Variable time amplitude amplification and quantum algorithms for linear algebra problems,” in STACS’12 (29th Symposium on Theoretical Aspects of Computer Science) , vol. 14. LIPIcs, 2012, pp. 636–647. [Online]. Available: https://dx.doi.org/10.4230/LIPIcs.STACS.2012.636
2012
Cited alongside, same era.
C. Ferrie, C. E. Granade, and D. G. Cory, “How to best sample a periodic probability distribution, or on the accuracy of hamiltonian finding strategies,” Quantum Information Processing , vol. 12, no. 1, pp. 611–623, 2013. [Online]. Available: https://dx.doi.org/10.1007/s11128-012-0407-6
2013
Cited alongside, same era.
A. Montanaro, “Quantum speedup of Monte Carlo methods,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol. 471, no. 2181, p. 20150301, 2015. [Online]. Available: https://dx.doi.org/10.1098/rspa.2015.0301
2019
Later among the works it cites.
Y. Hamoudi and F. Magniez, “Quantum Chebyshev’s inequality and applications,” in 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019
2019
Later among the works it cites.
I. Kerenidis, J. Landman, A. Luongo, and A. Prakash, “q-means: A quantum algorithm for unsupervised machine learning,” Proceedings of Neural Information Processing Systems (NeurIPS) , 2019
2019
Later among the works it cites.
D. Wang, O. Higgott, and S. Brierley, “Accelerated variational quantum eigensolver,” Physical review letters , vol. 122, no. 14, p. 140504, 2019. [Online]. Available: https://doi.org/10.1103/PhysRevLett.122.140504
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
N. Wiebe, A. Kapoor, and K. M. Svore, “Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning,” Quantum Information & Computation , vol. 15, no. 3-4, pp. 316–356, 2015. [Online]. Available: https://dx.doi.org/10.26421/QIC15.3-4-7
2015
Cited alongside, same era.
S. Jeffery, F. Magniez, and R. De Wolf, “Optimal parallel quantum query algorithms,” Algorithmica , vol. 79, no. 2, pp. 509–529, 2017. [Online]. Available: https://dx.doi.org/10.1007/s00453-016-0206-z
2017
Cited alongside, same era.
T. Li and X. Wu, “Quantum query complexity of entropy estimation,” IEEE Transactions on Information Theory , vol. 65, no. 5, pp. 2899–2921, 2018. [Online]. Available: https://dx.doi.org/10.1109/TIT.2018.2883306
2018
Cited alongside, same era.
J. Preskill, “Quantum computing in the NISQ era and beyond,” Quantum , vol. 2, p. 79, 2018. [Online]. Available: https://dx.doi.org/10.22331/q-2018-08-06-79
2018
Cited alongside, same era.
P. Burchard, “Lower bounds for parallel quantum counting,” arXiv preprint arXiv:1910.04555 , 2019
2019
Cited alongside, same era.
S. Aaronson and P. Rall, “Quantum approximate counting, simplified,” in Symposium on Simplicity in Algorithms . SIAM, 2020, pp. 24–32. [Online]. Available: https://dx.doi.org/10.1137/1.9781611976014.5
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Y. Suzuki, S. Uno, R. Raymond, T. Tanaka, T. Onodera, and N. Yamamoto, “Amplitude estimation without phase estimation,” Quantum Information Processing , vol. 19, no. 2, p. 75, 2020. [Online]. Available: https://dx.doi.org/10.1007/s11128-019-2565-2
2020
Closest in time.