68 citations · 89 across the 6 of their papers we have counts for
10 papers · 1 filter
Self-consistent Quantum Iteratively Sparsified Hamiltonian method (SQuISH): A new algorithm for efficient Hamiltonian simulation and compression
Diana B. Chamaki, Stuart Hadfield, Katherine Klymko +2
It is crucial to reduce the resources required to run quantum algorithms and simulate physical systems on quantum computers due to coherence time limitations. With regards to Hamil…
Electronic Structure in a Fixed Basis is QMA-complete
Bryan O'Gorman, Sandy Irani, James Whitfield +1
Finding the ground state energy of electrons subject to an external electric field is a fundamental problem in computational chemistry. We prove that this electronic-structure prob…
Quantum-accelerated constraint programming
Kyle E. C. Booth, Bryan O'Gorman, Jeffrey Marshall +2
Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that…
Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
Matthew P. Harrigan, Kevin J. Sung, Matthew Neeley +83
We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algor…
Planning for Compilation of a Quantum Algorithm for Graph Coloring
Minh Do, Zhihui Wang, Bryan O'Gorman +3
The problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temp…
A Non-Orthogonal Variational Quantum Eigensolver
William J. Huggins, Joonho Lee, Unpil Baek +2
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to…