Determinism in the one-way model

Abstract

We introduce a flow condition on open graph states (graph states with inputs and outputs) which guarantees globally deterministic behavior of a class of measurement patterns defined over them. Dependent Pauli corrections are derived for all such patterns, which equalize all computation branches, and only depend on the underlying entanglement graph and its choice of inputs and outputs. The class of patterns having flow is stable under composition and tensorization, and has unitary embeddings as realizations. The restricted class of patterns having both flow and reverse flow, supports an operation of adjunction, and has all and only unitaries as realizations.

8 figures, keywords: measurement based quantum computing, deterministic computing; Published version, including a new section on circuit decomposition

References in corpus (18)

• Measurement-based quantum computation with cluster states
• Experimental One-Way Quantum Computing
• Multi-party entanglement in graph states
• Resource-efficient linear optical quantum computation
• Optical quantum computation using cluster states
• Cluster-state quantum computation
• Fault-tolerant quantum computation with cluster states
• Unified derivations of measurement-based schemes for quantum computation
• An introduction to measurement based quantum computation
• Efficient generation of graph states for quantum computation
• Optical generation of matter qubit graph states
• Robust and parsimonious realisations of unitaries in the one-way model
• One-way Quantum Computation - a tutorial introduction
• Graph State Preparation and Cluster Computation with Global Addressing of Optical Lattices
• Efficient construction of 2-D cluster states with probabilistic quantum gates
• Natural three-qubit interactions in one-way quantum computing
• Phase map decompositions for unitaries
• The Measurement Calculus

Cited by in corpus (81)

• Experimental Demonstration of Blind Quantum Computing
• Universal blind quantum computation
• Graph States for Quantum Secret Sharing
• Unconditionally verifiable blind computation
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Experimental demonstration of graph-state quantum secret sharing
• Verification of quantum computation: An overview of existing approaches
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Parallelizing Quantum Circuits
• Universal Blind Quantum Computing with Weak Coherent Pulses
• There and back again: A circuit extraction tale
• Ancilla-Driven Universal Quantum Computation
• Multiparty Delegated Quantum Computing
• Securing Quantum Computations in the NISQ Era
• Finding Optimal Flows Efficiently
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• Resource-efficient photonic quantum computation with high-dimensional cluster states
• Optimising Clifford Circuits with Quantomatic
• Fault-tolerant Operations for Universal Blind Quantum Computation
• Measurement-Based Quantum Computation
• One-way quantum computation with two-photon multiqubit cluster states
• Finding flows in the one-way measurement model
• Information Flow in Secret Sharing Protocols
• 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
• Reducing resources for verification of quantum computations
• Garbled Quantum Computation
• A quantum algorithm for additive approximation of Ising partition functions
• Acausal measurement-based quantum computing
• Relating Measurement Patterns to Circuits via Pauli Flow
• Closed timelike curves in measurement-based quantum computation
• QEnclave -- A practical solution for secure quantum cloud computing
• Phase map decompositions for unitaries
• On Weak Odd Domination and Graph-based Quantum Secret Sharing
• The Measurement Calculus
• 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
• Security Limitations of Classical-Client Delegated Quantum Computing
• Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
• Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
• Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation
• Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)
• Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
• The Quantum Cut-and-Choose Technique and Quantum Two-Party Computation
• Cross-verification of independent quantum devices
• Flexible quantum data bus for quantum networks
• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
• Minimal physical resources for the realisation of measurement-based quantum computation
• Formal Methods for Quantum Programs: A Survey
• Adiabatic graph-state quantum computation
• Blind Oracular Quantum Computation
• Compact quantum circuits from one-way quantum computation
• A complete algorithm to find flows in the one-way measurement model
• Construction of optimal resources for concatenated quantum protocols
• Verified Delegated Quantum Computing with One Pure Qubit
• Outcome determinism in measurement-based quantum computation with qudits
• Geometry-Based Optimization of One-Way Quantum Computation Measurement Patterns
• Twisted graph states for ancilla-driven quantum computation
• Flow conditions for continuous variable measurement-based quantum computing
• Multi-agent blind quantum computation without universal cluster states
• Measurement-based quantum machine learning
• Reversibility in the Extended Measurement-based Quantum Computation
• The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications
• Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
• Quantum advantage in temporally flat measurement-based quantum computation
• Unitary-circuit semantics for measurement-based computations
• Quantum Theory from Principles, Quantum Software from Diagrams
• Secure Two-Party Quantum Computation Over Classical Channels
• Three-qubit exact Grover within the blind oracular quantum computation scheme
• Shadow Pauli Flow: Characterising Determinism in MBQCs involving Pauli Measurements
• Error Mitigation of BQP Computations using Measurement-Based Verification
• Outcome Independence of Entanglement in One-Way Computation
• An extremal result for geometries in the one-way measurement model
• Pauli Flow on Open Graphs with Unknown Measurement Labels
• Simple procedure for classical signal-procession in cluster-state quantum computation
• Optical Quantum Computing
• Reducing depth and measurement weights in Pauli-based computation
• Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation
• Quadratic Form Expansions for Unitaries
• Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow