Entirely nonlocal quantum magic without entanglement

• URL: http://arxiv.org/abs/2608.25950v1
• Date: Wed, 26 Aug 2026 16:05:40 GMT
• Title: Entirely nonlocal quantum magic without entanglement
• Abstract summary: Nonstabilizerness, or magic, is an archetypal emphquantum resource that is necessary for quantum computational advantage.<n>Here we uncover a phenomenon seemingly at odds with the quantum nature of magic: entirely nonlocal magic (ENM)---magic present only in correlations and absent from each party's marginal---can live without entanglement.
• Score: 11.730843675405593
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nonstabilizerness, or magic, is an archetypal \emph{quantum} resource that is necessary for quantum computational advantage. Here we uncover a phenomenon seemingly at odds with the quantum nature of magic: entirely nonlocal magic (ENM)---magic present only in correlations and absent from each party's marginal---can live without entanglement. We systematically study this separation and show it is universal and operationally reversible: every magical state or channel can be encoded into and recovered from a separable ENM realization using only local stabilizer processing and classical communication. We leverage this mechanism to devise an activation key protocol in which a classical key controls access to non-Clifford operations. We further formulate magic secret sharing, in which computational power inaccessible to any party alone becomes accessible through cooperation. On a superconducting quantum processor, we experimentally demonstrate activation key and network computing primitives, together with separable ENM state preparation and extraction protocols. Together, our results establish that magic can be classically activated, localized, and secret-shared without entanglement, providing new resource-control primitives for distributed quantum computation.

Related papers

• Experimental demonstration of non-local magic in a superconducting quantum processor [29.640121847893187]
  We perform the first experimental demonstration of non-local magic in a superconducting Quantum Processing Unit (QPU)<n>We observe excellent agreement between theory and experiment without the need for any free parameter in the noise modeling of our system.<n>The methods and tools developed in this work are conducive to the experimental realization of efficient purity estimation and the decoding of Hawking radiation from a toy-model of a Black Hole.
  arXiv  Detail & Related papers  (2025-11-19T16:08:03Z)
• Mutual Mana: Converting Local Magic into Correlations via Discrete Beamsplitters [3.7570716098003207]
  We introduce mutual mana as a measure of magic correlations defined in close analogy with quantum mutual information.<n>We show that coupling a magic state with a stabilizer vacuum state via a discrete beamsplitter will induce a full conversion of local magic into mutual mana.
  arXiv  Detail & Related papers  (2025-11-11T09:09:05Z)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [41.95227943686519]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations.
  arXiv  Detail & Related papers  (2025-05-15T17:19:19Z)
• 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.<n>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)
• Harvesting magic from the vacuum [0.0]
  This letter shows that magic can be harvested by a three-level Unruh-DeWitt detector (a qutrit) interacting with a quantum field in an initial vacuum state. While the idea of extracting resources from Quantum Field Theories (QFT) was born from the harvesting of entanglement, our result extends the protocol to evolve a qutrit from a non-magical state to a magical one.
  arXiv  Detail & Related papers  (2024-09-17T18:02:20Z)
• Invested and Potential Magic Resources in Measurement-Based Quantum Computation [9.261969875257948]
  This work bridges the gap between measurement-based quantum computation and the resource theory of magic.<n>We introduce the key concepts of "invested" and "potential" magic resources.<n>We prove that high-dimensional graphs can generate an exponential advantage of MQC compared to classical computing.
  arXiv  Detail & Related papers  (2024-08-04T09:57:33Z)
• 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)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• 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)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)

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.