UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS

One-way measurement based quantum computations (1WQC) may describe unitary transformations, via a composition of CPTP maps which are not all unitary themselves. This motivates the following decision problems. Is it possible to determine whether a "quantum-to-quantum" 1WQC procedure (having non-trivial input and output subsystems) performs a unitary transformation? Is it possible to describe precisely how such computations transform quantum states, by translation to a quantum circuit of comparable complexity? In this article, we present an efficient algorithm for transforming certain families of measurement-based computations into a reasonable unitary circuit model, in particular without employing the principle of deferred measurement.

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

[2]  Michael A. Nielsen,et al.  Quantum computing and polynomial equations over the finite field Z 2 , 2004 .

[3]  J. Niel de Beaudrap,et al.  An extremal result for geometries in the one-way measurement model , 2008, Quantum Inf. Comput..

[4]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[5]  P. Panangaden,et al.  Parsimonious and robust realizations of unitary maps in the one-way model , 2005 .

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

[7]  Daniel Gottesman,et al.  Stabilizer Codes and Quantum Error Correction , 1997, quant-ph/9705052.

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

[9]  A. Einstein The Foundation of the General Theory of Relativity , 1916 .

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

[11]  John P. Hayes,et al.  Optimal synthesis of linear reversible circuits , 2008, Quantum Inf. Comput..

[12]  H. Briegel,et al.  One-way Quantum Computation - a tutorial introduction , 2006, quant-ph/0603226.

[13]  H. Briegel,et al.  Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.

[14]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[15]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[16]  J. N. D. Beaudrap Theory of measurement-based quantum computing , 2008, 0812.2869.

[17]  H. Briegel,et al.  Quantum computing via measurements only , 2000, quant-ph/0010033.

[18]  Edward Farhi,et al.  A Quantum Algorithm for the Hamiltonian NAND Tree , 2008, Theory Comput..

[19]  Debbie W. Leung,et al.  Unified derivations of measurement-based schemes for quantum computation , 2005 .

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

[21]  Isaac L. Chuang,et al.  Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.

[22]  Niel de Beaudrap Finding flows in the one-way measurement model , 2008 .