Steve Flammia: Characterization of Solvable Spin Models via Graph Invariants

Channel:
Subscribers:
2,450
Published on ● Video Link: https://www.youtube.com/watch?v=-PGEESTvi2Y



Duration: 59:54
275 views
0


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.

Joint work with Adrian Chapman, https://arxiv.org/abs/2003.05465




Other Videos By QuICS


2020-11-04Wolfgang Pfaff: Increasing connectivity and modularity in superconducting quantum circuits
2020-10-29Iordanis Kerenidis: Quantum Machine Learning: prospects and challenges
2020-10-21Urmila Mahadev: Classical homomorphic encryption for quantum circuits
2020-10-08Thomas Baker: Density functionals, Kohn-Sham potentials & Green’s functions from a quantum computer
2020-09-23James D. Whitfield: Limitations of Hartree-Fock with Quantum Resources
2020-09-18Mark Wilde: Quantum Renyi relative entropies and their use
2020-08-17Dmitry Green: A superconducting circuit realization of combinatorial gauge symmetry
2020-07-23Matt Hastings: The Power of Adiabatic Quantum Computation with No Sign Problem
2020-06-19William Slofstra: Arkhipov's theorem, games, groups, and graphs
2020-06-10Ramis Movassagh:Cayley path & quantum supremacy:Average case # P-Hardness of random circuit sampling
2020-06-04Steve Flammia: Characterization of Solvable Spin Models via Graph Invariants
2020-05-20Aram Harrow: Small Quantum Computers and Large Classical Data Sets
2020-02-05Dominik Hangleiter: (How) can we verify quantum supremacy?
2020-02-05Giacomo Torlai: Enhancing Quantum Simulators with Neural Networks
2019-11-21Felix Leditzky: Playing Games with Multiple Access Channels
2019-11-14Anand Natarajan: NEEXP ⊆ MIP*
2019-11-14Alex B. Grilo: Recent advances in Zero-knowledge proofs in the quantum setting
2019-10-03Andrea Coladangelo: A simple two-player dimension witness based on embezzlement
2019-09-06John Preskill: Quantum speedups in the NISQ era
2019-09-06Aditya Nema: Unitary Designs and quantum channels with super additive classical capacity
2019-09-06Krysta Svore: Programming for quantum solutions today and tomorrow



Tags:
quantum computing