Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1008.1634

Fault tolerant Quantum Information Processing with Holographic control

Gerardo A. Paz-Silva, Gavin K. Brennen, Jason Twamley

Published Aug 10, 2010• 1 citation
arXivHTMLPDF

Abstract

We present a fault-tolerant semi-global control strategy for universal quantum computers. We show that N-dimensional array of qubits where only (N-1)-dimensional addressing resolution is available is compatible with fault-tolerant universal quantum computation. What is more, we show that measurements and individual control of qubits are required only at the boundaries of the fault-tolerant computer, i.e. holographic fault-tolerant quantum computation. Our model alleviates the heavy physical conditions on current qubit candidates imposed by addressability requirements and represents an option to improve their scalability.

DOI
10.48550/arxiv.1008.1634

Related papers

Bulk fault-tolerant quantum information processing with boundary addressability

Gerardo A. Paz-Silva, Gavin K. Brennen, Jason Twamley

We present a fault-tolerant (FT) semi-global control strategy for universal quantum computers. We show that an N -dimensional array of qubits where only ( N −1)-dimensional addressing resolution is available is compatible with FT universal quantum computation. What is more, we show that measurements and individual control of qubits are required only at the boundaries of the FT computer. Our model alleviates the heavy physical conditions on current qubit candidates imposed by addressability requirements and represents an option for improving their scalability.

New Journal of Physics•Jan 11, 2011•5 citations

Quantum Fault Tolerance in Systems with Restricted Control

Joseph F. Fitzsimons, Jason Twamley

In many proposed architectures for quantum computing the physics of the system prevent qubits from being individually controlled. In such systems universal computation may be possible via bulk manipulation of the system. Here, we describe a method to execute globally controlled quantum information processing which admits a fault tolerant quantum error correction scheme. Our scheme nominally uses three species of addressable two-level systems which are arranged in a one dimensional array in a specific periodic arrangement. We show that the scheme possesses a fault tolerant error threshold.

Electronic Notes in Theoretical Computer Science•Dec 1, 2009•6 citations

Holographic Quantum Computing: A Scalable and Error-Resilient Paradigm

Logan Nye

This work introduces holographic quantum computing, a novel paradigm that leverages the holographic principle and the AdS/CFT correspondence to address key challenges in quantum information processing, such as scalability and error correction. By encoding quantum information holographically on the boundary of a higher-dimensional space, we propose a framework that offers significant improvements in scalability and error resilience compared to traditional qubit-based approaches. Our comprehensive theoretical model for holographic quantum computing includes the construction of holographic quantum error-correcting codes that exhibit intrinsic error-correcting properties and lower overhead for fault tolerance. We present novel algorithms that exploit the geometric encoding of information, such as quantum walks on curved spaces and path-finding in hyperbolic graphs, demonstrating potential speedups and resource efficiency. Furthermore, we explore the implementation of standard quantum algorithms, like the Quantum Fourier Transform (QFT), within the holographic framework. The paper also details physical implementation strategies using analog quantum simulators, superconducting qubit arrays, and hybrid classical-quantum systems, highlighting practical pathways to realizing holographic quantum computers. Our results suggest that holographic quantum computing not only enhances the capabilities of quantum computation but also provides deep insights into the fundamental connections between quantum information, spacetime, and gravity. This interdisciplinary approach opens new frontiers in quantum computing and fundamental physics, offering potential breakthroughs in post-quantum cryptography, quantum simulations, and accelerated scientific discovery.

•Jul 23, 2024•0 citations

Globally controlled fault tolerant quantum computation

Joe Fitzsimons, Jason Twamley

We describe a method to execute globally controlled quantum information processing which admits a fault tolerant quantum error correction scheme. Our scheme nominally uses three species of addressable two-level systems which are arranged in a one dimensional array in a specific periodic arrangement. We show that the scheme possesses a fault tolerant error threshold.

arXiv:0707.1119•Jul 8, 2007•3 citations

Quantum error correction in globally controlled arrays

Adel Bririd, Simon C. Benjamin, Alastair Kay

An interesting concept in quantum computation is that of global control (GC), where there is no need to manipulate qubits individually. One can implement a universal set of quantum gates on a one-dimensional array purely via signals that target the entire structure indiscriminately. But large-scale quantum computation imposes several requirements in terms of noise level, time, space (scaling) and in particular parallelism. Keeping in mind these requirements, we prove GC can support error-correction, by implementing two simple codes. This opens the way to fault-tolerant computation with this type of architecture.

arXiv:quant-ph/0308113•Aug 21, 2003•7 citations

Quantum error correction with global control

Roberto Menta, Lindsay Bassman Oftelie, Ashkan Abedi +5 more

Reaching fault tolerance means scaling qubit counts by orders of magnitude, a jump that conventional superconducting architectures cannot sustain without solving the so-called `wiring problem'. Global control sidesteps this bottleneck, but implementing quantum error correction (QEC) on previously proposed global architectures incurs extremely steep overhead costs, due to the need for separate correction procedures for the computational and auxiliary qubits that comprise the global device. We resolve this by introducing the first globally-controlled architecture with zero qubit overhead. Every physical qubit is a computational qubit, and thus, every qubit is protected under a single error correcting scheme. We identify a class of cyclic stabilizer codes realizable through global iSWAP and single-qubit gates, yielding QEC thresholds nearly seven orders of magnitude larger than previous estimates for globally-controlled arrays. We further show these thresholds improve systematically as the global architecture is augmented with a limited amount of local measurement sites, demonstrating a trade-off between wiring simplicity and fault-tolerant performance.

quant-pharXiv:2608.05821•Aug 7, 2026•0 citations
We present a fault-tolerant semi-global control strategy for universal quantum computers. We show that N-dimensional array of qubits where only (N-1)-dimensional addressing resolution is available is compatible with fault-tolerant universal quantum computation. What is more, we show that measurements and individual control of qubits are required only at the boundaries of the fault-tolerant computer, i.e. holographic fault-tolerant quantum computation. Our model alleviates the heavy physical conditions on current qubit candidates imposed by addressability requirements and represents an option to improve their scalability.
We present a fault-tolerant (FT) semi-global control strategy for universal quantum computers. We show that an N -dimensional array of qubits where only ( N −1)-dimensional addressing resolution is available is compatible with FT universal quantum computation. What is more, we show that measurements and individual control of qubits are required only at the boundaries of the FT computer. Our model alleviates the heavy physical conditions on current qubit candidates imposed by addressability requirements and represents an option for improving their scalability.
In many proposed architectures for quantum computing the physics of the system prevent qubits from being individually controlled. In such systems universal computation may be possible via bulk manipulation of the system. Here, we describe a method to execute globally controlled quantum information processing which admits a fault tolerant quantum error correction scheme. Our scheme nominally uses three species of addressable two-level systems which are arranged in a one dimensional array in a specific periodic arrangement. We show that the scheme possesses a fault tolerant error threshold.
This work introduces holographic quantum computing, a novel paradigm that leverages the holographic principle and the AdS/CFT correspondence to address key challenges in quantum information processing, such as scalability and error correction. By encoding quantum information holographically on the boundary of a higher-dimensional space, we propose a framework that offers significant improvements in scalability and error resilience compared to traditional qubit-based approaches. Our comprehensive theoretical model for holographic quantum computing includes the construction of holographic quantum error-correcting codes that exhibit intrinsic error-correcting properties and lower overhead for fault tolerance. We present novel algorithms that exploit the geometric encoding of information, such as quantum walks on curved spaces and path-finding in hyperbolic graphs, demonstrating potential speedups and resource efficiency. Furthermore, we explore the implementation of standard quantum algorithms, like the Quantum Fourier Transform (QFT), within the holographic framework. The paper also details physical implementation strategies using analog quantum simulators, superconducting qubit arrays, and hybrid classical-quantum systems, highlighting practical pathways to realizing holographic quantum computers. Our results suggest that holographic quantum computing not only enhances the capabilities of quantum computation but also provides deep insights into the fundamental connections between quantum information, spacetime, and gravity. This interdisciplinary approach opens new frontiers in quantum computing and fundamental physics, offering potential breakthroughs in post-quantum cryptography, quantum simulations, and accelerated scientific discovery.
An interesting concept in quantum computation is that of global control (GC), where there is no need to manipulate qubits individually. One can implement a universal set of quantum gates on a one-dimensional array purely via signals that target the entire structure indiscriminately. But large-scale quantum computation imposes several requirements in terms of noise level, time, space (scaling) and in particular parallelism. Keeping in mind these requirements, we prove GC can support error-correction, by implementing two simple codes. This opens the way to fault-tolerant computation with this type of architecture.
Reaching fault tolerance means scaling qubit counts by orders of magnitude, a jump that conventional superconducting architectures cannot sustain without solving the so-called `wiring problem'. Global control sidesteps this bottleneck, but implementing quantum error correction (QEC) on previously proposed global architectures incurs extremely steep overhead costs, due to the need for separate correction procedures for the computational and auxiliary qubits that comprise the global device. We resolve this by introducing the first globally-controlled architecture with zero qubit overhead. Every physical qubit is a computational qubit, and thus, every qubit is protected under a single error correcting scheme. We identify a class of cyclic stabilizer codes realizable through global iSWAP and single-qubit gates, yielding QEC thresholds nearly seven orders of magnitude larger than previous estimates for globally-controlled arrays. We further show these thresholds improve systematically as the global architecture is augmented with a limited amount of local measurement sites, demonstrating a trade-off between wiring simplicity and fault-tolerant performance.