Fetching the paper…
Reading the bibliography…
We present a new primitive for quantum algorithms that implements a discrete Hermite transform efficiently, in time that depends logarithmically in both the dimension and the inverse of the allowable error.
Orthogonal polynomials
Gabor Szegö · 1939
Earlier work this paper cites.
A hard-core predicate for all one-way functions
O. Goldreich and L. A. Levin · 1989
Earlier work this paper cites.
An introduction to computational learning theory
Michael J. Kearns and Umesh V. Vazirani · 1994
Earlier work this paper cites.
Quantum measurements and the Abelian stabilizer problem
Alexei Yu Kitaev · 1995
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997
Earlier work this paper cites.
On the power of quantum computation
Daniel R. Simon · 1997
Earlier work this paper cites.
Expansions for nearly Gaussian distributions
Sergei Blinnikov and Richhild Moessner · 1998
Earlier work this paper cites.
Simulating quantum systems on a quantum computer
Christof Zalka · 1998
Earlier work this paper cites.
Fast parallel circuits for the quantum Fourier transform
Richard Cleve and John Watrous · 2000
Earlier work this paper cites.
Quantum computation and quantum information
Michael Nielsen and Isaac Chuang · 2000
Earlier work this paper cites.
Foundations of Cryptography
Oded Goldreich · 2001
Earlier work this paper cites.
Creating superpositions that correspond to efficiently integrable probability distributions
Lov Grover and Terry Rudolph · 2002
Earlier work this paper cites.
Comparison of quantum and semiclassical radiation theories with application to the beam maser
Edwin T. Jaynes and Frederick W. Cummings · 2005
Earlier work this paper cites.
A first course in Monte Carlo
George S. Fishman · 2006
Earlier work this paper cites.
Efficient quantum algorithms for simulating sparse Hamiltonians
Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders · 2007
Earlier work this paper cites.
Factorizing the time evolution operator
P. C. García Quijas and L. M. Arévalo Aguilar · 2007
Earlier work this paper cites.
A stochastic calculus approach to the oracle separation of BQP and PH, 2020
Xinyu Wu · 2007
Earlier work this paper cites.
Learning geometric concepts via Gaussian surface area
Adam R. Klivans, Ryan O’Donnell, and Rocco A. Servedio · 2008
Cited alongside, same era.
A fast Hermite transform
Gregory Leibon, Daniel N. Rockmore, Wooram Park, Robert Taintort, and Gregory S. Chirikjian · 2008
Cited alongside, same era.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2009
Cited alongside, same era.
BQP and the polynomial hierarchy
Scott Aaronson · 2010
Cited alongside, same era.
Efficient universal quantum circuits
Debajyoti Bera, Stephen Fenner, Frederic Green, and Steven Homer · 2010
Cited alongside, same era.
Limitations on the simulation of non-sparse Hamiltonians
Andrew M. Childs and Robin Kothari · 2010
Cited alongside, same era.
Optimal Hamiltonian simulation by quantum signal processing
Guang Hao Low and Isaac L. Chuang · 2017
Later among the works it cites.
Forrelation: a problem that optimally separates quantum from classical computing
Scott Aaronson and Andris Ambainis · 2018
Later among the works it cites.
Introduction to quantum mechanics
David J. Griffiths and Darrell F. Schroeter · 2018
Later among the works it cites.
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Later among the works it cites.
Efficient truncated statistics with unknown truncation
Vasilis Kontonis, Christos Tzamos, and Manolis Zampetakis · 2019
Later among the works it cites.
Black-box quantum state preparation without arithmetic
Yuval R. Sanders, Guang Hao Low, Artur Scherer, and Dominic W. Berry · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Property testing lower bounds via communication complexity
Eric Blais, Joshua Brody, and Kevin Matulef · 2011
Cited alongside, same era.
Quantum rejection sampling
Maris Ozols, Martin Roetteler, and Jérémie Roland · 2012
Cited alongside, same era.
Concentration Inequalities: A Nonasymptotic Theory of Independence
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013
Cited alongside, same era.
Analysis of Boolean Functions
Ryan O’Donnell · 2014
Cited alongside, same era.
The exponentially convergent trapezoidal rule
Lloyd N. Trefethen, J. A. C., and Weideman · 2014
Cited alongside, same era.
Fixed-point quantum search with an optimal number of queries
Theodore J. Yoder, Guang Hao Low, and Isaac L. Chuang · 2014
Cited alongside, same era.
Later among the works it cites.
Quantum eigenvalue estimation via time series analysis
Rolando D. Somma · 2019
Later among the works it cites.
Fast-forwarding quantum evolution
Shouzhen Gu, Rolando D. Somma, and Burak Şahinoğlu · 2021
Later among the works it cites.
Quantum algorithm for simulating real time evolution of lattice Hamiltonians
Jeongwan Haah, Matthew B. Hastings, Robin Kothari, and Guang Hao Low · 2021
Later among the works it cites.
Topics and techniques in distribution testing: A biased but representative sample
Clément L. Canonne · 2022
Later among the works it cites.
Oracle separation of BQP and PH
Ran Raz and Avishay Tal · 2022
Later among the works it cites.
Agnostically learning multi-index models with queries
Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, and Nikos Zarifis · 2024
Later among the works it cites.
Verifiable quantum advantage without structure
Takashi Yamakawa and Mark Zhandry · 2024
Later among the works it cites.
Quantum simulation of a noisy classical nonlinear dynamics, 2025
Sergey Bravyi, Robert Manson-Sawko, Mykhaylo Zayats, and Sergiy Zhuk · 2025
Closest in time.
Optimization by decoded quantum interferometry, 2025
Stephen P. Jordan, Noah Shutty, Mary Wootters, Adam Zalcman, Alexander Schmidhuber, Robbie King, Sergei V. Isakov, and Ryan Babbush · 2025
Closest in time.
Quantum advantage for learning shallow neural networks with natural data distributions, 2025
Laura Lewis, Dar Gilboa, and Jarrod R. McClean · 2025
Closest in time.
On the complexity of decoded quantum interferometry, 2025
Kunal Marwaha, Bill Fefferman, Alexandru Gheorghiu, and Vojtech Havlicek · 2025
Closest in time.