Irreversibility and Universality in Quantum Computation

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini

Emmanuel Jeandel

Daniel Shaffer, Claudio Chamon, Alioscia Hamma +1 more

We show that in a quantum system evolving unitarily under a stochastic quantum circuit the notions of irreversibility, universality of computation, and entanglement are closely related. As the state evolves from an initial product state, it gets asymptotically maximally entangled. We define irreversibility as the failure of searching for a disentangling circuit using a Metropolis-like algorithm. We show that irreversibility corresponds to Wigner–Dyson statistics in the level spacing of the entanglement eigenvalues, and that this is obtained from a quantum circuit made from a set of universal gates for quantum computation. If, on the other hand, the system is evolved with a non-universal set of gates, the statistics of the entanglement level spacing deviates from Wigner–Dyson and the disentangling algorithm succeeds. These results open a new way to characterize irreversibility in quantum systems.

Andrew Stewart Caldin

A quantum computer cannot function within a single universe. The proof emerges from a fundamental constraint: quantum superposition collapse creates irreversible information loss that makes quantum computation logically impossible within any single spacetime manifold. THE PROOF Premise 1 — Information Conservation Paradox In any single universe U, information must be conserved (Landauer's principle). Quantum computation requires superposition states, measurement-induced collapse, and computational paths through multiple probability amplitudes simultaneously. The contradiction: when the state collapses, the information in the unused coefficient is irreversibly destroyed within U. This violates information conservation. Premise 2 — Computational Completeness Requirement For quantum algorithms (Shor's, Grover's) to achieve exponential speedup, they must explore multiple computational paths simultaneously, maintain coherent superposition across all paths, and collapse only after explori Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Mika Hirvensalo