Fetching the paper…
Reading the bibliography…
We present a hybrid quantum-classical framework for simulating generic matrix functions more amenable to early fault-tolerant quantum hardware than standard quantum singular-value transformations.
1910
Earlier work this paper cites.
A. M. Childs, R. Kothari, and R. D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, SIAM Journal on Computing 46
1920
Earlier work this paper cites.
A. M. Childs, R. Kothari, and R. D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, SIAM Journal on Computing 46
1920
Earlier work this paper cites.
M. Abramowitz, I. A. Stegun, “Handbook of mathematical functions,” Applied mathematics series 55, 62 (1966)
1966
Earlier work this paper cites.
L. N. Trefethen and D. Bau, Numerical Linear Algebra (SIAM, 1997)
1997
Earlier work this paper cites.
D. S. Abrams and S. Lloyd, Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors, Phys. Rev. Lett. 83
1999
Earlier work this paper cites.
J. P. Boyd, Chebyshev and Fourier Spectral Methods , 2nd ed. (Dover, Mineola, New York, 2001)
2001
Earlier work this paper cites.
Y. Saad, Iterative Methods for Sparse Linear Systems , 2nd ed. (Society for Industrial and Applied Mathematics, 2003) https://epubs.siam.org/doi/pdf/10.1137/1.9780898718003
2003
Earlier work this paper cites.
A. Bulatov and M. Grohe, The complexity of partition functions, Theoretical Computer Science 348
2004
Earlier work this paper cites.
M. Szegedy, Quantum speed-up of markov chain based algorithms, 45th Annual IEEE Symposium on Foundations of Computer Science , 32 (2004)
2004
Earlier work this paper cites.
A. Weiße, G. Wellein, A. Alvermann, and H. Fehske, The kernel polynomial method, Rev. Mod. Phys. 78
2006
Earlier work this paper cites.
J. Kempe, A. Kitaev, and O. Regev, The complexity of the local hamiltonian problem, SIAM Journal on Computing 35
2006
Earlier work this paper cites.
T. Strohmer and R. Vershynin, A randomized kaczmarz algorithm with exponential convergence, Journal of Fourier Analysis and Applications 15
2007
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum Algorithm for Linear Systems of Equations, Physical Review Letters 103
2009
Earlier work this paper cites.
L. N. Trefethen, Approximation Theory and Approximation Practice. (SIAM, 2012) pp. I–VII, 1–305
2012
Earlier work this paper cites.
A. M. Childs and N. Wiebe, Hamiltonian simulation using linear combinations of unitary operations, Quantum Information and Computation 10.26421/qic12.11-12 (2012)
2012
Earlier work this paper cites.
J. Ma, J. Peng, S. Wang, and J. Xu, Estimating the partition function of graphical models using langevin importance sampling, in Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics , Proceedings of Machine Learning Research, Vol. 31, edited by C. M. Carvalho and P. Ravikumar (PMLR, Scottsdale, Arizona, USA, 2013) pp. 433–441
2013
Earlier work this paper cites.
L. Aolita, F. de Melo, and L. Davidovich, Open-system dynamics of entanglement:a key issues review, Rep. Prog. Phys. 78
2015
Earlier work this paper cites.
G. H. Low and I. L. Chuang, Optimal hamiltonian simulation by quantum signal processing, Phys. Rev. Lett. 118
2017
Earlier work this paper cites.
Y. Atia and D. Aharonov, Fast-forwarding of hamiltonians and exponentially precise measurements, Nature Communications 8
2017
Cited alongside, same era.
M. Reiher, N. Wiebe, K. M. Svore, D. Wecker, and M. Troyer, Elucidating reaction mechanisms on quantum computers, Proceedings of the National Academy of Sciences 114
2017
Cited alongside, same era.
L. Wossnig, Z. Zhao, and A. Prakash, Quantum linear system algorithm for dense matrices, Physical Review Letters 120
2018
Cited alongside, same era.
N. M. Tubman, C. Mejuto-Zaera, J. M. Epstein, D. Hait, D. S. Levine, W. J. Huggins, Z. Jiang, J. R. McClean, R. Babbush, M. Head-Gordon, and K. B. Whaley, Postponing the orthogonality catastrophe: efficient state preparation for electronic structure simulations on quantum devices, Bulletin of the American Physical Society (2018)
2018
Cited alongside, same era.
J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. McClean, N. Wiebe, and R. Babbush, Even more efficient quantum computations of chemistry through tensor hypercontraction, PRX Quantum 2
2021
Later among the works it cites.
2022
Later among the works it cites.
L. Lin and Y. Tong, Heisenberg-Limited Ground-State Energy Estimation for Early Fault-Tolerant Quantum Computers, PRX Quantum 3
2022
Later among the works it cites.
K. Wan, M. Berta, and E. T. Campbell, Randomized Quantum Algorithm for Statistical Phase Estimation, Physical Review Letters 129
2022
Later among the works it cites.
Y. Dong, L. Lin, and Y. Tong, Ground-state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices, PRX Quantum 3
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing STOC 2019, 193–204 (2019)
2019
Cited alongside, same era.
E. Campbell, Random Compiler for Fast Hamiltonian Simulation, Physical Review Letters 123
2019
Cited alongside, same era.
Y. Subaşı, R. D. Somma, and D. Orsucci, Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing, Physical Review Letters 122
2019
Cited alongside, same era.
Y. Ge, J. Tura, and J. I. Cirac, Faster ground state preparation and high-precision ground energy estimation with fewer qubits, Journal of Mathematical Physics 60
2019
Cited alongside, same era.
D. W. Berry, C. Gidney, M. Motta, J. R. McClean, and R. Babbush, Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization, Quantum 3
2019
Cited alongside, same era.
Z. Li, J. Li, N. S. Dattani, C. J. Umrigar, and G. K.-L. Chan, The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations, The Journal of Chemical Physics 150
2019
Cited alongside, same era.
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
Cited alongside, same era.
2022
Later among the works it cites.
P. C. Costa, D. An, Y. R. Sanders, Y. Su, R. Babbush, and D. W. Berry, Optimal scaling quantum linear-systems solver via discrete adiabatic theorem, PRX Quantum 3
2022
Later among the works it cites.
A. Shim, A probabilistic interpretation of transformers (2022), arXiv:2205.01080 [cs.LG]
2022
Later among the works it cites.
S. Bravyi, A. Chowdhury, D. Gosset, and P. Wocjan, Quantum hamiltonian complexity in thermal equilibrium, Nature Physics 18
2022
Later among the works it cites.
D. An and L. Lin, Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm, ACM Transactions on Quantum Computing 3
2022
Later among the works it cites.
B. D. Clader, A. M. Dalzell, N. Stamatopoulos, G. Salton, M. Berta, and W. J. Zeng, Quantum resources required to block-encode a matrix of classical data, IEEE Transactions on Quantum Engineering 3
2022
Later among the works it cites.
I. H. Kim, Y.-H. Liu, S. Pallister, W. Pol, S. Roberts, and E. Lee, Fault-tolerant resource estimate for quantum chemical simulations: Case study on li-ion battery electrolyte molecules, Physical Review Research 4
2022
Later among the works it cites.
T. d. L. Silva, M. M. Taddei, S. Carrazza, and L. Aolita, Fragmented imaginary-time evolution for early-stage quantum signal processors, Scientific Reports 13
2023
Closest in time.
A. Jackson, T. Kapourniotis, and A. Datta, Partition-function estimation: Quantum and quantum-inspired algorithms, Phys. Rev. A 107
2023
Closest in time.
S. Lee, J. Lee, H. Zhai, Y. Tong, A. M. Dalzell, A. Kumar, P. Helms, J. Gray, Z.-H. Cui, W. Liu, M. Kastoryano, R. Babbush, J. Preskill, D. R. Reichman, E. T. Campbell, E. F. Valeev, L. Lin, and G. K.-L. Chan, Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry, Nature Communications 14
2023
Closest in time.
S. Wang, S. McArdle, and M. Berta, Qubit-efficient randomized quantum algorithms for linear algebra, PRX Quantum 5
2024
Closest in time.
D. Camps, L. Lin, R. Van Beeumen, and C. Yang, Explicit quantum circuits for block encodings of certain sparse matrices, SIAM Journal on Matrix Analysis and Applications 45
2024
Closest in time.
C. Sünderhauf, E. Campbell, and J. Camps, Block-encoding structured matrices for data input in quantum computing, Quantum 8
2024
Closest in time.
L. Clinton, T. Cubitt, B. Flynn, F. M. Gambetta, J. Klassen, A. Montanaro, S. Piddock, R. A. Santos, and E. Sheridan, Towards near-term quantum simulation of materials, Nat. Commun. 15
2024
Closest in time.