Which Graph States are Useful for Quantum Information Processing?

DOI10.1007/978-3-642-54429-3_12zbMath1451.81118arXiv1006.2616OpenAlexW1601313063MaRDI QIDQ3453320

Peter S. Turner, M. Murao, Masato Someya, Simon Perdrix, Mehdi Mhalla

Publication date: 20 November 2015

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.2616

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (7)

Symmetry constraints on temporal order in measurement-based quantum computation ⋮ Graph states and the variety of principal minors ⋮ Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation ⋮ Hybrid quantum-classical circuit simplification with the ZX-calculus ⋮ On weak odd domination and graph-based quantum secret sharing ⋮ Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation ⋮ Reversibility in Extended Measurement-Based Quantum Computation

Cites Work

• Multiparty entanglement in graph states
• The measurement calculus
• Graph states for quantum secret sharing

This page was built for publication: Which Graph States are Useful for Quantum Information Processing?