An introduction to measurement based quantum computation

In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.

[1]  Amílcar Sernadas,et al.  Quantum Computation and Information , 2006 .

[2]  M. Nielsen,et al.  Fault-tolerant quantum computation with cluster states , 2004, quant-ph/0405134.

[3]  Andrew M. Childs,et al.  Unified derivations of measurement-based schemes for quantum computation , 2004, Physical Review A.

[4]  Simon Perdrix,et al.  Unifying quantum computation with projective measurements only and one-way quantum computation , 2004, Other Conferences.

[5]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[6]  D. Leung,et al.  Computation by measurements: A unifying picture , 2004, quant-ph/0404082.

[7]  F. Verstraete,et al.  Valence-bond states for quantum computation , 2003, quant-ph/0311130.

[8]  D. Leung.  Quantum computation by measurements , 2003, quant-ph/0310189.

[9]  Michael A. Nielsen,et al.  Quantum computation by measurement and quantum memory , 2003 .

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

[11]  Yaoyun Shi.  Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2002, Quantum Inf. Comput..

[12]  H. Briegel,et al.  Computational model underlying the one-way quantum computer , 2001, Quantum Inf. Comput..

[13]  Howard E. Brandt,et al.  Quantum computation and information : AMS Special Session Quantum Computation and Information, January 19-21, 2000, Washington, D.C. , 2002 .

[14]  D. Leung.  Two-qubit Projective Measurements are Universal for Quantum Computation , 2001, quant-ph/0111122.

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

[16]  R. Werner.  All teleportation and dense coding schemes , 2000, quant-ph/0003070.

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

[18]  Richard Cleve,et al.  Fast parallel circuits for the quantum Fourier transform , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[20]  I. Chuang,et al.  Quantum Teleportation is a Universal Computational Primitive , 1999, quant-ph/9908010.

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

[22]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.