Which Graph States are Useful for Quantum Information Processing?

DOI10.1007/978-3-642-54429-3_12MaRDI QIDQ3453320zbMATH OpenOpenAlexFDO

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

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 information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)

Abstract: Graph states are an elegant and powerful quantum resource for measurement based quantum computation (MBQC). They are also used for many quantum protocols (error correction, secret sharing, etc.). The main focus of this paper is to provide a structural characterisation of the graph states that can be used for quantum information processing. The existence of a gflow (generalized flow) is known to be a requirement for open graphs (graph, input set and output set) to perform uniformly and strongly deterministic computations. We weaken the gflow conditions to define two new more general kinds of MBQC: uniform equiprobability and constant probability. These classes can be useful from a cryptographic and information point of view because even though we cannot do a deterministic computation in general we can preserve the information and transfer it perfectly from the inputs to the outputs. We derive simple graph characterisations for these classes and prove that the deterministic and uniform equiprobability classes collapse when the cardinalities of inputs and outputs are the same. We also prove the reversibility of gflow in that case. The new graphical characterisations allow us to go from open graphs to graphs in general and to consider this question: given a graph with no inputs or outputs fixed, which vertices can be chosen as input and output for quantum information processing? We present a characterisation of the sets of possible inputs and ouputs for the equiprobability class, which is also valid for deterministic computations with inputs and ouputs of the same cardinality.

Recommendations

• Efficient entanglement measure for graph states
• Transforming graph states using single-qubit operations
• From graph states to two-graph states
• Graph states and the necessity of Euler decomposition
• Graph states in phase space
• Graph-theoretic quantum system modelling for information/computation processing circuits
• A graph theoretical approach to states and unitary operations
• Quantum discord of states arising from graphs
• Quantum channels over graph states using generalized measurement-based quantum computation framework
• Graph states for quantum secret sharing

Cites work

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

Cited in

(16)

• Hybrid quantum-classical circuit simplification with the ZX-calculus
• Reversibility in extended measurement-based quantum computation
• Graph-theoretic quantum system modelling for information/computation processing circuits
• Symmetry constraints on temporal order in measurement-based quantum computation
• Finding Optimal Flows Efficiently
• An extremal result for geometries in the one-way measurement model
• On weak odd domination and graph-based quantum secret sharing
• Information flow in secret sharing protocols
• Entanglement, flow and classical simulatability in measurement based quantum computation
• Resources Required for Preparing Graph States
• Quantum states associated to mixed graphs and their algebraic characterization
• Graph states and the variety of principal minors
• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
• An algebraic formulation of Pauli flow, leading to faster flow-finding algorithms
• Pauli flow on open graphs with unknown measurement labels
• Covering a graph with minimal local sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453320)