45 citations · 65 across the 10 of their papers we have counts for
12 papers
A graph-theoretic analysis of non-generic free-fermion solvability by Krylov decompositions
Jannis Ruh, Samuel J. Elman, Adrian Chapman
Exactly solvable models are often identified from structural features of their interactions. For quantum spin Hamiltonians, these are captured by the frustration graph of anticommu…
Locality and filter design for dissipative ground-state preparation
Samuel J. Elman
Ground-state preparation is a fundamental challenge in quantum many-body physics, chemistry and materials science. Dissipative state-preparation techniques engineer a Lindbladian c…
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…
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…
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…
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…
A Unified Graph-Theoretic Framework for Free-Fermion Solvability
Adrian Chapman, Samuel J. Elman, Ryan L. Mann
We show that a quantum spin system has an exact description by non-interacting fermions if its frustration graph is claw-free and contains a simplicial clique. The frustration grap…
Free fermions behind the disguise
Samuel J. Elman, Adrian Chapman, Steven T. Flammia
An invaluable method for probing the physics of a quantum many-body spin system is a mapping to noninteracting effective fermions. We find such mappings using only the frustration…
Boundary topological entanglement entropy in two and three dimensions
Jacob C. Bridgeman, Benjamin J. Brown, Samuel J. Elman
The topological entanglement entropy is used to measure long-range quantum correlations in the ground state of topological phases. Here we obtain closed form expressions for topolo…