33 citations · 67 across the 3 of their papers we have counts for
8 papers · 1 filter
Towards the Simulation of Large Scale Protein-Ligand Interactions on NISQ-era Quantum Computers
Fionn D. Malone, Robert M. Parrish, Alicia R. Welden +6
We explore the use of symmetry-adapted perturbation theory (SAPT) as a simple and efficient means to compute interaction energies between large molecular systems with a hybrid meth…
Quantum algorithms with local particle number conservation: noise effects and error correction
Michael Streif, Martin Leib, Filip Wudarski +2
Quantum circuits with local particle number conservation (LPNC) restrict the quantum computation to a subspace of the Hilbert space of the qubit register. In a noiseless or fault-t…
Forbidden subspaces for level-1 QAOA and IQP circuits
Michael Streif, Martin Leib
We present a thorough investigation of problems that can be solved exactly with the level-1 Quantum Approximate Optimization Algorithm (QAOA). To this end we implicitly define a cl…
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…
Training the Quantum Approximate Optimization Algorithm without access to a Quantum Processing Unit
Michael Streif, Martin Leib
In this paper, we eliminate the classical outer learning loop of the Quantum Approximate Optimization Algorithm (QAOA) and present a strategy to find good parameters for QAOA based…
Comparison of QAOA with Quantum and Simulated Annealing
Michael Streif, Martin Leib
We present a comparison between the Quantum Approximate Optimization Algorithm (QAOA) and two widely studied competing methods, Quantum Annealing (QA) and Simulated Annealing (SA).…