Fetching the paper…
Reading the bibliography…
We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with $\mathcal{O}(\kappa~\text{poly}(\log(\kappa/\epsilon)))$ runtime, where $\kappa$ is the condition number, and $\epsilon$ is the target accuracy.
Variational Quantum Linear Solver
Carlos Bravo-Prieto, Ryan LaRose, M. Cerezo, Yigit Subasi, Lukasz Cincio, and Patrick J. Coles. 2020 · 1909
Earlier work this paper cites.
Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
Andrew M. Childs, Robin Kothari, and Rolando D. Somma. 2017 · 1950
Earlier work this paper cites.
The multifrontal method for sparse matrix solution: Theory and practice
Joseph W. H. Liu. 1992 · 1992
Earlier work this paper cites.
Linear adiabatic theory. Exponential estimates
Gheorghe Nenciu. 1993 · 1993
Earlier work this paper cites.
A rapid monotonically convergent iteration algorithm for quantum optimal control over the expectation value of a positive definite operator
Wusheng Zhu and Herschel Rabitz. 1998 · 1998
Earlier work this paper cites.
How powerful is adiabatic quantum computation?. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science . IEEE, Piscataway, NJ, USA, 279–287
Wim van Dam, Michele Mosca, and Umesh Vazirani. 2001 · 2001
Earlier work this paper cites.
Quantum search by local adiabatic evolution
Jérémie Roland and Nicolas J. Cerf. 2002 · 2002
Earlier work this paper cites.
New formulations of monotonically convergent quantum control algorithms
Yvon Maday and Gabriel Turinici. 2003 · 2003
Earlier work this paper cites.
Iterative methods for sparse linear systems . Vol. 82
Yousef Saad. 2003 · 2003
Earlier work this paper cites.
Bounds for the adiabatic approximation with applications to quantum computation
Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler. 2007 · 2007
Earlier work this paper cites.
Eigenpath traversal by phase randomization
Sergio Boixo, Emanuel Knill, and Rolando D Somma. 2009 · 2009
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. 2009 · 2009
Earlier work this paper cites.
Quantum Adiabatic Brachistochrone
Ali T. Rezakhani, W.-J. Kuo, Alioscia Hamma, Daniel A. Lidar, and Paolo Zanardi. 2009 · 2009
Cited alongside, same era.
Necessary condition for the quantum adiabatic approximation
Sergio Boixo and Rolando D. Somma. 2010 · 2010
Cited alongside, same era.
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, Paris, France, 636–647
Andris Ambainis. 2012 · 2012
Cited alongside, same era.
Improved error-scaling for adiabatic quantum evolutions
Nathan Wiebe and Nathan S. Babcock. 2012 · 2012
Cited alongside, same era.
Quantum algorithm and circuit design solving the Poisson equation
Yudong Cao, Anargyros Papageorgiou, Iasonas Petras, Joseph Traub, and Sabre Kais. 2013 · 2013
Cited alongside, same era.
Optimal control of superconducting gmon qubits using Pontryagin’s minimum principle: Preparing a maximally entangled state with singular bang-bang protocols
Seraph Bao, Silken Kleer, Ruoyu Wang, and Armin Rahmani. 2018 · 2018
Later among the works it cites.
Reinforcement Learning in Different Phases of Quantum Control
Marin Bukov, Alexandre G. R. Day, Dries Sels, Phillip Weinberg, Anatoli Polkovnikov, and Pankaj Mehta. 2018 · 2018
Later among the works it cites.
Quantum Linear System Algorithm for Dense Matrices
Leonard Wossnig, Zhikuan Zhao, and Anupam Prakash. 2018 · 2018
Later among the works it cites.
The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 132) . Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 33:1–33:14
Shantanav Chakraborty, András Gilyén, and Stacey Jeffery. 2019 · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014 · 2014
Cited alongside, same era.
Simulating Hamiltonian dynamics with a truncated Taylor series
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma. 2015b · 2015
Cited alongside, same era.
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science . IEEE, Piscataway, NJ, USA, 792–809
Dominic W. Berry, Andrew M. Childs, and Robin Kothari. 2015a · 2015
Cited alongside, same era.
Rapid Adiabatic Preparation of Injective Projected Entangled Pair States and Gibbs States
Yimin Ge, András Molnár, and J. Ignacio Cirac. 2016 · 2016
Cited alongside, same era.
Optimal Hamiltonian Simulation by Quantum Signal Processing
Guang Hao Low and Isaac L. Chuang. 2017 · 2017
Cited alongside, same era.
Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle
Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon. 2017 · 2017
Cited alongside, same era.
Adiabatic quantum computation
Tameem Albash and Daniel A. Lidar. 2018 · 2018
Cited alongside, same era.
Quantum Singular Value Transformation and beyond: Exponential Improvements for Quantum Matrix Arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019) . Association for Computing Machinery, New York, NY, USA, 193–204
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe. 2019 · 2019
Closest in time.
How quantum is the speedup in adiabatic unstructured search?
Itay Hen. 2019 · 2019
Closest in time.
Hamiltonian Simulation in the Interaction Picture
Guang Hao Low and Nathan Wiebe. 2019 · 2019
Closest in time.
Universal quantum control through deep reinforcement learning
Murphy Yuezhen Niu, Sergio Boixo, Vadim N. Smelyanskiy, and Hartmut Neven. 2019 · 2019
Closest in time.
Quantum Algorithms for Systems of Linear Equations Inspired by Adiabatic Quantum Computing
Yiğit Subaşı, Rolando D. Somma, and Davide Orsucci. 2019 · 2019
Closest in time.
Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
Lin Lin and Yu Tong. 2020 · 2020
Closest in time.
Theory of Trotter Error with Commutator Scaling
Andrew M. Childs, Yuan Su, Minh C. Tran, Nathan Wiebe, and Shuchen Zhu. 2021 · 2021
Closest in time.
Variational algorithms for linear algebra
Xiaosi Xu, Jinzhao Sun, Suguru Endo, Ying Li, Simon C. Benjamin, and Xiao Yuan. 2021 · 2021
Closest in time.