Generalized Flow and Determinism in Measurement-based Quantum Computation
arXiv:quant-ph/0702212 · doi:10.1088/1367-2630/9/8/250
Abstract
We extend the notion of quantum information flow defined by Danos and Kashefi for the one-way model and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the X-Y, X-Z and Y-Z planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the deterministic computation in the one-way model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly essential for the study of the algorithms and complexity in the one-way model.
16 pages, 10 figures
References in corpus (13)
- Quantum Teleportation is a Universal Computational Primitive
- Measurement-based quantum computation with cluster states
- Multi-party entanglement in graph states
- Cluster-state quantum computation
- Determinism in the one-way model
- An introduction to measurement based quantum computation
- The one-way quantum computer -- a non-network model of quantum computation
- State Transfer instead of Teleportation in Measurement-based Quantum Computation
- One-way Quantum Computation - a tutorial introduction
- Finding flows in the one-way measurement model
- Measurement-Based Quantum Turing Machines and their Universality
- Phase map decompositions for unitaries
- A complete algorithm to find flows in the one-way measurement model
Cited by in corpus (82)
- Measurement-based quantum computation
- Graph States for Quantum Secret Sharing
- Unconditionally verifiable blind computation
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Computational power of correlations
- Experimental demonstration of graph-state quantum secret sharing
- Parallelizing Quantum Circuits
- Universal Blind Quantum Computing with Weak Coherent Pulses
- There and back again: A circuit extraction tale
- Ancilla-Driven Universal Quantum Computation
- Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing
- Complex Quantum Networks: a Topical Review
- Finding Optimal Flows Efficiently
- Computational universality of symmetry-protected topologically ordered cluster phases on 2D Archimedean lattices
- Universal MBQC with generalised parity-phase interactions and Pauli measurements
- Measurement-Based Quantum Computation
- Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer
- ZX-calculus for the working quantum computer scientist
- Which graph states are useful for quantum information processing?
- Finding flows in the one-way measurement model
- Information Flow in Secret Sharing Protocols
- Efficient quantum pseudorandomness with simple graph states
- Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
- Graph States, Pivot Minor, and Universality of (X,Z)-measurements
- Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer
- Nonlocality and Entanglement for Symmetric States
- Garbled Quantum Computation
- A quantum algorithm for additive approximation of Ising partition functions
- Relating Measurement Patterns to Circuits via Pauli Flow
- Acausal measurement-based quantum computing
- Closed timelike curves in measurement-based quantum computation
- Quantum Protocols within Spekkens' Toy Model
- Derandomizing quantum circuits with measurement based unitary designs
- Loss-tolerant teleportation on large stabilizer states
- New Protocols and Lower Bound for Quantum Secret Sharing with Graph States
- On Weak Odd Domination and Graph-based Quantum Secret Sharing
- An analysis of the trade-off between spatial and temporal resources for measurement-based quantum computation
- Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
- Contextuality in multipartite pseudo-telepathy graph games
- Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
- Supercurrents in chiral channels originate from upstream information transfer: a theoretical prediction
- Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
- Cross-verification of independent quantum devices
- Minimal physical resources for the realisation of measurement-based quantum computation
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- Flexible quantum data bus for quantum networks
- Fault-tolerant quantum speedup from constant depth quantum circuits
- Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
- Formal Methods for Quantum Programs: A Survey
- Adiabatic graph-state quantum computation
- Blind Oracular Quantum Computation
- The Gauge Theory of Measurement-Based Quantum Computation
- Compact quantum circuits from one-way quantum computation
- Construction of optimal resources for concatenated quantum protocols
- Verified Delegated Quantum Computing with One Pure Qubit
- Symmetry constraints on temporal order in measurement-based quantum computation
- Quantum linear network coding as one-way quantum computation
- Outcome determinism in measurement-based quantum computation with qudits
- Geometry-Based Optimization of One-Way Quantum Computation Measurement Patterns
- Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware
- Optimal compilation of parametrised quantum circuits
- Flow conditions for continuous variable measurement-based quantum computing
- Multi-agent blind quantum computation without universal cluster states
- Measurement-based quantum machine learning
- The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications
- Reversibility in the Extended Measurement-based Quantum Computation
- Minimally Universal Parity Quantum Computing
- Unitary-circuit semantics for measurement-based computations
- Quantum advantage in temporally flat measurement-based quantum computation
- Classical simulation of measurement-based quantum computation on higher-genus surface-code states
- Towards practical secure delegated quantum computing with semi-classical light
- Outcome Independence of Entanglement in One-Way Computation
- Heralded photonic graph states with inefficient quantum emitters
- Quantum Theory from Principles, Quantum Software from Diagrams
- A dataflow programming framework for linear optical distributed quantum computing
- An extremal result for geometries in the one-way measurement model
- Pauli Flow on Open Graphs with Unknown Measurement Labels
- Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow
- Reducing depth and measurement weights in Pauli-based computation
- Algebraic characterisation of one-way patterns
- Quadratic Form Expansions for Unitaries
- One-Way Quantum Computer Simulation