Fetching the paper…
Reading the bibliography…
The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block-encodings of the Hamiltonian.
H. Kummer, n n -representability problem for reduced density matrices, Journal of Mathematical Physics 8
1967
Earlier work this paper cites.
T. S. Motzkin, The arithmetic-geometric inequality, Inequalities (Proc. Sympos. Wright-Patterson Air Force Base, Ohio, 1965) 205
1967
Earlier work this paper cites.
A. J. Coleman, The convex structure of electrons, International Journal of Quantum Chemistry 11
1977
Earlier work this paper cites.
R. M. Erdahl, Representability, International Journal of Quantum Chemistry 13
1978
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.
D. S. Abrams and S. Lloyd, Simulation of many-body Fermi systems on a universal quantum computer, Phys. Rev. Lett. 79
1997
Earlier work this paper cites.
J. W. Helton, “Positive” noncommutative polynomials are sums of squares, Annals of Mathematics 156
2002
Earlier work this paper cites.
D. A. Mazziotti, Variational minimization of atomic and molecular ground-state energies via the two-particle reduced density matrix, Phys. Rev. A 65
2002
Earlier work this paper cites.
S. Burer and R. D. Monteiro, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Mathematical programming 95
2003
Earlier work this paper cites.
A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, Simulated quantum computation of molecular energies, Science 309
2005
Earlier work this paper cites.
D. A. Mazziotti, Quantum chemistry without wave functions: Two-electron reduced density matrices, Accounts of Chemical Research 39
2006
Earlier work this paper cites.
Y.-K. Liu, Consistency of local density matrices is qma-complete, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006. Proceedings (Springer, 2006) pp. 438–449
2006
Earlier work this paper cites.
W. Hall, Compatibility of subsystem states and convex geometry, Phys. Rev. A 75
2007
Earlier work this paper cites.
A. M.-C. So, Y. Ye, and J. Zhang, A unified theorem on SDP rank reduction, Mathematics of Operations Research 33
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103
2009
Earlier work this paper cites.
S. Pironio, M. Navascués, and A. Acin, Convergent relaxations of polynomial optimization problems with noncommuting variables, SIAM Journal on Optimization 20
2010
Earlier work this paper cites.
A. M. Childs, On the relationship between continuous- and discrete-time quantum walk, Communications in Mathematical Physics 294
2010
Earlier work this paper cites.
D. A. Mazziotti, Structure of fermionic density matrices: Complete n n -representability conditions, Phys. Rev. Lett. 108
2012
Earlier work this paper cites.
R. D. Somma and S. Boixo, Spectral gap amplification, SIAM Journal on Computing 42
2013
Earlier work this paper cites.
D. Wecker, B. Bauer, B. K. Clark, M. B. Hastings, and M. Troyer, Gate-count estimates for performing quantum chemistry on small quantum computers, Phys. Rev. A 90
2014
Earlier work this paper cites.
2014
Cited alongside, same era.
D. W. Berry, A. M. Childs, and R. Kothari, Hamiltonian simulation with nearly optimal dependence on all parameters, in Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on (2015) pp. 792–809
2015
Cited alongside, same era.
2017
Cited alongside, same era.
A. N. Chowdhury and R. D. Somma, Quantum algorithms for Gibbs sampling and hitting-time estimation, Quantum Info. Comput. 17
2017
Cited alongside, same era.
S. Gu, R. D. Somma, and B. Şahinoğlu, Fast-forwarding quantum evolution, Quantum 5
2021
Later among the works it cites.
M. Motta, E. Ye, J. R. McClean, Z. Li, A. J. Minnich, R. Babbush, and G. K.-L. Chan, Low rank representations for quantum simulation of electronic structure, npj Quantum Information 7
2021
Later among the works it cites.
G. H. Low, Halving the cost of quantum multiplexed rotations (2021), arXiv:2110.13439 [quant-ph]
2021
Later among the works it cites.
J. J. Goings, A. White, J. Lee, C. S. Tautermann, M. Degroote, C. Gidney, T. Shiozaki, R. Babbush, and N. C. Rubin, Reliably assessing the electronic structure of cytochrome P450 on today’s classical computers and tomorrow’s quantum computers, Proceedings of the National Academy of Sciences 119
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
Z. Li and G. K.-L. Chan, Spin-projected matrix product states: Versatile tool for strongly correlated systems, Journal of Chemical Theory and Computation 13
2017
Cited alongside, same era.
D. Poulin, A. Kitaev, D. S. Steiger, M. B. Hastings, and M. Troyer, Quantum algorithm for spectral measurement with a lower gate count, Phys. Rev. Lett. 121
2018
Cited alongside, same era.
R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, Encoding electronic spectra in quantum circuits with linear T complexity, Phys. Rev. X 8
2018
Cited alongside, same era.
D. W. Berry, M. Kieferová, A. Scherer, Y. R. Sanders, G. H. Low, N. Wiebe, C. Gidney, and R. Babbush, Improved techniques for preparing eigenstates of fermionic Hamiltonians, npj Quantum Information 4
2018
Cited alongside, same era.
E. Campbell, Random compiler for fast Hamiltonian simulation, Phys. Rev. Lett. 123
2019
Cited alongside, same era.
2019
Cited alongside, same era.
G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3
2019
Cited alongside, same era.
2022
Later among the works it cites.
N. C. Rubin, D. W. Berry, F. D. Malone, A. F. White, T. Khattar, A. E. DePrince, S. Sicolo, M. Küehn, M. Kaicher, J. Lee, and R. Babbush, Fault-tolerant quantum simulation of materials using Bloch orbitals, PRX Quantum 4
2023
Later among the works it cites.
I. Loaiza and A. F. Izmaylov, Block-invariant symmetry shift: Preprocessing technique for second-quantized hamiltonians to improve their decompositions to linear combination of unitaries, Journal of Chemical Theory and Computation 19
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
C. L. Cortes, D. Rocca, J. F. Gonthier, P. J. Ollitrault, R. M. Parrish, G.-L. R. Anselmetti, M. Degroote, N. Moll, R. Santagati, and M. Streif, Assessing the query complexity limits of quantum phase estimation using symmetry-aware spectral bounds, Phys. Rev. A 110
2024
Later among the works it cites.
2024
Later among the works it cites.
D. Rocca, C. L. Cortes, J. F. Gonthier, P. J. Ollitrault, R. M. Parrish, G.-L. Anselmetti, M. Degroote, N. Moll, R. Santagati, and M. Streif, Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization, Journal of Chemical Theory and Computation 20
2024
Later among the works it cites.
2024
Later among the works it cites.
O. Oumarou, M. Scheurer, R. M. Parrish, E. G. Hohenstein, and C. Gogolin, Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization, Quantum 8
2024
Later among the works it cites.
G. H. Low, V. Kliuchnikov, and L. Schaeffer, Trading T gates for dirty qubits in state preparation and unitary synthesis, Quantum 8
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2025
Closest in time.