Noise robustness and threshold of many-body quantum magic

• URL: http://arxiv.org/abs/2410.21215v1
• Date: Mon, 28 Oct 2024 17:01:47 GMT
• Title: Noise robustness and threshold of many-body quantum magic
• Authors: Fuchuan Wei, Zi-Wen Liu,
• Abstract summary: We investigate how noise affects magic properties in entangled many-body quantum states. We show that interactions facilitated by high-degree gates are fragile to noise. We also discuss the qudit case based on the discrete Wigner formalism.
• Score: 0.5524804393257919
• License:
• Abstract: Understanding quantum magic (i.e., nonstabilizerness) in many-body quantum systems is challenging but essential to the study of quantum computation and many-body physics. We investigate how noise affects magic properties in entangled many-body quantum states by quantitatively examining the magic decay under noise, with a primary aim being to understand the stability of magic associated with different kinds of entanglement structures. As a standard model, we study hypergraph states, a representative class of many-body magic states, subject to depolarizing noise. First, we show that interactions facilitated by high-degree gates are fragile to noise. In particular, the $\mathrm{C}^{n-1}Z$ state family exhibits a vanishing magic threshold of $\Theta(1/n)$. Furthermore, we demonstrate efficiently preparable families of hypergraph states without local magic but with a non-vanishing magic threshold which signifies robust magic that is entirely embedded in global entanglement. We also discuss the qudit case based on the discrete Wigner formalism.

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)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• 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)
• Magic of quantum hypergraph states [6.3109948645563465]
  We analytically investigate the magic resource of archetypal multipartite quantum states -- quantum hypergraph states. Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.
  arXiv  Detail & Related papers  (2023-08-03T17:21:55Z)
• 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)
• Schr\"odinger cat states of a 16-microgram mechanical oscillator [54.35850218188371]
  The superposition principle is one of the most fundamental principles of quantum mechanics. Here we demonstrate the preparation of a mechanical resonator with an effective mass of 16.2 micrograms in Schr"odinger cat states of motion. We show control over the size and phase of the superposition and investigate the decoherence dynamics of these states.
  arXiv  Detail & Related papers  (2022-11-01T13:29:44Z)
• The power of noisy quantum states and the advantage of resource dilution [62.997667081978825]
  Entanglement distillation allows to convert noisy quantum states into singlets. We show that entanglement dilution can increase the resilience of shared quantum states to local noise.
  arXiv  Detail & Related papers  (2022-10-25T17:39:29Z)
• Many-body quantum magic [0.609170287691728]
  We show that the maximum magic of an $n$-qubit state is essentially $n$, simultaneously for a range of "good" magic measures. In the quest for explicit, scalable cases of highly entangled states whose magic can be understood, we connect the magic of hypergraph states with the second-order nonlinearity of their underlying Boolean functions. We show that $n$-qubit states with nearly $n$ magic, or indeed almost all states, cannot supply nontrivial speedups over classical computers.
  arXiv  Detail & Related papers  (2020-10-26T18:06:45Z)
• 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)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.