Witnessing Magic with Bell inequalities

• URL: http://arxiv.org/abs/2503.18734v1
• Date: Mon, 24 Mar 2025 14:41:37 GMT
• Title: Witnessing Magic with Bell inequalities
• Authors: Rafael A. Macedo, Patrick Andriolo, Santiago Zamora, Davide Poderini, Rafael Chaves,
• Abstract summary: Non-stabilizerness, or magic, is a fundamental resource for quantum computation.<n>We show that tailored Bell inequalities can act as witnesses of magic.
• Score: 0.41942958779358674
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Non-stabilizerness, or magic, is a fundamental resource for quantum computation, enabling quantum algorithms to surpass classical capabilities. Despite its importance, characterizing magic remains challenging due to the intricate geometry of stabilizer polytopes and the difficulty of simulating non-stabilizer states. In this work, we reveal an unexpected connection between magic and Bell inequalities. Although maximally entangled stabilizer states can violate Bell inequalities and magic is deeply tied to the algebraic structure of observables, we show that tailored Bell inequalities can act as witnesses of magic. This result bridges two key quantum resources, uncovering a novel relationship between the device-independent framework and resource-theoretic properties of quantum computation.

Related papers

• Geometric Analysis of the Stabilizer Polytope for Few-Qubit Systems [0.3613661942047476]
  We investigate the geometry of the stabilizer polytope in few-qubit quantum systems. By randomly sampling quantum states, we analyze the distribution of magic for both pure and mixed states. We classify Bell-like inequalities corresponding to the facets of the stabilizer polytope and establish a general concentration result connecting magic and entanglement.
  arXiv  Detail & Related papers  (2025-04-16T22:34:52Z)
• Expressibility, entangling power and quantum average causal effect for causally indefinite circuits [37.69303106863453]
  We implement parameterized quantum circuits with definite and indefinite causal order. One of these is the expressibility, which measures how uniformly a given quantum circuit can reach the whole Hilbert space. We find a correlation between the quantum average causal effect and the entangling power.
  arXiv  Detail & Related papers  (2024-11-13T13:53:02Z)
• Noise robustness and threshold of many-body quantum magic [0.5524804393257919]
  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.
  arXiv  Detail & Related papers  (2024-10-28T17:01:47Z)
• 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)
• Certifying nonstabilizerness in quantum processors [0.0]
  Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. We introduce the notion of set magic: a set of states has this property if at least one state in the set is a non-stabilizer state. We show that certain two-state overlap inequalities, recently introduced as witnesses of basis-independent coherence, are also witnesses of multi-qubit set magic.
  arXiv  Detail & Related papers  (2024-04-24T18:01:02Z)
• Experimental Test of Quantum Nonlocality from Contextuality [1.433758865948252]
  Bell inequalities can be violated by state-independent contextuality sets.<n>We show a new way to produce non-locality using orbital angular momentum entanglement in a bipartite photonic system.
  arXiv  Detail & Related papers  (2024-02-29T13:31:41Z)
• 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)
• Enhancement of non-Stabilizerness within Indefinite Causal Order [6.612068248407539]
  The quantum SWITCH allows quantum states to pass through operations in a superposition of different orders, outperforming traditional circuits in numerous tasks. We find that the completely stabilizer-preserving operations, which cannot generate magic states under standard conditions, can be transformed to do so when processed by the quantum SWITCH. These findings reveal the unique properties of the quantum SWITCH and open avenues in research on nonstabilizer resources of general quantum architecture.
  arXiv  Detail & Related papers  (2023-11-27T02:35:48Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• 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.