Characterization of solvable spin models via graph invariants
arXiv:2003.05465 · doi:10.22331/q-2020-06-04-278
Abstract
Exactly solvable models are essential in physics. For many-body spin-1/2 systems, an important class of such models consists of those that can be mapped to free fermions hopping on a graph. We provide a complete characterization of models which can be solved this way. Specifically, we reduce the problem of recognizing such spin models to the graph-theoretic problem of recognizing line graphs, which has been solved optimally. A corollary of our result is a complete set of constant-sized commutation structures that constitute the obstructions to a free-fermion solution. We find that symmetries are tightly constrained in these models. Pauli symmetries correspond to either: (i) cycles on the fermion hopping graph, (ii) the fermion parity operator, or (iii) logically encoded qubits. Clifford symmetries within one of these symmetry sectors, with three exceptions, must be symmetries of the free-fermion model itself. We demonstrate how several exact free-fermion solutions from the literature fit into our formalism and give an explicit example of a new model previously unknown to be solvable by free fermions.
arXiv comment19 pages, 4 tables, 5 figures
References in corpus (33)
- Anyons in an exactly solved model and beyond
- Unpaired Majorana fermions in quantum wires
- Fermionic quantum computation
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Classical simulation of noninteracting-fermion quantum circuits
- Hyperbolic Lattices in Circuit Quantum Electrodynamics
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
- Matchgates and classical simulation of quantum circuits
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Generalized Jordan-Wigner Transformations
- Single-shot fault-tolerant quantum error correction
- Universal transversal gates with color codes - a simplified approach
- Lowering qubit requirements for quantum simulations of fermionic systems
- Superfast encodings for fermionic quantum simulation
- Fault-tolerant error correction with the gauge color code
- Line-Graph Lattices: Euclidean and Non-Euclidean Flat Bands, and Implementations in Circuit Quantum Electrodynamics
- Operator Locality in Quantum Simulation of Fermionic Models
- Complexity of quantum impurity problems
- Fermions without fermi fields
- Exact bosonization in two spatial dimensions and a new class of lattice gauge theories
- Bose-Fermi Transformation In Three Dimensional Space
- Efficient classical simulation of matchgate circuits with generalized inputs and measurements
- Free fermions in disguise
- Majorana loop stabilizer codes for error correction of fermionic quantum simulations
- Arbitrary Dimensional Majorana Dualities and Network Architectures for Topological Matter
- Constructions and Noise Threshold of Topological Subsystem Codes
- All pure fermionic non-Gaussian states are magic states for matchgate computations
- Extending matchgates into universal quantum computation
- Two-local qubit Hamiltonians: when are they stoquastic?
- Jordan-Wigner transformations for tree structures
- The computational power of matchgates and the XY interaction on arbitrary graphs
Cited by in corpus (35)
- Entanglement phase transitions in measurement-only dynamics
- Barren Plateaus in Variational Quantum Computing
- Circuit Quantum Electrodynamics in Hyperbolic Space: From Photon Bound States to Frustrated Spin Models
- Fixed Depth Hamiltonian Simulation via Cartan Decomposition
- Topology, criticality, and dynamically generated qubits in a stochastic measurement-only Kitaev model
- Algebraic Compression of Quantum Circuits for Hamiltonian Evolution
- Free fermions behind the disguise
- Particle exchange statistics beyond fermions and bosons
- Geometric Criterion for Solvability of Lattice Spin Systems
- Generalised Onsager Algebra in Quantum Lattice Models
- Ising analogues of quantum spin chains with multispin interactions
- Onsager algebra and algebraic generalization of Jordan-Wigner transformation
- Bounding the joint numerical range of Pauli strings by graph parameters
- Disorder enhanced quantum many-body scars in Hilbert crystals
- Topological and dynamical features of periodically driven spin ladders
- Free fermions beyond Jordan and Wigner
- Integrable spin chains and the Clifford group
- How to define quantum mean-field solvable Hamiltonians using Lie algebras
- Free-Fermion Subsystem Codes
- Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
- Quantum circuits with free fermions in disguise
- A note on simplicial cliques
- Integrability of Goldilocks quantum cellular automata
- Exact real time dynamics with free fermions in disguise
- A Graph-Theoretic Framework for Free-Parafermion Solvability
- Entanglement spectrum of matchgate circuits with universal and non-universal resources
- Quantized and maximum entanglement from sublattice symmetry
- A solvable embedding mechanism for one-dimensional spinless and Majorana fermions in higher-dimensional spin-1/2 magnets
- The Hilbert-space structure of free fermions in disguise
- Simulation of quantum computation with magic states via Jordan-Wigner transformations
- Local fermion-to-qudit mappings: a practical recipe for four-level systems
- Non-onsite symmetry breaking: topological phase coexistence and criticality
- Expanding the Class of Free Fermions via Twin-Collapse Methods
- Frustration graph formalism for qudit observables
- Bosonization in -paraparticle Luttinger models