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

Brazilian Journal of Physics

Temporal resources for global quantum computing architectures

Juan D. Jaramillo, John Henry Reina

Published Dec 1, 2008• 1 citation
Publisher

Abstract

Using the methods for optimal simulation of quantum logic gates, we perform a quantitative estimation of the time resources involved in the execution of universal gate sets for the case of three representative models of quantum computation based on global control. The importance of such models stems from the solution to the problem of experimentally addressing and locally manipulating the qubits in a given quantum register. The numerical estimation of the temporal efficiency for each model is performed by assuming that the qubits in the register can be coupled to each other via the Ising and the Förster interactions. Finally, we discuss the feasibility of the physical realization of such architectures under quantum error correction conditions.

DOI
10.1590/s0103-97332008000500004

Related papers

Costo de Interacción en Arquitecturas para Computación

Juan D. Pineda Jaramillo, John Henry Reina

Using the methods for optimal simulation of quantum logic gates developed in Ref. [1], we perform a numerical estimation of time and spatial resources involved in the execution of one and two qubit gates for the case of three representative models of quantum computation based on global control. The importance of such models stems from the solution to the problem of experimentally addressing and locally manipulating the qubits in a given quantum register. The numerical estimation of the temporal efficiency for each model is performed by assuming that the qubits are coupled to each other via the Ising interaction whose strength is considered to be of the order of 50 MHz (33 neV).

Revista de la Sociedad Colombiana de Física•Jan 1, 2009•0 citations

Scheduling error correction operations for a quantum computer.

Andrew J. Landahl, Robert D. Carr, Cynthia A. Phillips +1 more

In a (future) quantum computer a single logical quantum bit (qubit) will be made of multiple physical qubits. These extra physical qubits implement mandatory extensive error checking. The efficiency of error correction will fundamentally influence the performance of a future quantum computer, both in latency/speed and in error threshold (the worst error tolerated for an individual gate). Executing this quantum error correction requires scheduling the individual operations subject to architectural constraints. Since our last talk on this subject, a team of researchers at Sandia National Labortories has designed a logical qubit architecture that considers all relevant architectural issues including layout, the effects of supporting classical electronics, and the types of gates that the underlying physical qubit implementation supports most naturally. This is a two-dimensional system where 2-qubit operations occur locally, so there is no need to calculate more complex qubit/information transportation. Using integer programming, we found a schedule of qubit operations that obeys the hardware constraints, implements the local-check code in the native gate set, and minimizes qubit idle periods. Even with an optimal schedule, however, parallel Monte Carlo simulation shows that there is no finite error probability for the native gates such that the error-correction system would be benecial.more » However, by adding dynamic decoupling, a series of timed pulses that can reverse some errors, we found that there may be a threshold. Thus finding optimal schedules for increasingly-refined scheduling problems has proven critical for the overall design of the logical qubit system. We describe the evolving scheduling problems and the ideas behind the integer programming-based solution methods. This talk assumes no prior knowledge of quantum computing.« less

•Sep 1, 2010•0 citations

Quantum computation in optical lattices via global laser addressing

Alastair Kay, Jiannis K. Pachos

A scheme for globally addressing a quantum computer is presented along with its realization in an optical lattice set-up of one, two or three dimensions. The required resources are mainly those necessary for performing quantum simulations of spin systems with optical lattices, circumventing the necessity for single qubit addressing. We present the control procedures, in terms of laser manipulations, required to realize universal quantum computation. Error avoidance with the help of the quantum Zeno effect is presented and a scheme for globally addressed error correction is given. The latter does not require measurements during the computation, facilitating its experimental implementation. As an illustrative example, the pulse sequence for the factorization of the number 15 is given.

arXiv:quant-ph/0406073•New Journal of Physics•Oct 1, 2004•37 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

Counting Gates, Moving Qubits: Evaluating the Execution Cost of Quantum Circuits

Rodney Van Meter

Quantum algorithms can be written down in several forms, one of the most common is the quantum circuit representation using discrete gates. The challenge in assessing the computational cost then becomes counting those gates, with realistic costs assigned to each gate. Moreover, interacting pairs of qubits inside most quantum computers will require moving qubits. In many architectures, this will involve cellular automaton-like swapping of qubits. In general, the depth will be described in number of quantum error correction (QEC) cycles, while the total cost will be space-time ``volume'' consisting of the number of qubits involved over that set of QEC cycles. This implies that accurate estimates can be made only in the context of a particular architecture and error correction mechanism.

Proceedings - Asian Test Symposium/Proceedings•Nov 1, 2012•1 citation

Addressable gate-based logical computation with quantum LDPC codes

Laura Pecorari, Francesco Paolo Guerci, Hugo Perrin +1 more

Quantum computing relies on quantum error correction for high-fidelity logical operations, but scaling to achieve near-term quantum utility is highly resource-intensive. High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge. Apart of the lattice surgery approach, standard schemes for realizing logical gates have so far been restricted to performing global operations on all logical qubits at the same time. Another approach relies on low-rate code switching methods. In this work, we introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual logical qubits encoded within one or more quantum LDPC codes. Our scheme leverages logical transversal operations via an auxiliary Bacon-Shor code to perform logical operations with constant time overhead enabled by teleportation. We demonstrate the implementation of an overcomplete logical Clifford gate set and perform numerical simulations to evaluate the error-correction performance of our protocol. Finally, we observe that our scheme can be integrated with magic state cultivation protocols to achieve universal, gate-based, and fully addressable quantum computation.

quant-pharXiv:2511.06124•Nov 11, 2025•0 citations
Using the methods for optimal simulation of quantum logic gates, we perform a quantitative estimation of the time resources involved in the execution of universal gate sets for the case of three representative models of quantum computation based on global control. The importance of such models stems from the solution to the problem of experimentally addressing and locally manipulating the qubits in a given quantum register. The numerical estimation of the temporal efficiency for each model is performed by assuming that the qubits in the register can be coupled to each other via the Ising and the Förster interactions. Finally, we discuss the feasibility of the physical realization of such architectures under quantum error correction conditions.
Using the methods for optimal simulation of quantum logic gates developed in Ref. [1], we perform a numerical estimation of time and spatial resources involved in the execution of one and two qubit gates for the case of three representative models of quantum computation based on global control. The importance of such models stems from the solution to the problem of experimentally addressing and locally manipulating the qubits in a given quantum register. The numerical estimation of the temporal efficiency for each model is performed by assuming that the qubits are coupled to each other via the Ising interaction whose strength is considered to be of the order of 50 MHz (33 neV).
In a (future) quantum computer a single logical quantum bit (qubit) will be made of multiple physical qubits. These extra physical qubits implement mandatory extensive error checking. The efficiency of error correction will fundamentally influence the performance of a future quantum computer, both in latency/speed and in error threshold (the worst error tolerated for an individual gate). Executing this quantum error correction requires scheduling the individual operations subject to architectural constraints. Since our last talk on this subject, a team of researchers at Sandia National Labortories has designed a logical qubit architecture that considers all relevant architectural issues including layout, the effects of supporting classical electronics, and the types of gates that the underlying physical qubit implementation supports most naturally. This is a two-dimensional system where 2-qubit operations occur locally, so there is no need to calculate more complex qubit/information transportation. Using integer programming, we found a schedule of qubit operations that obeys the hardware constraints, implements the local-check code in the native gate set, and minimizes qubit idle periods. Even with an optimal schedule, however, parallel Monte Carlo simulation shows that there is no finite error probability for the native gates such that the error-correction system would be benecial.more » However, by adding dynamic decoupling, a series of timed pulses that can reverse some errors, we found that there may be a threshold. Thus finding optimal schedules for increasingly-refined scheduling problems has proven critical for the overall design of the logical qubit system. We describe the evolving scheduling problems and the ideas behind the integer programming-based solution methods. This talk assumes no prior knowledge of quantum computing.« less
A scheme for globally addressing a quantum computer is presented along with its realization in an optical lattice set-up of one, two or three dimensions. The required resources are mainly those necessary for performing quantum simulations of spin systems with optical lattices, circumventing the necessity for single qubit addressing. We present the control procedures, in terms of laser manipulations, required to realize universal quantum computation. Error avoidance with the help of the quantum Zeno effect is presented and a scheme for globally addressed error correction is given. The latter does not require measurements during the computation, facilitating its experimental implementation. As an illustrative example, the pulse sequence for the factorization of the number 15 is given.
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.
Quantum algorithms can be written down in several forms, one of the most common is the quantum circuit representation using discrete gates. The challenge in assessing the computational cost then becomes counting those gates, with realistic costs assigned to each gate. Moreover, interacting pairs of qubits inside most quantum computers will require moving qubits. In many architectures, this will involve cellular automaton-like swapping of qubits. In general, the depth will be described in number of quantum error correction (QEC) cycles, while the total cost will be space-time ``volume'' consisting of the number of qubits involved over that set of QEC cycles. This implies that accurate estimates can be made only in the context of a particular architecture and error correction mechanism.
Quantum computing relies on quantum error correction for high-fidelity logical operations, but scaling to achieve near-term quantum utility is highly resource-intensive. High-rate quantum LDPC codes can reduce error correction overhead, yet realizing high-rate fault-tolerant computation with these codes remains a central challenge. Apart of the lattice surgery approach, standard schemes for realizing logical gates have so far been restricted to performing global operations on all logical qubits at the same time. Another approach relies on low-rate code switching methods. In this work, we introduce a gate-based protocol for addressable single- and multi-qubit Clifford operations on individual logical qubits encoded within one or more quantum LDPC codes. Our scheme leverages logical transversal operations via an auxiliary Bacon-Shor code to perform logical operations with constant time overhead enabled by teleportation. We demonstrate the implementation of an overcomplete logical Clifford gate set and perform numerical simulations to evaluate the error-correction performance of our protocol. Finally, we observe that our scheme can be integrated with magic state cultivation protocols to achieve universal, gate-based, and fully addressable quantum computation.