Probabilistic growth of large entangled states with low error accumulation

Abstract

The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe overhead in terms of the accumulation of errors. Here we describe an method that can rapidly generate large entangled states with an error accumulation that depends only logarithmically on the failure probability. We find that the approach may be practical for success rates in the sub-10% range, while ultimately becoming unfeasible at lower rates. The assumptions that we make, including parallelism and high connectivity, are appropriate for real systems including measurement-induced entanglement. This result therefore shows the feasibility for real devices based on such an approach.

5 pages, 3 figures

References in corpus (10)

• Multi-party entanglement in graph states
• Bell inequality violation with two remote atomic qubits
• Robust creation of entanglement between ions in spatially separate cavities
• Brokered Graph State Quantum Computing
• Prospects for measurement-based quantum computing with solid state spins
• Scalable Generation of Graph-State Entanglement through Realistic Linear Optics
• Potential and limits to cluster state quantum computing using probabilistic gates
• Phase transition of computational power in the resource states for one-way quantum computation
• Purification of large bicolorable graph states
• Strategies for the preparation of large cluster states using non-deterministic gates

Cited by in corpus (21)

• A quantum network stack and protocols for reliable entanglement-based networks
• Resource costs for fault-tolerant linear optical quantum computing
• Modular architectures for quantum networks
• Distributing Graph States Over Arbitrary Quantum Networks
• Fully fault tolerant quantum computation with non-deterministic gates
• Optimized Quantum Networks
• Growth of graph states in quantum networks
• Distributing Graph States Across Quantum Networks
• Statistical analysis of quantum entangled network generation
• Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
• Long range failure-tolerant entanglement distribution
• Influence of noise in entanglement-based quantum networks
• Fast graph operations in quantum computation
• Layer by layer generation of cluster states
• Entangling homogeneously broadened matter qubits in the weak-coupling cavity-QED regime
• Imperfect quantum networks with tailored resource states
• Distributed quantum computation with arbitrarily poor photon detection
• Cluster state generation with ageing qubits
• Quantum entanglement distribution using a magnetic field sensor
• Entangling unstable optically active matter qubits
• Entanglement generation between unstable optically active qubits without photodetectors