most citedThe Complexity of Local Stoquastic Hamiltonians on 2D Lattices

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph20261 cited

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…

quant-ph2026

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…

quant-ph2026

Dissipative continuation for ground-state preparation at chemical transition states

Thomas W. Watts, Soumya Sarkar, Daniel Collins +4

Simulating chemical reactions exhibits a pronounced unevenness in computational difficulty: while equilibrium reactant and product geometries are often tractable, transition-state…

quant-ph2025

Quantum computing for corrosion-resistant materials and anti-corrosive coatings design

Nam Nguyen, Thomas W. Watts, Benjamin Link +14

Corrosion is a pervasive issue that impacts the structural integrity and performance of materials across various industries, imposing a significant economic impact globally. In fie…

quant-ph2024

Prospects for Quantum Computation in Propellant Design: Assessing the Stability of Cyclic Ozone in Nanoscale Confinement

Thomas W. Watts, Matthew Otten, Jason T. Necaise +14

Cyclic ozone additives have the potential to markedly increase the specific impulse of rocket fuel. This would translate to greater efficiency and reduced costs for space lift by g…