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

Thermodynamic Veto: Correlated Noise and the Phase Transition of Scalable Quantum Computing

Quni-Gudzinas, Rowan Brad

Published Nov 27, 2025• 0 citations
Publisher

Abstract

The realization of commercially viable, fault-tolerant quantum computing is precluded not by engineering immaturity but by a fundamental percolation phase transition driven by correlated noise and thermodynamic constraints, which render the required system scales physically uncorrectable.
DOI
10.5281/zenodo.17734805

Related papers

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

Thermodynamic limitations on fault-tolerant quantum computing

Mykhailo Bilokur, Sarang Gopalakrishnan, Shayan Majidy

We investigate the thermodynamic limits on scaling fault-tolerant quantum computers due to heating from quantum error correction (QEC). Quantum computers require error correction, which accounts for 99.9% of the qubit demand and generates heat through information-erasing processes. This heating increases the error rate, necessitating more rounds of error correction. We introduce a dynamical model that characterizes heat generation and dissipation for arrays of qubits weakly coupled to a refrigerator and identify a dynamical phase transition between two operational regimes: a bounded-error phase, where temperature stabilizes and error rates remain below fault-tolerance thresholds, and an unbounded-error phase, where rising temperatures drive error rates beyond sustainable levels, making fault tolerance infeasible. Applying our model to a superconducting qubit system performing Shor's algorithm to factor 2048-bit RSA integers, we find that current experimental parameters place the system in the bounded-error phase. Our results indicate that, while inherent heating can become significant, this thermodynamic constraint should not limit scalable fault tolerance if current hardware capabilities are maintained as systems scale.

arXiv:2411.12805•Nov 19, 2024•0 citations

Decoherence Impediments in Quantum Computing and Fundamental Challenges of Quantum Error Correction

Shahebaz Ahmed Khan, Abdul Ahad Afroz, Shaik Subhan Ali

This review synthesizes current understanding of decoherence pathways across leading hardware platforms and explains why several experimentally observed noise features—drift, burst events, coherent components, correlated and non-Markovian structure, and leakage—can be disproportionately damaging for QEC. Decoherence remains the dominant impediment to scalable quantum computing because it is not a single error mechanism but a system-level phenomenon arising from materials defects, electromagnetic loss, control electronics, measurement backaction, and the broader environment in which a processor operates. Quantum error correction (QEC) is designed to algorithmically suppress physical noise, yet its practical success depends on how closely real devices satisfy the assumptions under which fault tolerance is proved: approximate locality, weak temporal correlations, sufficiently stochastic error statistics, low leakage, and reliable syndrome extraction. We then evaluate fundamental and engineering challenges that shape the viability of QEC at scale: syndrome measurement fidelity, correlated error suppression, decoding latency and classical co-processing, architectural constraints (connectivity, crosstalk, calibration overhead), and the resource cost of implementing a universal fault-tolerant gate set. Recent demonstrations of below-threshold behaviour and “break-even” regimes show that QEC is transitioning from theory to practice, but also clarify what remains unresolved: maintaining stable noise below fault-tolerance targets over long times, scaling to many logical qubits with low correlated-error rates, and integrating hardware-aware codes and decoders. We conclude with research priorities that treat decoherence and QEC as part of a co-designed stack spanning device physics, control, architecture, and algorithms.

Asian Journal of Research in Computer Science•Dec 24, 2025•0 citations

Comment on "Resilient Quantum Computation in Correlated Environments: A Quantum Phase Transition Perspective" and "Fault-tolerant Quantum Computation with Longe-range Correlated Noise"

Robert Alicki

Critical comments on the recent papers supporting the idea of resilient quantum computations are presented.

arXiv:quant-ph/0702050•Feb 6, 2007•7 citations

Sufficient condition on noise correlations for scalable quantum computing

PreskillJohn

I study the effectiveness of fault-tolerant quantum computation against correlated Hamiltonian noise, and derive a sufficient condition for scalability. Arbitrarily long quantum computations can be...

Quantum Information and Computation•Mar 1, 2013•0 citations

Sufficient condition on noise correlations for scalable quantum computing

John P. Preskill

I study the effectiveness of fault-tolerant quantum computation against correlated Hamiltonian noise, and derive a sufficient condition for scalability. Arbitrarily long quantum computations can be executed reliably provided that noise terms acting collectively on $k$ system qubits are sufficiently weak, and decay sufficiently rapidly with increasing $k$ and with increasing spatial separation of the qubits.

arXiv:1207.6131•Quantum Information and Computation•Mar 1, 2013•60 citations
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.
We investigate the thermodynamic limits on scaling fault-tolerant quantum computers due to heating from quantum error correction (QEC). Quantum computers require error correction, which accounts for 99.9% of the qubit demand and generates heat through information-erasing processes. This heating increases the error rate, necessitating more rounds of error correction. We introduce a dynamical model that characterizes heat generation and dissipation for arrays of qubits weakly coupled to a refrigerator and identify a dynamical phase transition between two operational regimes: a bounded-error phase, where temperature stabilizes and error rates remain below fault-tolerance thresholds, and an unbounded-error phase, where rising temperatures drive error rates beyond sustainable levels, making fault tolerance infeasible. Applying our model to a superconducting qubit system performing Shor's algorithm to factor 2048-bit RSA integers, we find that current experimental parameters place the system in the bounded-error phase. Our results indicate that, while inherent heating can become significant, this thermodynamic constraint should not limit scalable fault tolerance if current hardware capabilities are maintained as systems scale.
This review synthesizes current understanding of decoherence pathways across leading hardware platforms and explains why several experimentally observed noise features—drift, burst events, coherent components, correlated and non-Markovian structure, and leakage—can be disproportionately damaging for QEC. Decoherence remains the dominant impediment to scalable quantum computing because it is not a single error mechanism but a system-level phenomenon arising from materials defects, electromagnetic loss, control electronics, measurement backaction, and the broader environment in which a processor operates. Quantum error correction (QEC) is designed to algorithmically suppress physical noise, yet its practical success depends on how closely real devices satisfy the assumptions under which fault tolerance is proved: approximate locality, weak temporal correlations, sufficiently stochastic error statistics, low leakage, and reliable syndrome extraction. We then evaluate fundamental and engineering challenges that shape the viability of QEC at scale: syndrome measurement fidelity, correlated error suppression, decoding latency and classical co-processing, architectural constraints (connectivity, crosstalk, calibration overhead), and the resource cost of implementing a universal fault-tolerant gate set. Recent demonstrations of below-threshold behaviour and “break-even” regimes show that QEC is transitioning from theory to practice, but also clarify what remains unresolved: maintaining stable noise below fault-tolerance targets over long times, scaling to many logical qubits with low correlated-error rates, and integrating hardware-aware codes and decoders. We conclude with research priorities that treat decoherence and QEC as part of a co-designed stack spanning device physics, control, architecture, and algorithms.
I study the effectiveness of fault-tolerant quantum computation against correlated Hamiltonian noise, and derive a sufficient condition for scalability. Arbitrarily long quantum computations can be executed reliably provided that noise terms acting collectively on kkk system qubits are sufficiently weak, and decay sufficiently rapidly with increasing kkk and with increasing spatial separation of the qubits.