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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Qubit-qubit interaction in quantum computers: errors and scaling laws

Julio R. Gea-Banacloche

Published Jul 6, 1998• 1 citation
Publisher

Abstract

This paper explores the limitations that interaction between the physical qubits making up a quantum computer may impose on the computer's performance. For computers using atoms as qubits, magnetic dipole-dipole interactions are likely to be dominant; various types of errors which they might introduce are considered here. The strength of the interaction may be reduce by increasing the distance between qubits, which in general will make the computer slower. For ion-chain based quantum computers the slowing down due to this effect is found to be generally more sever than that due to other causes. In particular, this effect alone would be enough to make these systems unacceptably slow for large-scale computation, whether they use the center of mass motion as the 'bus' or whether they do this via an optical cavity mode.

DOI
10.1117/12.312633

Related papers

Qubit-qubit interaction in quantum computers

Julio R. Gea-Banacloche

Limitations to the performance of a quantum computer arising from direct interaction between qubits are considered, and the basic scaling laws (with the computation time and the number of qubits) are established for the specific example of the quantum Fourier transform algorithm. These results should be relevant for several of the currently proposed quantum computer systems, where the dominant interaction is of the magnetic dipole-dipole type, in the limit of many qubits and long computation times.

Physical Review A•Jan 1, 1998•25 citations

Qubit-qubit interaction in quantum computers. II. Adder algorithm with diagonal and off-diagonal interactions

Julio R. Gea-Banacloche

The effect of off-diagonal interactions between quantum bits is studied in a simple quantum computer algorithm designed to calculate the sum of two n-bit numbers. Scaling laws are derived numerically for the dependence of the error on the number n of bits, the strength of the interaction, and the calculation time. The case of diagonal interactions, previously studied in the context of the quantum Fourier transform algorithm, is also considered. No substantial differences are found between the off-diagonal and diagonal forms of the interaction: in both cases, the errors accumulate almost coherently, despite the fact that the system's free evolution is constantly being interrupted by the logical gates, which scramble the coefficients of the wave function. Some comments on the possibility of using ``field-insensitive'' atomic states in ion-chain quantum computers are also given.

Physical Review A•Jul 1, 1999•9 citations

Creation of entanglement in a scalable spin quantum computer with long-range dipole-dipole interaction between qubits

D. I. Kamenev, G. P. Berman, V. I. Tsifrinovich

Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal choice of the parameters of radio-frequency pulses implementing the protocol. The errors caused by (i) the influence of the environment, (ii) nonselective excitations, (iii) influence of different spin chains on each other, (iv) displacements of qubits from their perfect locations, and (v) fluctuations of the external magnetic field are estimated analytically and calculated numerically. For the perfectly entangled state the $z$ component $M$ of the magnetization of the whole system is equal to zero. The errors lead to a finite value of $M$. If the number of qubits in the system is large, $M$ can be detected experimentally. Using the fact that $M$ depends differently on the parameters of the system for each kind of error, varying these parameters would allow one to experimentally determine the most significant source of errors and to optimize correspondingly the quantum computer design in order to decrease the errors and $\ensuremath{\mid}M\ensuremath{\mid}$. Using our approach one can benchmark the quantum computer, decrease the errors, and prepare the quantum computer for implementation of more complex quantum algorithms.

arXiv:quant-ph/0603227•Physical Review A•Jun 29, 2006•5 citations

Physical Interaction Distance as a Fundamental Limit on Qubit Scaling in 2D Quantum Architectures

B.Y. Hughes Graduate Student

This work presents a simple but physically grounded model that establishes an upper bound on the number of qubits that can be effectively coupled within a two‑dimensional quantum computing architecture. While most discussions of scalability focus on gate fidelities, coherence times, or error‑correction thresholds, this study highlights a more fundamental constraint: the finite interaction distance between physical qubits. Assuming (i) a finite effective interaction range, (ii) a realistic physical footprint for each qubit including control structures, and (iii) a strictly two‑dimensional layout, the analysis shows that the maximum number of mutually interacting qubits is limited to approximately 10^2 – 10^3 . This estimate is consistent with experimental observations across multiple platforms, including superconducting qubits, semiconductor spin qubits, quantum dots, ion traps, and photonic systems. The purpose of this work is not to claim an absolute limit, but to provide a baseline, architecture‑independent reference for understanding the physical constraints that govern quantum processor scaling. By making the assumptions explicit, the model clarifies which aspects of current architectures must be changed—such as dimensionality, coupling mechanisms, or modularity—to enable scaling beyond present limits. This document may serve as a conceptual reference for researchers, engineers, and students seeking to understand the physical foundations of quantum computing scalability.

•Jan 9, 2026•0 citations

Quantum computing with neutral atoms

Mark E. Saffman

The power of quantum computation derives from algorithmic methods that exploit the availability of quantum superposition and entanglement to perform computations that are intractable with classical devices. The race is on to develop hardware that will unleash the promise of quantum algorithms. A handful of different types of hardware are currently being developed with the greatest efforts directed at superconducting, quantum-dot, trapped-ion, photonic, and neutral-atom approaches [1]. While all approaches have strengths and weaknesses, and are at different stages of development, the challenge of creating a practical design that can be scaled to a million or more qubits has not yet been met with any of the existing platforms. One may wonder if we really need a million qubits for a useful quantum computer. The answer depends on our ambition level. On the one hand it is widely believed that a quantum computer with less than 100 reliable qubits will be able to demonstrate a quantum advantage for a well defined computational problem [2]. Demonstration of a quantum computational advantage will generate great excitement in the halls of academia, but will have little broader import. A problem of great practical interest such as ab initio design of chemicals for increasing the yield of fertilizers for crop production, to name but one example, may also require just a few hundred qubits, provided computational sequences with circuit depth of 1010 or more operations can be reliably performed [3]. However, given the current performance of qubit hardware, which has demonstrated error rates not less than ∼10−3, computations with depth 1010 will only produce random outcomes of negligible value. The solution lies in the construction of error-correction circuitry operating on logical qubits, each composed of many physical qubits, which will enable logical error rates many orders of magnitude smaller than physical error rates. Although error correction is remarkably efficient for classical computing devices—Hamming codes detect and correct errors while only requiring roughly 10% overhead in the number of physical bits—quantum error correction is notoriously expensive. New approaches to error correction are the subject of intensive research with one promising direction being the development of codes that are optimized to suppress the dominant error mechanism in a particular physical platform [4,5]. Nevertheless, with physical error rates of 10−4, a plausible target for current qubit systems, the overhead required to reach logical error rates of 10−10 may be measured in thousands of physical qubits for each logical qubit. Thus a quantum computer able to perform deep calculations on a few hundred logical qubits could require a million physical qubits. A consequence of the cost of quantum error correction is that any viable approach to large-scale quantum computing needs to combine high-fidelity quantum logic operations with a capability for integrating large numbers of physical qubits. From this perspective neutral-atom qubits appear particularly promising [6] as they have already demonstrated control of more qubits than any other platform with recent experiments in 1D [7], 2D [8,9], and 3D [10] geometries showing control of up to 50 atomic qubits. Large qubit arrays can potentially be prepared in 1D, 2D, or 3D geometries. The number of proximal qubits increases with the dimensionality, which is advantageous for implementation of error correction code words, and points towards a preference for 2D or 3D arrays. On the other hand, the added overhead of compensating crosstalk incurred when targeting atoms inside a 3D volume makes parallel operations on multiple qubits challenging. A 2D geometry, as shown schematically in Fig. 1, may be an optimal choice since qubit control and measurement can be performed with lasers propagating normal to the plane of the array so that individual qubit sites can be addressed independently. With demonstrated array periods of a few micrometers we require a footprint of less than 1 mm2 for 104 qubits. Conceptual picture of a 2D neutral-atom qubit array. a) High-numerical-aperture lenses project several different wavelengths of light for control and measurement of the qubits. Specific choices of optical wavelengths depend on the atomic species. Not shown are optics for initial laser cooling, transport to the array, beam scanning, and imaging for qubit measurement. b) Averaged fluorescence image of 49 atomic qubits on a 2D grid with |$3.8 \, {\mu} \rm {m}$| spacing [8]. From a fundamental perspective the prospects for scaling neutral-atom systems are particularly promising due to the exceptionally large ratio between coherent and incoherent coupling rates. Neutral-atom qubits are encoded in hyperfine ground states for which coherence times of the order of 10 s have been demonstrated [10]. This implies a dephasing rate |$\gamma \sim 0.1 \, \rm s^{-1}$|⁠. The coherent coupling that enables quantum logic operations is switched on by exciting atoms to high-lying Rydberg states with principal quantum number close to 100 [11,12]. Rydberg excited atoms at spacings of a few micrometers in an optical lattice interact coherently with rates |$g > 10^9\, \rm s^{-1}$|⁠. The ratio between desired coherent coupling and residual incoherent dephasing of g/γ ∼ 1010 establishes a figure of merit that is enabling for scalability. To our knowledge only trapped ions can claim a similar g/γ ratio [13], but without a correspondingly direct path towards controlling thousands of qubits in a single processing unit. Although the g/γ ratio is exceptionally favorable for neutral-atom qubits a complete set of universal gate operations has not yet been demonstrated with high fidelity. Single-qubit gates in large 2D and 3D arrays have reached fidelity |${\mathcal {F}}\sim 0.999$| [8,10]. However, the highest demonstrated fidelity for two-qubit entanglement mediated by Rydberg-state interactions is |${\mathcal {F}}< 0.8$| [6,14,15], a value that is well short of the theoretical limit of |${\mathcal {F}}> 0.9999$| [16,17]. There is healthy optimism within the research community working with neutral-atom qubits that combining improved laser sources with reduced noise, better cooling to reduce motional dephasing, and control of stray electric fields that perturb Rydberg atoms will lead to substantially improved gate fidelity in the near future. Recent results with better filtering of laser phase noise have already demonstrated remarkable improvement in ground–Rydberg entanglement [18]. The outlook for the next few years appears very promising. We anticipate that with advances in lasers, optical lattices for atom trapping, deterministic rearrangement and loading of atoms in multi-dimensional arrays [19,20], and optics for fast beam scanning it will be possible to increase the number of physical qubits in a single neutral-atom module to at least 104. A challenging yet plausible path to a million-qubit processor can then be contemplated by connecting 100 such modules with atom–photon entanglement channels [21]. Beyond the potential for advancing the state of the art in computation, development of techniques for single-atom control inside large multi-atom arrays will enable other applications of quantum science including metrology and time-keeping. Rydberg interactions that are at the heart of a neutral-atom quantum computer may lead to multi-atom entanglement and Heisenberg scaling of atomic-clock precision [22]. This work was supported by the NSF and ARL CDQI.

National Science Review•Sep 9, 2018•79 citations

Ion-chain sympathetic cooling and gate dynamics

Aditya Paul, Crystal Noel

Sympathetic cooling is a technique often employed to mitigate motional heating in trapped-ion quantum computers. However, choosing system parameters such as number of coolants and cooling duty cycle for optimal gate performance requires evaluating trade-offs between motional errors and other slower errors such as qubit dephasing. The optimal parameters depend on cooling power, heating rate, and ion spacing in a particular system. In this study, we aim to analyze best practices for sympathetic cooling of long chains of trapped ions using analytical and computational methods. We use a case study to show that optimal cooling performance is achieved when coolants are placed at the center of the chain and provide a perturbative upper bound on the cooling limit of a mode given a particular set of cooling parameters. In addition, using computational tools, we analyze the trade-off between the number of coolant ions in a chain and the center-of-mass mode heating rate. We also show that cooling as often as possible when running a circuit is optimal when the qubit coherence time is otherwise long. These results provide a roadmap for how to choose sympathetic cooling parameters to maximize circuit performance in trapped-ion quantum computers using long chains of ions. Published by the American Physical Society 2024

arXiv:2405.13851•Physical Review Applied•Oct 15, 2024•6 citations
This paper explores the limitations that interaction between the physical qubits making up a quantum computer may impose on the computer's performance. For computers using atoms as qubits, magnetic dipole-dipole interactions are likely to be dominant; various types of errors which they might introduce are considered here. The strength of the interaction may be reduce by increasing the distance between qubits, which in general will make the computer slower. For ion-chain based quantum computers the slowing down due to this effect is found to be generally more sever than that due to other causes. In particular, this effect alone would be enough to make these systems unacceptably slow for large-scale computation, whether they use the center of mass motion as the 'bus' or whether they do this via an optical cavity mode.
Limitations to the performance of a quantum computer arising from direct interaction between qubits are considered, and the basic scaling laws (with the computation time and the number of qubits) are established for the specific example of the quantum Fourier transform algorithm. These results should be relevant for several of the currently proposed quantum computer systems, where the dominant interaction is of the magnetic dipole-dipole type, in the limit of many qubits and long computation times.
The effect of off-diagonal interactions between quantum bits is studied in a simple quantum computer algorithm designed to calculate the sum of two n-bit numbers. Scaling laws are derived numerically for the dependence of the error on the number n of bits, the strength of the interaction, and the calculation time. The case of diagonal interactions, previously studied in the context of the quantum Fourier transform algorithm, is also considered. No substantial differences are found between the off-diagonal and diagonal forms of the interaction: in both cases, the errors accumulate almost coherently, despite the fact that the system's free evolution is constantly being interrupted by the logical gates, which scramble the coefficients of the wave function. Some comments on the possibility of using ``field-insensitive'' atomic states in ion-chain quantum computers are also given.
Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal choice of the parameters of radio-frequency pulses implementing the protocol. The errors caused by (i) the influence of the environment, (ii) nonselective excitations, (iii) influence of different spin chains on each other, (iv) displacements of qubits from their perfect locations, and (v) fluctuations of the external magnetic field are estimated analytically and calculated numerically. For the perfectly entangled state the zzz component MMM of the magnetization of the whole system is equal to zero. The errors lead to a finite value of MMM. If the number of qubits in the system is large, MMM can be detected experimentally. Using the fact that MMM depends differently on the parameters of the system for each kind of error, varying these parameters would allow one to experimentally determine the most significant source of errors and to optimize correspondingly the quantum computer design in order to decrease the errors and $\ensuremath{\mid}M\ensuremath{\mid}$. Using our approach one can benchmark the quantum computer, decrease the errors, and prepare the quantum computer for implementation of more complex quantum algorithms.
This work presents a simple but physically grounded model that establishes an upper bound on the number of qubits that can be effectively coupled within a two‑dimensional quantum computing architecture. While most discussions of scalability focus on gate fidelities, coherence times, or error‑correction thresholds, this study highlights a more fundamental constraint: the finite interaction distance between physical qubits. Assuming (i) a finite effective interaction range, (ii) a realistic physical footprint for each qubit including control structures, and (iii) a strictly two‑dimensional layout, the analysis shows that the maximum number of mutually interacting qubits is limited to approximately 10^2 – 10^3 . This estimate is consistent with experimental observations across multiple platforms, including superconducting qubits, semiconductor spin qubits, quantum dots, ion traps, and photonic systems. The purpose of this work is not to claim an absolute limit, but to provide a baseline, architecture‑independent reference for understanding the physical constraints that govern quantum processor scaling. By making the assumptions explicit, the model clarifies which aspects of current architectures must be changed—such as dimensionality, coupling mechanisms, or modularity—to enable scaling beyond present limits. This document may serve as a conceptual reference for researchers, engineers, and students seeking to understand the physical foundations of quantum computing scalability.
The power of quantum computation derives from algorithmic methods that exploit the availability of quantum superposition and entanglement to perform computations that are intractable with classical devices. The race is on to develop hardware that will unleash the promise of quantum algorithms. A handful of different types of hardware are currently being developed with the greatest efforts directed at superconducting, quantum-dot, trapped-ion, photonic, and neutral-atom approaches [1]. While all approaches have strengths and weaknesses, and are at different stages of development, the challenge of creating a practical design that can be scaled to a million or more qubits has not yet been met with any of the existing platforms. One may wonder if we really need a million qubits for a useful quantum computer. The answer depends on our ambition level. On the one hand it is widely believed that a quantum computer with less than 100 reliable qubits will be able to demonstrate a quantum advantage for a well defined computational problem [2]. Demonstration of a quantum computational advantage will generate great excitement in the halls of academia, but will have little broader import. A problem of great practical interest such as ab initio design of chemicals for increasing the yield of fertilizers for crop production, to name but one example, may also require just a few hundred qubits, provided computational sequences with circuit depth of 1010 or more operations can be reliably performed [3]. However, given the current performance of qubit hardware, which has demonstrated error rates not less than ∼10−3, computations with depth 1010 will only produce random outcomes of negligible value. The solution lies in the construction of error-correction circuitry operating on logical qubits, each composed of many physical qubits, which will enable logical error rates many orders of magnitude smaller than physical error rates. Although error correction is remarkably efficient for classical computing devices—Hamming codes detect and correct errors while only requiring roughly 10% overhead in the number of physical bits—quantum error correction is notoriously expensive. New approaches to error correction are the subject of intensive research with one promising direction being the development of codes that are optimized to suppress the dominant error mechanism in a particular physical platform [4,5]. Nevertheless, with physical error rates of 10−4, a plausible target for current qubit systems, the overhead required to reach logical error rates of 10−10 may be measured in thousands of physical qubits for each logical qubit. Thus a quantum computer able to perform deep calculations on a few hundred logical qubits could require a million physical qubits. A consequence of the cost of quantum error correction is that any viable approach to large-scale quantum computing needs to combine high-fidelity quantum logic operations with a capability for integrating large numbers of physical qubits. From this perspective neutral-atom qubits appear particularly promising [6] as they have already demonstrated control of more qubits than any other platform with recent experiments in 1D [7], 2D [8,9], and 3D [10] geometries showing control of up to 50 atomic qubits. Large qubit arrays can potentially be prepared in 1D, 2D, or 3D geometries. The number of proximal qubits increases with the dimensionality, which is advantageous for implementation of error correction code words, and points towards a preference for 2D or 3D arrays. On the other hand, the added overhead of compensating crosstalk incurred when targeting atoms inside a 3D volume makes parallel operations on multiple qubits challenging. A 2D geometry, as shown schematically in Fig. 1, may be an optimal choice since qubit control and measurement can be performed with lasers propagating normal to the plane of the array so that individual qubit sites can be addressed independently. With demonstrated array periods of a few micrometers we require a footprint of less than 1 mm2 for 104 qubits. Conceptual picture of a 2D neutral-atom qubit array. a) High-numerical-aperture lenses project several different wavelengths of light for control and measurement of the qubits. Specific choices of optical wavelengths depend on the atomic species. Not shown are optics for initial laser cooling, transport to the array, beam scanning, and imaging for qubit measurement. b) Averaged fluorescence image of 49 atomic qubits on a 2D grid with |3.8 μm3.8 \, {\mu} \rm {m}3.8μm| spacing [8]. From a fundamental perspective the prospects for scaling neutral-atom systems are particularly promising due to the exceptionally large ratio between coherent and incoherent coupling rates. Neutral-atom qubits are encoded in hyperfine ground states for which coherence times of the order of 10 s have been demonstrated [10]. This implies a dephasing rate |γ∼0.1 s−1\gamma \sim 0.1 \, \rm s^{-1}γ∼0.1s−1|⁠. The coherent coupling that enables quantum logic operations is switched on by exciting atoms to high-lying Rydberg states with principal quantum number close to 100 [11,12]. Rydberg excited atoms at spacings of a few micrometers in an optical lattice interact coherently with rates |g>109 s−1g > 10^9\, \rm s^{-1}g>109s−1|⁠. The ratio between desired coherent coupling and residual incoherent dephasing of g/γ ∼ 1010 establishes a figure of merit that is enabling for scalability. To our knowledge only trapped ions can claim a similar g/γ ratio [13], but without a correspondingly direct path towards controlling thousands of qubits in a single processing unit. Although the g/γ ratio is exceptionally favorable for neutral-atom qubits a complete set of universal gate operations has not yet been demonstrated with high fidelity. Single-qubit gates in large 2D and 3D arrays have reached fidelity |F∼0.999{\mathcal {F}}\sim 0.999F∼0.999| [8,10]. However, the highest demonstrated fidelity for two-qubit entanglement mediated by Rydberg-state interactions is |F<0.8{\mathcal {F}}< 0.8F<0.8| [6,14,15], a value that is well short of the theoretical limit of |F>0.9999{\mathcal {F}}> 0.9999F>0.9999| [16,17]. There is healthy optimism within the research community working with neutral-atom qubits that combining improved laser sources with reduced noise, better cooling to reduce motional dephasing, and control of stray electric fields that perturb Rydberg atoms will lead to substantially improved gate fidelity in the near future. Recent results with better filtering of laser phase noise have already demonstrated remarkable improvement in ground–Rydberg entanglement [18]. The outlook for the next few years appears very promising. We anticipate that with advances in lasers, optical lattices for atom trapping, deterministic rearrangement and loading of atoms in multi-dimensional arrays [19,20], and optics for fast beam scanning it will be possible to increase the number of physical qubits in a single neutral-atom module to at least 104. A challenging yet plausible path to a million-qubit processor can then be contemplated by connecting 100 such modules with atom–photon entanglement channels [21]. Beyond the potential for advancing the state of the art in computation, development of techniques for single-atom control inside large multi-atom arrays will enable other applications of quantum science including metrology and time-keeping. Rydberg interactions that are at the heart of a neutral-atom quantum computer may lead to multi-atom entanglement and Heisenberg scaling of atomic-clock precision [22]. This work was supported by the NSF and ARL CDQI.
Sympathetic cooling is a technique often employed to mitigate motional heating in trapped-ion quantum computers. However, choosing system parameters such as number of coolants and cooling duty cycle for optimal gate performance requires evaluating trade-offs between motional errors and other slower errors such as qubit dephasing. The optimal parameters depend on cooling power, heating rate, and ion spacing in a particular system. In this study, we aim to analyze best practices for sympathetic cooling of long chains of trapped ions using analytical and computational methods. We use a case study to show that optimal cooling performance is achieved when coolants are placed at the center of the chain and provide a perturbative upper bound on the cooling limit of a mode given a particular set of cooling parameters. In addition, using computational tools, we analyze the trade-off between the number of coolant ions in a chain and the center-of-mass mode heating rate. We also show that cooling as often as possible when running a circuit is optimal when the qubit coherence time is otherwise long. These results provide a roadmap for how to choose sympathetic cooling parameters to maximize circuit performance in trapped-ion quantum computers using long chains of ions. Published by the American Physical Society 2024