Distributed quantum information processing with minimal local resources

Abstract

We present a protocol for growing graph states, the resource for one-way quantum computing, when the available entanglement mechanism is highly imperfect. The distillation protocol is frugal in its use of ancilla qubits, requiring only a single ancilla qubit when the noise is dominated by one Pauli error, and two for a general noise model. The protocol works with such scarce local resources by never post-selecting on the measurement outcomes of purification rounds. We find that such a strategy causes fidelity to follow a biased random walk, and that a target fidelity is likely to be reached more rapidly than for a comparable post-selecting protocol. An analysis is presented of how imperfect local operations limit the attainable fidelity. For example, a single Pauli error rate of 20% can be distilled down to $\sim 10$ times the imperfection in local operations.

4 pages of main paper with an additional 1 page appendix, 5 figures. Please contact me with any comments

References in corpus (22)

• Mixed State Entanglement and Quantum Error Correction
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Quantum repeaters based on entanglement purification
• Topological fault-tolerance in cluster state quantum computation
• Efficient high-fidelity quantum computation using matter qubits and linear optics
• Creation of entangled states of distant atoms by interference
• Room temperature coherent control of coupled single spins in solid
• Proposal for teleportation of an atomic state via cavity decay
• Efficient engineering of multi-atom entanglement through single-photon detections
• Repeat-Until-Success Quantum Computing
• Multi-Particle Entanglement Purification Protocols
• Multiparticle entanglement purification for graph states
• Multiparticle entanglement purification for two-colorable graph states
• Brokered Graph State Quantum Computing
• Noise thresholds for optical quantum computers
• Entanglement purification for Quantum Computation
• Entanglement purification protocols for all graph states
• Scalable Error Correction in Distributed Ion Trap Computers
• Purification of large bicolorable graph states
• Efficient Graph State Construction Under the Barrett and Kok Scheme

Cited by in corpus (25)

• Distributed Quantum Computation Based-on Small Quantum Registers
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Entanglement in a Solid State Spin Ensemble
• Coherence and control of quantum registers based on electronic spin in a nuclear spin bath
• Coherent state transfer via highly mixed quantum spin chains
• Minimally complex ion traps as modules for quantum communication and computing
• Non-asymptotic entanglement distillation
• High threshold distributed quantum computing with three-qubit nodes
• Growth of graph states in quantum networks
• Continuous-variable entanglement distillation and non-commutative central limit theorems
• Distributing Graph States Across Quantum Networks
• Rydberg atom mediated polar molecule interactions: a tool for molecular-state conditional quantum gates and individual addressability
• Entanglement and Quantum Error Correction with Superconducting Qubits
• Quantum LDPC Codes for Modular Architectures
• Hierarchical surface code for network quantum computing with modules of arbitrary size
• Hybrid quantum magnetic field sensor with an electron spin and a nuclear spin in diamond
• Initialization and Readout of Spin Chains for Quantum Information Transport
• Long-range-enhanced surface codes
• Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
• An introduction to one-way quantum computing in distributed architectures
• Scalable Quantum Networks based on Few-Qubit Registers
• Cluster state generation with ageing qubits
• How to exploit local information when distilling entanglement
• Loss-tolerant parity measurement for distant quantum bits
• Network Requirements for Distributed Quantum Computation