Fetching the paper…
Reading the bibliography…
The Quantum Singular Value Transformation (QSVT) is a recent technique that gives a unified framework to describe most quantum algorithms discovered so far, and may lead to the development of novel quantum algorithms.
Über das Paulische Äquivalenzverbot
Pascual Jordan and Eugene Wigner · 1928
Earlier work this paper cites.
The complexity of theorem proving procedures
Stephen Cook · 1972
Earlier work this paper cites.
Universal search problems
Leonid Levin · 1973
Earlier work this paper cites.
Random generation of combinatorial structures from a uniform distribution
Mark Jerrum, Leslie G. Valiant, and Vijay V. Vazirani · 1986
Earlier work this paper cites.
Quantum measurements and the abelian stabilizer problem
Alexei Yu. Kitaev · 1995
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
Daniel S. Abrams and Seth Lloyd · 1999
Earlier work this paper cites.
Quantum amplitude amplification and estimation
Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp · 2002
Earlier work this paper cites.
Fermionic quantum computation
Sergey B. Bravyi and Alexei Yu. Kitaev · 2002
Earlier work this paper cites.
Classical and Quantum Computation
Alexei Yu. Kitaev, Alexander H. Shen, and Mikhail N. Vyalyi · 2002
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov and Amnon Ta-Shma · 2003
Earlier work this paper cites.
Fast Monte-Carlo algorithms for finding low-rank approximations
Alan M. Frieze, Ravi Kannan, and Santosh S. Vempala · 2004
Earlier work this paper cites.
Quantum speed-up of Markov chain based algorithms
Mario Szegedy · 2004
Earlier work this paper cites.
Simulated quantum computation of molecular energies
Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon · 2005
Earlier work this paper cites.
Mapping local Hamiltonians of fermions to local Hamiltonians of spins
Frank Verstraete and Juan Ignacio Cirac · 2005
Earlier work this paper cites.
Several natural BQP-complete problems
Pawel Wocjan and Shengyu Zhang · 2006
Earlier work this paper cites.
A mathematical and computational review of Hartree–Fock SCF methods in quantum chemistry
Pablo Echenique and José Luis Alonso · 2007
Earlier work this paper cites.
Why quantum chemistry is hard
Scott Aaronson · 2009
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
Computational complexity of interacting electrons and fundamental limitations of density functional theory
Norbert Schuch and Frank Verstraete · 2009
Earlier work this paper cites.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Earlier work this paper cites.
Search via quantum walk
Frédéric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha · 2011
Earlier work this paper cites.
Simulating quantum computers with probabilistic methods
Maarten Van Den Nest · 2011
Earlier work this paper cites.
Approximation algorithms for qma-complete problems
Sevag Gharibian and Julia Kempe · 2012
Cited alongside, same era.
Hardness of approximation for quantum problems
Sevag Gharibian and Julia Kempe · 2012
Cited alongside, same era.
Hardness of approximation for quantum problems
Sevag Gharibian and Julia Kempe · 2012
Cited alongside, same era.
Hamiltonian complexity
Tobias J. Osborne · 2012
Cited alongside, same era.
Guest column: the quantum PCP conjecture
Dorit Aharonov, Itai Arad, and Thomas Vidick · 2013
Cited alongside, same era.
Product-state approximations to quantum ground states
Fernando G.S.L. Brandao and Aram W. Harrow · 2013
Cited alongside, same era.
Simulating quantum circuits with sparse output distributions
The power of block-encoded matrix powers: Improved regression techniques via faster hamiltonian simulation
Shantanav Chakraborty, András Gilyén, and Stacey Jeffery · 2019
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.
The complexity of simulating local measurements on quantum systems
Sevag Gharibian and Justin Yirka · 2019
Later among the works it cites.
Majorana loop stabilizer codes for error mitigation in fermionic quantum simulations
Zhang Jiang, Jarrod McClean, Ryan Babbush, and Hartmut Neven · 2019
Later among the works it cites.
Hamiltonian simulation by qubitization
Guang Hao Low and Isaac L. Chuang · 2019
Later among the works it cites.
Superfast encodings for fermionic quantum simulation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Martin Schwarz and Maarten Van den Nest · 2013
Cited alongside, same era.
Computational complexity in electronic structure
James D. Whitfield, Peter J. Love, and Alán Aspuru-Guzik · 2013
Cited alongside, same era.
On physical problems that are slightly more difficult than QMA
Andris Ambainis · 2014
Cited alongside, same era.
Exponential improvement in precision for simulating sparse hamiltonians
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma · 2014
Cited alongside, same era.
Quantum systems on non- k k -hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs
Michael H. Freedman and Matthew B. Hastings · 2014
Cited alongside, same era.
Exploiting locality in quantum computation for quantum chemistry
Jarrod R. McClean, Ryan Babbush, Peter J. Love, and Alán Aspuru-Guzik · 2014
Cited alongside, same era.
Kanav Setia, Sergey Bravyi, Antonio Mezzacapo, and James D. Whitfield · 2019
Later among the works it cites.
Quantum codes for quantum simulation of fermions on a square lattice of qubits
Mark Steudtner and Stephanie Wehner · 2019
Later among the works it cites.
A quantum-inspired classical algorithm for recommendation systems
Ewin Tang · 2019
Later among the works it cites.
Quantum algorithms for quantum chemistry and quantum materials science
Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan · 2020
Later among the works it cites.
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
Nai-Hui Chia, András Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, and Chunhao Wang · 2020
Later among the works it cites.
Quantum-inspired algorithms for solving low-rank linear equation systems with logarithmic dependence on the dimension
Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, and Chunhao Wang · 2020
Later among the works it cites.
An improved quantum-inspired algorithm for linear regression
András Gilyén, Zhao Song, and Ewin Tang · 2020
Later among the works it cites.
Quantum-inspired classical algorithms for singular value transformation
Dhawal Jethwani, François Le Gall, and Sanjay K. Singh · 2020
Later among the works it cites.
Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
Lin Lin and Yu Tong · 2020
Later among the works it cites.
Approximating Hamiltonian dynamics with the Nyström method
Alessandro Rudi, Leonard Wossnig, Carlo Ciliberto, Andrea Rocchetto, Massimiliano Pontil, and Simone Severini · 2020
Later among the works it cites.
Variational quantum algorithms
Marco Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Keisuke Fujii, Jarrod R. McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, and Patrick J. Coles · 2021
Closest in time.
Compact fermion to qubit mappings
Charles Derby, Joel Klassen, Johannes Bausch, and Toby Cubitt · 2021
Closest in time.
Even more efficient quantum computations of chemistry through tensor hypercontraction
Joonho Lee, Dominic W. Berry, Craig Gidney, William J. Huggins, Jarrod R. McClean, Nathan Wiebe, and Ryan Babbush · 2021
Closest in time.
StoqMA meets distribution testing
Yupan Liu · 2021
Closest in time.
A grand unification of quantum algorithms
John M. Martyn, Zane M. Rossi, Andrew K. Tan, and Isaac L. Chuang · 2021
Closest in time.
Sevag Gharibian and François Le Gall · 2022
Closest in time.
NLTS Hamiltonians from good quantum codes
Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe · 2023
Closest in time.
Improved product-state approximation algorithms for quantum local hamiltonians
Thiago Bergamaschi · 2023
Closest in time.