The one-way quantum computer -- a non-network model of quantum computation

Abstract

A one-way quantum computer works by only performing a sequence of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. No non-local operations are required in the process of computation. Any quantum logic network can be simulated on the one-way quantum computer. On the other hand, the network model of quantum computation cannot explain all ways of processing quantum information possible with the one-way quantum computer. In this paper, two examples of the non-network character of the one-way quantum computer are given. First, circuits in the Clifford group can be performed in a single time step. Second, the realisation of a particular circuit -- the bit-reversal gate -- on the one-way quantum computer has no network interpretation. (Submitted to J. Mod. Opt, Gdansk ESF QIT conference issue.)

7 pages, 3 figures

Cited by in corpus (43)

• Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
• Experimental One-Way Quantum Computing
• Universal Quantum Computation with Continuous-Variable Cluster States
• Cluster-state quantum computation
• High-speed linear optics quantum computing using active feed-forward
• Fault-tolerant quantum computation with cluster states
• Unified derivations of measurement-based schemes for quantum computation
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Quantum cellular automata quantum computing with endohedral fullerenes
• Deterministic generation of large cluster states using non-deterministic collective measurements based on quantum Zeno effect
• Reversible quantum cellular automata
• Efficient one-step generation of large cluster states with solid-state circuits
• High threshold codes for neutral atom qubits with biased erasure errors
• The Optical Frequency Comb as a One-Way Quantum Computer
• Two-dimensional cluster-state preparation with linear ion traps
• Cluster-type entangled coherent states
• Universal fault-tolerant measurement-based quantum computation
• Detecting entanglement with a thermometer
• Lineal: A linear-algebraic Lambda-calculus
• Tensor Networks with a Twist: Anyon-permuting domain walls and defects in PEPS
• Tailoring fusion-based error correction for high thresholds to biased fusion failures
• Tailored cluster states with high threshold under biased noise
• Closed timelike curves in measurement-based quantum computation
• Towards Minimal Resources of Measurement-based Quantum Computation
• Analysis of a continuous-variable quadripartite cluster state from a single optical parametric oscillator
• Sharp complexity phase transitions generated by entanglement
• How much of one-way computation is just thermodynamics?
• Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
• Leveraging Qubit Loss Detection in Fault Tolerant Quantum Algorithms
• Quantum Domain Theory - Definitions and Applications
• Optimal Quantum Circuits for Nearest-Neighbor Architectures
• A complete characterisation of All-versus-Nothing arguments for stabiliser states
• Compact quantum circuits from one-way quantum computation
• Hybrid Exchange Measurement-Based Qubit Operations in Semiconductor Double Quantum Dot Qubits
• Addressable quantum gates
• Separability Lindblad equation for dynamical open-system entanglement
• Quantum Computation by Spin Parity Measurements with Encoded Spin Qubits
• Restricted Monte Carlo wave function method and Lindblad equation for identifying entangling open-quantum-system dynamics
• Efficient optimization of perturbative gadgets
• Quantum Games and Programmable Quantum Systems
• Quantum error correcting codes and one-way quantum computing: Towards a quantum memory
• Pauli Flow on Open Graphs with Unknown Measurement Labels
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays