Magic spreading in random quantum circuits

• URL: http://arxiv.org/abs/2407.03929v2
• Date: Fri, 07 Feb 2025 11:54:01 GMT
• Title: Magic spreading in random quantum circuits
• Authors: Xhek Turkeshi, Emanuele Tirrito, Piotr Sierant,
• Abstract summary: We show how rapidly do generic many-body dynamics generate magic resources under the constraints of locality and unitarity. We demonstrate that magic resources equilibrate on timescales logarithmic in the system size, akin to anti-concentration and Hilbert space delocalization phenomena. As random circuits are minimal models for chaotic dynamics, we conjecture that our findings describe the phenomenology of magic resources growth in a broad class of chaotic many-body systems.
• Score: 0.0
• License:
• Abstract: Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error correction and computation. How rapidly do generic many-body dynamics generate magic resources under the constraints of locality and unitarity? We address this central question by exploring magic spreading in brick-wall random unitary circuits. We explore scalable magic measures intimately connected to the algebraic structure of the Clifford group. These metrics enable the investigation of the spreading of magic for system sizes of up to $N=1024$ qudits, surpassing the previous state-of-the-art, which was restricted to about a dozen qudits. We demonstrate that magic resources equilibrate on timescales logarithmic in the system size, akin to anti-concentration and Hilbert space delocalization phenomena, but qualitatively different from the spreading of entanglement entropy. As random circuits are minimal models for chaotic dynamics, we conjecture that our findings describe the phenomenology of magic resources growth in a broad class of chaotic many-body systems.

Related papers

• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer. Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Quantum magic dynamics in random circuits [1.9568111750803001]
  Magic refers to the degree of "quantumness" in a system that cannot be fully described by stabilizer states and Clifford operations alone. In quantum computing, stabilizer states and Clifford operations can be efficiently simulated on a classical computer.
  arXiv  Detail & Related papers  (2024-10-28T15:29:21Z)
• Magic transition in measurement-only circuits [0.0]
  We study magic in a measurement-only quantum circuit with competing types of Clifford and non-Clifford measurements. We study the magic transition in this circuit in both one- and two-dimensional lattices using large-scale numerical simulations.
  arXiv  Detail & Related papers  (2024-07-22T18:00:07Z)
• Unconditional quantum magic advantage in shallow circuit computation [2.517043342442487]
  Quantum theory promises computational speed-ups over classical approaches. The Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of "magic" states. In this work, we demonstrate the first unconditional magic advantage.
  arXiv  Detail & Related papers  (2024-02-19T15:59:48Z)
• Dynamical Magic Transitions in Monitored Clifford+T Circuits [0.0]
  We study simulability transitions beyond entanglement. We focus on random monitored Clifford circuits doped by T gates. We find cases where transitions in magic and entanglement coincide, but also others with a magic and simulability transition in a highly (volume-law) entangled phase.
  arXiv  Detail & Related papers  (2023-11-30T19:00:05Z)
• Phase transition in magic with random quantum circuits [1.3551232282678036]
  We observe that a random stabilizer code subject to coherent errors exhibits a phase transition in magic. A better understanding of such rich behavior in the resource theory of magic could shed more light on origins of quantum speedup.
  arXiv  Detail & Related papers  (2023-04-20T17:29:45Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding [58.720142291102135]
  We define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. Our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation.
  arXiv  Detail & Related papers  (2021-09-27T12:56:01Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)

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.