Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation

DOI10.1007/978-3-319-06880-0_22zbMath1411.81079arXiv1311.3610OpenAlexW1946741112MaRDI QIDQ5418976

Elham Kashefi, Damian Markham

Publication date: 2 June 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Related Items (1)

Outcome determinism in measurement-based quantum computation with qudits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetry constraints on temporal order in measurement-based quantum computation
• Cluster-state quantum computation
• How much of one-way computation is just thermodynamics?
• Parallelizing quantum circuits
• Information flow in entangled quantum systems
• Computational Depth Complexity of Measurement-Based Quantum Computation
• Multiparty entanglement in graph states
• Which Graph States are Useful for Quantum Information Processing?
• Finding Optimal Flows Efficiently
• The measurement calculus
• UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS
• The One Way to Quantum Computation
• Graph states for quantum secret sharing
• Universal Blind Quantum Computation
• Quadratic Form Expansions for Unitaries

This page was built for publication: Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation