1 citations · 1 across the 6 of their papers we have counts for
6 papers
On the Computational Complexity of Guided Berry Phase Estimation
Gabriel Waite
We prove that deciding the Berry phase for parameterised 2-local qubit Hamiltonians is BQP-complete when presented with a classical description of a guiding state, promised to over…
Efficient Fidelity Estimation with Few Local Pauli Measurements
Mingyu Sun, Gabriel Waite, Michael Bremner +1
As quantum devices scale, quantifying how close an experimental state aligns with a target becomes both vital and challenging. Fidelity is the standard metric, but existing estimat…
The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians
Gabriel Waite
We show that the Guided Local Hamiltonian problem for stoquastic Hamiltonians is (promise) BPP-hard. The Guided Local Hamiltonian problem extends the Local Hamiltonian problem by i…
On the Complexity of the Succinct State Local Hamiltonian Problem
Gabriel Waite, Karl Lin
We study the computational complexity of the Local Hamiltonian problem under the promise that its ground state is succinctly represented. We show that the Succinct State 2-Local Ha…
Physically-Motivated Guiding States for Local Hamiltonians
Gabriel Waite, Karl Lin, Samuel J Elman +1
We study the computational complexity of the Guided Local Hamiltonian problem: given a local Hamiltonian together with a classical description of a guiding state that has non-n…
The Complexity of Local Stoquastic Hamiltonians on 2D Lattices
Gabriel Waite, Michael J. Bremner
We show the 2-Local Stoquastic Hamiltonian problem on a 2D square qubit lattice is StoqMA-complete. We achieve this by extending the spatially sparse circuit construction of Olivei…