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:1511.06336

Large Sample Superradiance and Fault-Tolerant Quantum Computation

Deniz D. Yavuz, B. Lemberger

Published Nov 19, 2015• 0 citations
arXivHTMLPDF

Abstract

We quantitatively analyze superradiance (collective emission) in a three-dimensional array of qubits without imposing any restrictions on the size of the sample. We show that even when the spacing between the qubits become arbitrarily large, superradiance produces an error rate on each qubit that scales with the total number of qubits. This is because the sum of the norms of the effective Hamiltonians that decoheres each qubit scales with the total number of qubits and is, therefore, unbounded. In three spatial dimensions, the sum of the norms scales as $N^{2/3}$ where $N$ is the total number of qubits in the computer. Because the sum of the Hamiltonian norms are unbounded, the introduced errors are outside the applicability of the threshold theorem.

DOI
10.48550/arxiv.1511.06336

Related papers

Superradiance as a source of collective decoherence in quantum computers

Deniz D. Yavuz

We analyze the radiative coupling of qubits to a common radiation bath in free space and discuss that superradiance (collective emission) results in decoherence that scales with the square of the number of qubits. This decoherence mechanism is nonlocal; the collective emission simultaneously decoheres all the qubits in the computer. Because the noise source is not local, the introduced errors are outside the applicability of the threshold theorem. As a result, we argue that the errors due to superradiance cannot be corrected using the current models of fault-tolerant quantum computation.

arXiv:1407.0411•Journal of the Optical Society of America B•Oct 13, 2014•12 citations

Effect of correlated decay on fault-tolerant quantum computation

B. Lemberger, Deniz D. Yavuz

We analyze noise in the circuit model of quantum computers when the qubits are coupled to a common bosonic bath and discuss the possible failure of scalability of quantum computation. Specifically, we investigate correlated (super-radiant) decay between the qubit energy levels from a two- or three-dimensional array of qubits without imposing any restrictions on the size of the sample. We first show that regardless of how the spacing between the qubits compares with the emission wavelength, correlated decay produces errors outside the applicability of the threshold theorem. This is because the sum of the norms of the two-body interaction Hamiltonians (which can be viewed as the upper bound on the single-qubit error) that decoheres each qubit scales with the total number of qubits and is unbounded. We then discuss two related results: (1) We show that the actual error (instead of the upper bound) on each qubit scales with the number of qubits. As a result, in the limit of large number of qubits in the computer, $N\ensuremath{\rightarrow}\ensuremath{\infty}$, correlated decay causes each qubit in the computer to decohere in ever shorter time scales. (2) We find the complete eigenvalue spectrum of the exchange Hamiltonian that causes correlated decay in the same limit. We show that the spread of the eigenvalue distribution grows faster with $N$ compared to the spectrum of the unperturbed system Hamiltonian. As a result, as $N\ensuremath{\rightarrow}\ensuremath{\infty}$, quantum evolution becomes completely dominated by the noise due to correlated decay. These results argue that scalable quantum computing may not be possible in the circuit model in a two- or three- dimensional geometry when the qubits are coupled to a common bosonic bath.

Physical Review A•Dec 29, 2017•12 citations

Sampling methods to describe superradiance in large ensembles of quantum emitters

Daniel Eyles, Emmanuel Lassalle, Adam Stokes +2 more

Superradiance is a quantum phenomenon in which coherence between emitters results in enhanced and directional radiative emission. Many quantum optical phenomena can be characterized by the two-time quantum correlation function $g^{(2)}(t,τ)$, which describes the photon statistics of emitted radiation. However, the critical task of determining $g^{(2)}(t,τ)$ becomes intractable for large emitter ensembles due to the exponential scaling of the Hilbert space dimension with the number of emitters. Here, we analyse and benchmark two approximate numerical sampling methods applicable to emitter arrays embedded within electromagnetic environments, which generally provide upper and lower bounds for $g^{(2)}(t,0)$. We also introduce corrections to these methods (termed offset corrections) that significantly improve the quality of the predictions. The optimal choice of method depends on the total number of emitters, such that taken together, the two approaches provide accurate descriptions across a broad range of important regimes. This work therefore provides new theoretical tools for studying the well-known yet complex phenomenon of superradiance in large ensembles of quantum emitters.

quant-pharXiv:2601.21254•Jan 30, 2026•0 citations

Is Fault-Tolerant Quantum Computation Really Possible?

M. I. Dyakonov

The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes, and all the manipulations with qubits are not exact. The purpose of this article, intended for physicists, is to outline the ideas of quantum error correction and to take a look at the proposed technical instruction for fault-tolerant quantum computation. It seems that the mathematics behind the threshold theorem is somewhat detached from the physical reality, and that some ideal elements are always present in the construction. This raises serious doubts about the possibility of large scale quantum computations, even as a matter of principle.

arXiv:quant-ph/0610117•Oct 14, 2006•21 citations

Scaling of Superradiant Peak Emission in Spatially Extended Emitter Arrays

Raphael Holzinger, Susanne F. Yelin

In quantum optics, superradiance is a phenomenon in which a system of $N$ fully excited quantum emitters radiate intense flashes of light during collective decay. However, computing its peak intensity exactly for many spatially separated emitters remains challenging due to the exponential growth of the underlying Hilbert space with system size $N$. Based on third-order cumulant expansion methods, we present general scaling laws for the expononent of the peak emission rate as a function of the emitter number in free-space emitter arrays and arrays coupled to one-dimensional waveguide reservoirs. We find, that for 1D chains in free-space the peak emission rate scales linearly with $N$, while for 2D and 3D arrays with finite emitter spacing it scales superlinearly but sub-quadratically. For emitter chains coupled to waveguide reservoirs we find that the peak emission rate scales quadratically with $N$.

arXiv:2506.12649•Jun 14, 2025•0 citations

Correlated Decoherence and the Possible Limits of Scalable Fault-Tolerant Quantum Computing: A Symmetry-Based Perspective

Pavel Straňák

Over three decades after the formulation of early quantum algorithms, the realization of large-scale, fault-tolerant quantum computers remains constrained within the Noisy Intermediate-Scale Quantum (NISQ) regime. This paper critically re-evaluates the foundational assumptions underlying the Quantum Threshold Theorem and scalable Quantum Error Correction (QEC). We contrast classical error-suppression paradigms—specifically von Neumann’s majority-logic architecture for unreliable components—with the physical realities of continuous SU(2) symmetries in Hilbert space. We argue that the physical implementation of fault-tolerant quantum computing relies on a highly idealized model of uncorrelated, local Markovian noise, whose physical realizability at macroscopic scales remains contested. By examining interaction Hamiltonians in highly entangled macroscopic states, we demonstrate that collective decoherence channels and spatial noise correlations scale nonlinearly with register size n. This correlated phase drift acts as a directional force field—analogous to a long-wavelength hydrodynamic gradient across a field of coupled oscillators—rendering spatial averaging and independent syndrome measurements mathematically incapable of distinguishing systemic logic from collective environmental shifts. Consequently, we propose that universal quantum computers should not be conceptualized as scalable digital Turing machines, but rather as highly specialized, analog physical emulators bound by fundamental physical limits of continuous symmetry preservation.

•Oct 26, 2026•0 citations
We quantitatively analyze superradiance (collective emission) in a three-dimensional array of qubits without imposing any restrictions on the size of the sample. We show that even when the spacing between the qubits become arbitrarily large, superradiance produces an error rate on each qubit that scales with the total number of qubits. This is because the sum of the norms of the effective Hamiltonians that decoheres each qubit scales with the total number of qubits and is, therefore, unbounded. In three spatial dimensions, the sum of the norms scales as N2/3N^{2/3}N2/3 where NNN is the total number of qubits in the computer. Because the sum of the Hamiltonian norms are unbounded, the introduced errors are outside the applicability of the threshold theorem.
We analyze the radiative coupling of qubits to a common radiation bath in free space and discuss that superradiance (collective emission) results in decoherence that scales with the square of the number of qubits. This decoherence mechanism is nonlocal; the collective emission simultaneously decoheres all the qubits in the computer. Because the noise source is not local, the introduced errors are outside the applicability of the threshold theorem. As a result, we argue that the errors due to superradiance cannot be corrected using the current models of fault-tolerant quantum computation.
We analyze noise in the circuit model of quantum computers when the qubits are coupled to a common bosonic bath and discuss the possible failure of scalability of quantum computation. Specifically, we investigate correlated (super-radiant) decay between the qubit energy levels from a two- or three-dimensional array of qubits without imposing any restrictions on the size of the sample. We first show that regardless of how the spacing between the qubits compares with the emission wavelength, correlated decay produces errors outside the applicability of the threshold theorem. This is because the sum of the norms of the two-body interaction Hamiltonians (which can be viewed as the upper bound on the single-qubit error) that decoheres each qubit scales with the total number of qubits and is unbounded. We then discuss two related results: (1) We show that the actual error (instead of the upper bound) on each qubit scales with the number of qubits. As a result, in the limit of large number of qubits in the computer, $N\ensuremath{\rightarrow}\ensuremath{\infty}$, correlated decay causes each qubit in the computer to decohere in ever shorter time scales. (2) We find the complete eigenvalue spectrum of the exchange Hamiltonian that causes correlated decay in the same limit. We show that the spread of the eigenvalue distribution grows faster with NNN compared to the spectrum of the unperturbed system Hamiltonian. As a result, as $N\ensuremath{\rightarrow}\ensuremath{\infty}$, quantum evolution becomes completely dominated by the noise due to correlated decay. These results argue that scalable quantum computing may not be possible in the circuit model in a two- or three- dimensional geometry when the qubits are coupled to a common bosonic bath.
Superradiance is a quantum phenomenon in which coherence between emitters results in enhanced and directional radiative emission. Many quantum optical phenomena can be characterized by the two-time quantum correlation function g(2)(t,τ)g^{(2)}(t,τ)g(2)(t,τ), which describes the photon statistics of emitted radiation. However, the critical task of determining g(2)(t,τ)g^{(2)}(t,τ)g(2)(t,τ) becomes intractable for large emitter ensembles due to the exponential scaling of the Hilbert space dimension with the number of emitters. Here, we analyse and benchmark two approximate numerical sampling methods applicable to emitter arrays embedded within electromagnetic environments, which generally provide upper and lower bounds for g(2)(t,0)g^{(2)}(t,0)g(2)(t,0). We also introduce corrections to these methods (termed offset corrections) that significantly improve the quality of the predictions. The optimal choice of method depends on the total number of emitters, such that taken together, the two approaches provide accurate descriptions across a broad range of important regimes. This work therefore provides new theoretical tools for studying the well-known yet complex phenomenon of superradiance in large ensembles of quantum emitters.
The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes, and all the manipulations with qubits are not exact. The purpose of this article, intended for physicists, is to outline the ideas of quantum error correction and to take a look at the proposed technical instruction for fault-tolerant quantum computation. It seems that the mathematics behind the threshold theorem is somewhat detached from the physical reality, and that some ideal elements are always present in the construction. This raises serious doubts about the possibility of large scale quantum computations, even as a matter of principle.
In quantum optics, superradiance is a phenomenon in which a system of NNN fully excited quantum emitters radiate intense flashes of light during collective decay. However, computing its peak intensity exactly for many spatially separated emitters remains challenging due to the exponential growth of the underlying Hilbert space with system size NNN. Based on third-order cumulant expansion methods, we present general scaling laws for the expononent of the peak emission rate as a function of the emitter number in free-space emitter arrays and arrays coupled to one-dimensional waveguide reservoirs. We find, that for 1D chains in free-space the peak emission rate scales linearly with NNN, while for 2D and 3D arrays with finite emitter spacing it scales superlinearly but sub-quadratically. For emitter chains coupled to waveguide reservoirs we find that the peak emission rate scales quadratically with NNN.
Over three decades after the formulation of early quantum algorithms, the realization of large-scale, fault-tolerant quantum computers remains constrained within the Noisy Intermediate-Scale Quantum (NISQ) regime. This paper critically re-evaluates the foundational assumptions underlying the Quantum Threshold Theorem and scalable Quantum Error Correction (QEC). We contrast classical error-suppression paradigms—specifically von Neumann’s majority-logic architecture for unreliable components—with the physical realities of continuous SU(2) symmetries in Hilbert space. We argue that the physical implementation of fault-tolerant quantum computing relies on a highly idealized model of uncorrelated, local Markovian noise, whose physical realizability at macroscopic scales remains contested. By examining interaction Hamiltonians in highly entangled macroscopic states, we demonstrate that collective decoherence channels and spatial noise correlations scale nonlinearly with register size n. This correlated phase drift acts as a directional force field—analogous to a long-wavelength hydrodynamic gradient across a field of coupled oscillators—rendering spatial averaging and independent syndrome measurements mathematically incapable of distinguishing systemic logic from collective environmental shifts. Consequently, we propose that universal quantum computers should not be conceptualized as scalable digital Turing machines, but rather as highly specialized, analog physical emulators bound by fundamental physical limits of continuous symmetry preservation.