2011/03/31 by Augusto J. Roncaglia, Leandro Aolita, Alessandro Ferraro +2 · 10 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Coherence (philosophical gambling strategy) #Computation #Computer science #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum mechanics #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.83.062332
published in Physical Review A 83(6) (American Physical Society) · 6 pages, 4 figures
arxiv created 2011/05/23 · openalex publication_date 2011/06/24 · arxiv updated 2015/05/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the cluster state needed for the computation and its consumption by measurements are carried out simultaneously. As a consequence, effective clusters of one spatial dimension fewer than in the standard approach are sufficient for computation. In particular, universal computation requires only a one-dimensional array of memories. The scheme applies to discrete-variable systems of any dimension as well as to continuous-variable ones, and both are treated equivalently under the light of local complementation of graphs. In this way our formalism introduces a general framework that encompasses and generalizes in a unified manner some previous system-dependent proposals. The procedure is intrinsically well suited for implementations with atom-photon interfaces.