• Corpus ID: 250644425

Characterising Determinism in MBQCs involving Pauli Measurements

@inproceedings{Mhalla2022CharacterisingDI,
  title={Characterising Determinism in MBQCs involving Pauli Measurements},
  author={Mehdi Mhalla and Simon Perdrix and Luc Sanselme},
  year={2022}
}
We introduce a new characterisation of determinism in measurement-based quantum computing. The one-way model of computation consists in performing local measurements over a large entangled state represented by a graph. The ability to perform an overall deterministic computation requires a correction strategy because of the non-determinism of each measurement. The existence of such correction strategy depends on the underlying graph and the basis of the performed measurements. GFlow is a well… 

Figures from this paper

References

SHOWING 1-10 OF 12 REFERENCES

Determinism and Computational Power of Real Measurement-Based Quantum Computation

It is proved however that Pauli flow is necessary for determinism in the real MBQC model, an interesting and useful fragment ofMBQC.

Generalized flow and determinism in measurement-based quantum computation

We extend the notion of quantum information flow defined by Danos and Kashefi (2006 Phys. Rev. A 74 052310) for the one-way model (Raussendorf and Briegel 2001 Phys. Rev. Lett. 86 910) and present a

The measurement calculus

A rigorous mathematical model underlying the one-way quantum computer is developed and a concrete syntax and operational semantics for programs, which are called patterns, are presented, and an algebra of these patterns derived from a denotational semantics are presented.

Relating Measurement Patterns to Circuits via Pauli Flow

  • Will Simmons
  • Computer Science
    Electronic Proceedings in Theoretical Computer Science
  • 2021
It is shown that Pauli flow can similarly be identified efficiently and that any measurement pattern whose underlying graph admits a Pauliflow can be efficiently transformed into a gate-based circuit without using ancilla qubits.

Fusion-based quantum computation

It is found that tailoring the fault-tolerance framework to the physical system allows the scheme to have a higher threshold than schemes reported in literature, and presents a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion.

Computational Depth Complexity of Measurement-Based Quantum Computation

This paper proves that the "depth of computations" in the one-way model is equivalent, up to a classical side-processing of logarithmic depth, to the quantum circuit model augmented with unbounded fanout gates, a very powerful model of quantum computation.

There and back again: A circuit extraction tale

This work gives the first circuit-extraction algorithm to work for one-way computations containing measurements in all three planes and having gflow, and brings together several known rewrite rules for measurement patterns and formalise them in a unified notation using the ZX-calculus.

Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus

A simplification strategy for ZX-diagrams is given based on the two graph transformations of local complementation and pivoting and it is shown that the resulting reduced diagram can be transformed back into a quantum circuit.

Topological fault-tolerance in cluster state quantum computation

A fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions using topologically protected quantum gates and equivalence transformations that can be used to simplify fault-Tolerant circuits and to derive circuit identities in a topological manner are described.

Determinism in the one-way model

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.