6 papers
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…
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…
End-to-End Complexity Analysis for Quantum Simulation of the Extended Jaynes-Cummings Models
Nam Nguyen, Michael Yu, Alan Robertson +3
The extended Jaynes-Cummings model (eJCM) is a foundational framework for describing multi-mode light-matter interactions, with direct applications in quantum technologies such as…
A Graph-Theoretic Framework for Free-Parafermion Solvability
Ryan L. Mann, Samuel J. Elman, David R. Wood +1
We present a graph-theoretic characterisation of when a quantum spin model admits an exact solution via a mapping to free parafermions. Our characterisation is based on the concept…
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…
Optimal Scheduling of Graph States via Path Decompositions
Samuel J. Elman, Jason Gavriel, Ryan L. Mann
We study the optimal scheduling of graph states in measurement-based quantum computation, establishing an equivalence between measurement schedules and path decompositions of graph…