One-way Quantum Computation - a tutorial introduction
arXiv:quant-ph/0603226
Abstract
In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described include the stabilizer formalism and the logical Heisenberg picture. We highlight ways in which it is useful to understand one-way computation beyond simple equivalence with the quantum circuit model. We briefly review current proposals of implementations and experimental progress and summarize some recent related theoretical developments. Although the chapter is primarily didactic in focus, we include a number of new methods and observations. These include: a simpler and more compact formulation of one-way quantum computation in the stabilizer formalism; A new way of implementing unitaries diagonal in the computational basis; New results on the family of operations which may be implemented in a single round of measurements; A method for constructing compact one-way patterns by decomposing unitaries in terms of diagonal unitaries and Clifford group transformations.
22 pages, a tutorial book chapter with a number of new methods and observations. Minor errors corrected and a few additional references added
References in corpus (1)
Cited by in corpus (17)
- Measurement-based quantum computation
- Instantaneous Quantum Computation
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Parallelizing Quantum Circuits
- Compact Toffoli gate using weighted graph states
- Timing constraints imposed by classical digital control systems on photonic implementations of measurement-based quantum computing
- Violating Bell inequalities with entangled optical frequency combs and multi-pixel homodyne detection
- Adiabatic graph-state quantum computation
- Applications and resource reductions in measurement-based variational quantum eigensolvers
- Quantum linear network coding as one-way quantum computation
- Twisted graph states for ancilla-driven quantum computation
- Efficient optimization of perturbative gadgets
- Estimating diagonal entries of powers of sparse symmetric matrices is BQP-complete
- Unitary-circuit semantics for measurement-based computations
- Secure Two-Party Quantum Computation Over Classical Channels
- Is there a measurement-only version of quantum mechanics?
- Quadratic Form Expansions for Unitaries