Phase transition in magic with random quantum circuits

• URL: http://arxiv.org/abs/2304.10481v2
• Date: Thu, 11 Apr 2024 02:22:26 GMT
• Title: Phase transition in magic with random quantum circuits
• Authors: Pradeep Niroula, Christopher David White, Qingfeng Wang, Sonika Johri, Daiwei Zhu, Christopher Monroe, Crystal Noel, Michael J. Gullans,
• Abstract summary: 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.
• Score: 1.3551232282678036
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Magic is a property of quantum states that enables universal fault-tolerant quantum computing using simple sets of gate operations. Understanding the mechanisms by which magic is created or destroyed is, therefore, a crucial step towards efficient and practical fault-tolerant computation. We observe that a random stabilizer code subject to coherent errors exhibits a phase transition in magic, which we characterize through analytic, numeric and experimental probes. Below a critical error rate, stabilizer syndrome measurements remove the accumulated magic in the circuit, effectively protecting against coherent errors; above the critical error rate syndrome measurements concentrate magic. A better understanding of such rich behavior in the resource theory of magic could shed more light on origins of quantum speedup and pave pathways for more efficient magic state generation.

Related papers

• 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)
• Observation of disorder-free localization and efficient disorder averaging on a quantum processor [117.33878347943316]
  We implement an efficient procedure on a quantum processor, leveraging quantum parallelism, to efficiently sample over all disorder realizations. We observe localization without disorder in quantum many-body dynamics in one and two dimensions.
  arXiv  Detail & Related papers  (2024-10-09T05:28:14Z)
• Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
  We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor. We observe logical error suppression as the number of decoding rounds is increased. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
  arXiv  Detail & Related papers  (2024-10-07T17:07:18Z)
• 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)
• The Magic in Nuclear and Hypernuclear Forces [0.0]
  We study the magic (non-stabilizerness) in low-energy strong interaction processes. It is magic and fluctuations in magic, along with entanglement, that determine resource requirements for quantum simulations. The $Sigma-$-baryon is identified as a potential candidate catalyst for enhanced spreading of magic and entanglement in dense matter.
  arXiv  Detail & Related papers  (2024-05-16T17:24:21Z)
• Unconditional quantum MAGIC advantage in shallow circuit computation [2.8289044717329905]
  We show that the magic advantage can be unconditionally established, at least in a shallow circuit with a constant depth. We construct a specific nonlocal game inspired by the linear binary constraint system. We also provide an efficient algorithm to aid the search for potential magic-requiring nonlocal games.
  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)
• Measurement-induced entanglement and teleportation on a noisy quantum processor [105.44548669906976]
  We investigate measurement-induced quantum information phases on up to 70 superconducting qubits. We use a duality mapping, to avoid mid-circuit measurement and access different manifestations of the underlying phases. Our work demonstrates an approach to realize measurement-induced physics at scales that are at the limits of current NISQ processors.
  arXiv  Detail & Related papers  (2023-03-08T18:41:53Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• 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.