activity
20122026
most citedFrom the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

768 citations · 2.6k across the 25 of their papers we have counts for

collaborators

26 papers

quant-ph2026

Optimal testing of fermionic and bosonic Gaussian states

Vishnu Iyer, Bryan O'Gorman, Ojas Parekh +2

We study the problem of property testing quantum states: given a pure state that either (A) belongs to some class of pure states, or (B) is -far in tra…

physics.chem-ph2024★ 17 cited

Unbiasing Fermionic Auxiliary-Field Quantum Monte Carlo with Matrix Product State Trial Wavefunctions

Tong Jiang, Bryan O'Gorman, Ankit Mahajan +1

In this work, we report, for the first time, an implementation of fermionic auxiliary-field quantum Monte Carlo (AFQMC) using matrix product state (MPS) trial wavefunctions, dubbed…

quant-ph2022★ 1 cited

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…

quant-ph2022★ 9 cited

Fermionic tomography and learning

Bryan O'Gorman

Shadow tomography via classical shadows is a state-of-the-art approach for estimating properties of a quantum state. We present a simplified, combinatorial analysis of a recently p…

quant-ph2022★ 4 cited

Response to "Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers"

Joonho Lee, David R. Reichman, Ryan Babbush +4

A recent preprint by Mazzola and Carleo numerically investigates exponential challenges that can arise for the QC-QMC algorithm introduced in our work, "Unbiasing fermionic quantum…

quant-ph2022★ 2 cited

The Parameterized Complexity of Quantum Verification

Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe +1

We initiate the study of parameterized complexity of problems in terms of the number of non-Clifford gates in the problem description. We show that for the problem o…