Gauge invariance from quantum information principles

• URL: http://arxiv.org/abs/2511.04358v1
• Date: Thu, 06 Nov 2025 13:41:17 GMT
• Title: Gauge invariance from quantum information principles
• Authors: Claudia Núñez, Miguel Pardina, Manuel Asorey, José Ignacio Latorre, Alba Cervera-Lierta,
• Abstract summary: We study whether the interplay between entanglement and magic constrains the structure of fundamental interactions.<n>We find that imposing maximal entanglement (MaxEnt) alone does not uniquely recover gauge-invariant and diffeomorphism-invariant interactions.<n>Our results indicate that nature favors MaxEnt and low magic: maximal quantum correlations with limited non-Cliffordness, sufficient for universal quantum computing but close to classical simulability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entanglement is a hallmark of quantum theory, yet it alone does not capture the full extent of quantum complexity: some highly entangled states can still be classically simulated. Non-classical behavior also requires magic, the non-Clifford component that enables universal quantum computation. Here, we investigate whether the interplay between entanglement and magic constrains the structure of fundamental interactions. We study gluon-gluon and graviton-graviton scattering at tree level, explicitly breaking gauge and general covariance by modifying the quartic vertices and analyzing the resulting generation of entanglement and magic. We find that imposing maximal entanglement (MaxEnt) alone does not uniquely recover gauge-invariant and diffeomorphism-invariant interactions, but adding the condition of minimal, but nonzero, magic singles it out. Our results indicate that nature favors MaxEnt and low magic: maximal quantum correlations with limited non-Cliffordness, sufficient for universal quantum computing but close to classical simulability. This dual informational principle may underlie the emergence of gauge invariance in fundamental physics.

Related papers

• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Exponential Advantage from One More Replica in Estimating Nonlinear Properties of Quantum States [16.185988658474635]
  We prove that estimation of $mathrmtr(rhok O)$ for a broad class of observables $O$ is exponentially hard for any protocol restricted to $(k-1)$-replica joint measurements.<n>Results establish, for the first time, an exponential separation between $(k-1)$- and $k$-replica protocols for any integer $k>2$.
  arXiv  Detail & Related papers  (2025-09-28T17:46:43Z)
• Magic States in the Asymmetric Quantum Rabi Model [0.0]
  Magic or non-stabilizerness is a resource for quantum computing that has been extensively studied in qudit networks.<n>We study magic in a bipartite system, the Asymmetric Quantum Rabi model, a paradigmatic model from quantum optics.
  arXiv  Detail & Related papers  (2025-08-01T16:41:06Z)
• Counterfactuals in Macroscopic Quantum Physics: Irreversibility, Measurement and Locality [0.0]
  We argue that measurement, irreversibility and locality can all appear to challenge the universality of quantum theory.<n>We find novel features of quantum thermodynamics relating to irreversibility, information erasure and coherence.<n>This reveals new ways of characterising the quantum information stored in entanglement and quantum branching structure.
  arXiv  Detail & Related papers  (2025-05-28T20:14:17Z)
• Observation of Quantum Darwinism and the Origin of Classicality with Superconducting Circuits [9.09683951826704]
  How can we rationalize everyday classical observations from an inherently quantum world?<n>Quantum Darwinism offers a compelling framework to explain this emergence of classicality.<n>We observe the highly structured branching quantum states that support classicality and the saturation of quantum mutual information.
  arXiv  Detail & Related papers  (2025-04-01T13:33:32Z)
• Operationally classical simulation of quantum states [41.94295877935867]
  A classical state-preparation device cannot generate superpositions and hence its emitted states must commute.<n>We show that no such simulation exists, thereby certifying quantum coherence.<n>Our approach is a possible avenue to understand how and to what extent quantum states defy generic models based on classical devices.
  arXiv  Detail & Related papers  (2025-02-03T15:25:03Z)
• A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
  We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device. Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
  arXiv  Detail & Related papers  (2024-05-10T19:30:23Z)
• Unconditional quantum magic advantage in shallow circuit computation [2.517043342442487]
  Quantum theory promises computational speed-ups over classical approaches.<n>The Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of "magic" states.<n>In this work, we demonstrate the first unconditional magic advantage.
  arXiv  Detail & Related papers  (2024-02-19T15:59:48Z)
• Limitations of Classically-Simulable Measurements for Quantum State Discrimination [7.0937306686264625]
  stabilizer operations play a pivotal role in fault-tolerant quantum computing. We investigate the limitations of classically-simulable measurements in distinguishing quantum states.
  arXiv  Detail & Related papers  (2023-10-17T15:01:54Z)
• Quantum Instability [30.674987397533997]
  We show how a time-independent, finite-dimensional quantum system can give rise to a linear instability corresponding to that in the classical system. An unstable quantum system has a richer spectrum and a much longer recurrence time than a stable quantum system.
  arXiv  Detail & Related papers  (2022-08-05T19:53:46Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Entanglement of Classical and Quantum Short-Range Dynamics in Mean-Field Systems [0.0]
  We show the emergence of classical dynamics for very general quantum lattice systems with mean-field interactions. This leads to a theoretical framework in which the classical and quantum worlds are entangled.
  arXiv  Detail & Related papers  (2021-03-11T15:23:59Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• Operational Resource Theory of Imaginarity [48.7576911714538]
  We show that quantum states are easier to create and manipulate if they only have real elements. As an application, we show that imaginarity plays a crucial role for state discrimination.
  arXiv  Detail & Related papers  (2020-07-29T14:03:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.