Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1006.2616 · Lecture notes in computer science

Which Graph States are Useful for Quantum Information Processing?

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

Published Jan 1, 2014• 42 citations
arXivHTMLPDF
DOI
10.1007/978-3-642-54429-3_12

Related papers

Protocols for quantum information processing on graph states

Ankur Raina

•Apr 12, 2021•0 citations

Quantum information processing with photonic graph states

Massimiliano Proietti

•May 1, 2020•0 citations

Quantum Lego: Graph States for Quantum Computing and Information Processing.

Damian Markham

ERCIM news/ERCIM news online edition•Jan 1, 2018•0 citations

Basics of Quantum Graphs

Sovan Samanta, Antonios Kalampakas, Tofigh Allahviranloo

Studies in computational intelligence•Jan 1, 2025•0 citations

Quantum Information Processing with Graphs

Mehdi Mhalla, Mio Murao, Simon Perdrix +2 more

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 characterization 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 types of MBQC: uniform equiprobability and constant probability. These classes can be useful from a cryptographic and information point of view because even though we can not 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 characterizations 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 characterizations 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 characterization 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.

•Jun 14, 2010•0 citations

Programmable four-photon graph states on a silicon chip

Jeremy C. Adcock, Caterina Vigliar, Raffaele Santagati +2 more

Future quantum computers require a scalable architecture on a scalable technology-one that supports millions of high-performance components. Measurement-based protocols, using graph states, represent the state of the art in architectures for optical quantum computing. Silicon photonics technology offers enormous scale and proven quantum optical functionality. Here we produce and encode photonic graph states on a mass-manufactured chip, using four on-chip-generated photons. We programmably generate all types of four-photon graph state, implementing a basic measurement-based protocol, and measure high-visibility heralded interference of the chip's four photons. We develop a model of the device and bound the dominant sources of error using Bayesian inference. The combination of measurement-based quantum computation, silicon photonics technology, and on-chip multi-pair sources will be a useful one for future scalable quantum information processing with photons.

arXiv:1811.03023•Nature Communications•Aug 6, 2019•134 citations
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 characterization 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 types of MBQC: uniform equiprobability and constant probability. These classes can be useful from a cryptographic and information point of view because even though we can not 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 characterizations 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 characterizations 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 characterization 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.
Future quantum computers require a scalable architecture on a scalable technology-one that supports millions of high-performance components. Measurement-based protocols, using graph states, represent the state of the art in architectures for optical quantum computing. Silicon photonics technology offers enormous scale and proven quantum optical functionality. Here we produce and encode photonic graph states on a mass-manufactured chip, using four on-chip-generated photons. We programmably generate all types of four-photon graph state, implementing a basic measurement-based protocol, and measure high-visibility heralded interference of the chip's four photons. We develop a model of the device and bound the dominant sources of error using Bayesian inference. The combination of measurement-based quantum computation, silicon photonics technology, and on-chip multi-pair sources will be a useful one for future scalable quantum information processing with photons.