Rewriting Measurement-Based Quantum Computations with Generalised Flow

We present a method for verifying measurement-based quantum computations, by producing a quantum circuit equivalent to a given deterministic measurement pattern. We define a diagrammatic presentation of the pattern, and produce a circuit via a rewriting strategy based on the generalised flow of the pattern. Unlike other methods for translating measurement patterns with generalised flow to circuits, this method uses neither ancilla qubits nor acausal loops.

[1]  E. Cruz,et al.  Lost in the translation. , 1988, Chest.

[2]  Bob Coecke,et al.  POVMs and Naimark's Theorem Without Sums , 2006, QPL.

[3]  Aleks Kissinger,et al.  Graph Rewrite Systems for Classical Structures in Dagger−Symmetric Monoidal Categories , 2008 .

[4]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[5]  Elham Kashefi,et al.  Computational Depth Complexity of Measurement-Based Quantum Computation , 2009, TQC.

[6]  Elham Kashefi,et al.  The measurement calculus , 2004, JACM.

[7]  Samson Abramsky,et al.  A categorical semantics of quantum protocols , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[8]  Guy Riddihough.  Not Lost In Translation , 2007, Science's STKE.

[9]  E. Kashefi,et al.  Generalized flow and determinism in measurement-based quantum computation , 2007, quant-ph/0702212.

[10]  Dusko Pavlovic,et al.  Quantum measurements without sums , 2007 .

[11]  Stephen Lack,et al.  Coalgebras, braidings and distributive laws , 2004 .

[12]  Mehdi Mhalla,et al.  Finding Optimal Flows Efficiently , 2007, ICALP.

[13]  E. Kashefi,et al.  Determinism in the one-way model , 2005, quant-ph/0506062.

[14]  Lucas Dixon,et al.  Graphical reasoning in compact closed categories for quantum computation , 2009, Annals of Mathematics and Artificial Intelligence.

[15]  Ross Duncan,et al.  Types for quantum computing , 2006 .

[16]  R. Raussendorf,et al.  Computational Model for the One‐Way Quantum Computer: Concepts and Summary , 2005 .

[17]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[19]  Simon Perdrix,et al.  Graph States and the Necessity of Euler Decomposition , 2009, CiE.

[20]  Bob Coecke,et al.  Interacting Quantum Observables , 2008, ICALP.