2009/08/03 by Yuichiro Matsuzaki, Simon C. Benjamin, Simon C Benjamin +2
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Artificial intelligence #Computation #Computer science #Mathematics #Overhead (engineering) #Physics #Probabilistic logic #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum entanglement #Quantum mechanics #Range (aeronautics) #Simple (philosophy) #Statistical physics #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physrevlett.104.050501
5 pages, 3 figures
arxiv created 2009/08/03 · openalex publication_date 2010/02/03 · arxiv updated 2013/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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 a 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. The assumptions that we make, including parallelism and high connectivity, are appropriate for real systems including those based on measurement-induced entanglement. This result therefore indicates the feasibility of such devices.