An introduction to one-way quantum computing in distributed architectures
arXiv:0906.2725 · doi:10.1142/S0219749910006198
Abstract
This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures which rely on probabilistic entangling operations. We review the theoretical underpinnings of one-way quantum computation and discuss the practical issues related to exploiting the one-way model in distributed architectures.
arXiv commentRevised in light of review comments made on quantalk
References in corpus (59)
- Fault-tolerant quantum computation by anyons
- The Quantum Internet
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- Improved Simulation of Stabilizer Circuits
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Multi-party entanglement in graph states
- A Theory of Fault-Tolerant Quantum Computation
- Observation of Strong Coupling between One Atom and a Monolithic Microresonator
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Optical quantum computation using cluster states
- Creation of entangled states of distant atoms by interference
- Measurement-Induced Entanglement for Excitation Stored in Remote Atomic Ensembles
- Quantum Teleportation Between Distant Matter Qubits
- On Bell measurements for teleportation
- Proposal for teleportation of an atomic state via cavity decay
- Probabilistic Quantum Logic Operations Using Polarizing Beam Splitters
- Efficient engineering of multi-atom entanglement through single-photon detections
- A fault-tolerant one-way quantum computer
- Cluster-state quantum computation
- Methodology for quantum logic gate constructions
- Distributed Quantum Computation Based-on Small Quantum Registers
- Graphical description of the action of local Clifford transformations on graph states
- Quantum interference between two single photons emitted by independently trapped atoms
- Weak nonlinearities: A new route to optical quantum computation
- Fault-tolerant quantum repeaters with minimal physical resources, and implementations based on single photon emitters
- Quantum Interference of Photon Pairs from Two Trapped Atomic Ions
- Repeat-Until-Success Quantum Computing
- Entanglement Percolation in Quantum Networks
- Methods for Reliable Teleportation
- Universal resources for measurement-based quantum computation
- Robust creation of entanglement between ions in spatially separate cavities
- Efficient quantum computation with probabilistic quantum gates
- Fast simulation of stabilizer circuits using a graph state representation
- Fault-tolerant quantum computation with cluster states
- Deterministic linear optics quantum computation utilizing linked photon circuits
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Multiparticle entanglement purification for two-colorable graph states
- Three-dimensional theory for interaction between atomic ensembles and free-space light
- Brokered Graph State Quantum Computing
- Entanglement purification for Quantum Computation
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Globally controlled quantum wires for perfect qubit transport, mirroring and computing
- Local Fault-tolerant Quantum Computation
- Fundamentals of universality in one-way quantum computation
- Measurement based entanglement under conditions of extreme photon loss
- Quantum Computing with Globally Controlled Exchange-type Interactions
- Probabilistic Quantum Gates between Remote Atoms through Interference of Optical Frequency Qubits
- An efficient algorithm to recognize local Clifford equivalence of graph states
- Simple proof of fault tolerance in the graph-state model
- Optical generation of matter qubit graph states
- Phase transition of computational power in the resource states for one-way quantum computation
- Scalable Error Correction in Distributed Ion Trap Computers
- Distributed quantum information processing with minimal local resources
- Quantum Information Processing with Delocalized Qubits under Global Control
- Efficient Graph State Construction Under the Barrett and Kok Scheme
- Purification of large bicolorable graph states
- Error tolerance and tradeoffs in loss- and failure-tolerant quantum computing schemes
- Global Optical Control of a Quantum Spin Chain