Measurement-based quantum computation on cluster states

We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation, and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size

Nearest-neighbor coupling asymmetry in the generation of cluster states

We demonstrate that charge-qubit cluster state generation by capacitive coupling is anisotropic. Specifically, horizontal vs vertical nearest-neighbor inter-qubit coupling differs in a rectangular lattice. We show how to ameliorate this anisotropy by applying potential biases to the array of double dots.Comment: 7 pages, 2 figure

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. Dependent Pauli corrections are derived for all such patterns, which equalize all computation branches, and only depend on the underlying entanglement graph and its choice of inputs and outputs. The class of patterns having flow is stable under composition and tensorization, and has unitary embeddings as realizations. The restricted class of patterns having both flow and reverse flow, supports an operation of adjunction, and has all and only unitaries as realizations.Comment: 8 figures, keywords: measurement based quantum computing, deterministic computing; Published version, including a new section on circuit decompositio

Entanglement Generation of Clifford Quantum Cellular Automata

Clifford quantum cellular automata (CQCAs) are a special kind of quantum cellular automata (QCAs) that incorporate Clifford group operations for the time evolution. Despite being classically simulable, they can be used as basic building blocks for universal quantum computation. This is due to the connection to translation-invariant stabilizer states and their entanglement properties. We will give a self-contained introduction to CQCAs and investigate the generation of entanglement under CQCA action. Furthermore, we will discuss finite configurations and applications of CQCAs.Comment: to appear in the "DPG spring meeting 2009" special issue of Applied Physics

A fault-tolerant one-way quantum computer

We describe a fault-tolerant one-way quantum computer on cluster states in three dimensions. The presented scheme uses methods of topological error correction resulting from a link between cluster states and surface codes. The error threshold is 1.4% for local depolarizing error and 0.11% for each source in an error model with preparation-, gate-, storage- and measurement errors.Comment: 26 page

A scheme for demonstration of fractional statistics of anyons in an exactly solvable model

We propose a scheme to demonstrate fractional statistics of anyons in an exactly solvable lattice model proposed by Kitaev that involves four-body interactions. The required many-body ground state, as well as the anyon excitations and their braiding operations, can be conveniently realized through \textit{dynamic}laser manipulation of cold atoms in an optical lattice. Due to the perfect localization of anyons in this model, we show that a quantum circuit with only six qubits is enough for demonstration of the basic braiding statistics of anyons. This opens up the immediate possibility of proof-of-principle experiments with trapped ions, photons, or nuclear magnetic resonance systems.Comment: 4 pages, 3 figure

The one-way CNOT simulation

In this paper we present the complete simulation of the quantum logic CNOT gate in the one-way model, that consists entirely of one-qubit measurements on a particular class of entangled states.Comment: 7 pages, 2 figure

Valence Bond Solids for Quantum Computation

Cluster states are entangled multipartite states which enable to do universal quantum computation with local measurements only. We show that these states have a very simple interpretation in terms of valence bond solids, which allows to understand their entanglement properties in a transparent way. This allows to bridge the gap between the differences of the measurement-based proposals for quantum computing, and we will discuss several features and possible extensions