Classical spin systems and the quantum stabilizer formalism: General mappings and applications
DOI10.1063/1.3190486zbMath1298.82009arXiv0812.2127OpenAlexW2594258589WikidataQ62381976 ScholiaQ62381976MaRDI QIDQ3069182
Hans J. Briegel, Wolfgang Dür, Maarten Van den Nest, R. Hübener
Publication date: 24 January 2011
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.2127
Applications of graph theory (05C90) Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (3)
Cites Work
- Graph minors. III. Planar tree-width
- Matroid tree-width
- Cluster-state quantum computation
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
- Fault-tolerant quantum computation by anyons
- Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic
- Multiparty entanglement in graph states
- Simulating Quantum Computation by Contracting Tensor Networks
This page was built for publication: Classical spin systems and the quantum stabilizer formalism: General mappings and applications