Invested and Potential Magic Resources in Measurement-Based Quantum Computation

• URL: http://arxiv.org/abs/2408.01980v5
• Date: Tue, 07 Oct 2025 06:57:09 GMT
• Title: Invested and Potential Magic Resources in Measurement-Based Quantum Computation
• Abstract summary: 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.
• Score: 9.261969875257948
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Magic states and magic gates are crucial for achieving universal quantum computation, but important questions about how magic resources should be implemented to attain maximal quantum advantage have remained unexplored, especially in the context of measurement-based quantum computation (MQC). This work bridges the gap between MQC and the resource theory of magic by introducing the key concepts of "invested" and "potential" magic resources. The former quantifies the magic cost associated with MQC, serving as both a resource witness and a feasible upper bound for the practical realization, and is gate-order independent; The latter represents the maximal achievable magic resource in a given graph structure defining MQC. We utilize both concepts to analyze the quantum Fourier transform (QFT) and provide a fresh perspective on the universality of MQC, highlighting the crucial role of non-Pauli measurements in injecting magic. In particular, we theoretically prove that high-dimensional graphs can generate an exponential advantage of MQC compared to classical computing. We demonstrate experimentally our theoretical findings in a high-fidelity four-photon setup, surpassing conventional magic state injection (MSI) methods in both qubit efficiency and resource utilization. Our findings pave the way for future research exploring magic resource optimization and novel distillation schemes within the MQC framework, advancing fault-tolerant universal quantum computation.

Related papers

• Entirely nonlocal quantum magic without entanglement [11.730843675405593]
  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.
  arXiv  Detail & Related papers  (2026-08-26T16:05:40Z)
• The true cost of factoring: Linking magic and number-theoretic complexity in Shor's algorithm [0.18665975431697432]
  We investigate the generation of non-stabilizerness (or magic) in the paradigmatic Shor's factoring algorithm.<n>By developing an explicit analytic theory, we demonstrate the fundamental role of magic in the successful execution of the algorithm.<n>Our findings create a concise conceptual link between the classical algorithmic difficulty of a task and the non-stabilizer price to solve it on quantum hardware.
  arXiv  Detail & Related papers  (2026-05-06T18:16:29Z)
• Magic-Informed Quantum Architecture Search [0.25165775267615204]
  We propose a magic-informed quantum architecture search (QAS) technique that enables control over a quantum resource within the general framework of circuit design.<n>Inspired by the AlphaGo approach, we tackle the problem with a Monte Carlo Tree Search technique equipped with a Graph Neural Network (GNN) that estimates the magic of candidate quantum circuits.<n>We benchmark the proposed magic-informed QAS technique on both the structured ground-state energy problem and on the more general quantum state approximation problem, spanning different sizes and target magic levels.
  arXiv  Detail & Related papers  (2026-05-05T16:20:46Z)
• 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)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [47.23243191431113]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>We employ quantum error mitigation techniques to sample logical circuits given noisy encoded magic states.<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. 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 Machine Learning: An Interplay Between Quantum Computing and Machine Learning [54.80832749095356]
  Quantum machine learning (QML) is a rapidly growing field that combines quantum computing principles with traditional machine learning. This paper introduces quantum computing for the machine learning paradigm, where variational quantum circuits are used to develop QML architectures.
  arXiv  Detail & Related papers  (2024-11-14T12:27:50Z)
• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• 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)
• Magic spreading in random quantum circuits [0.0]
  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.
  arXiv  Detail & Related papers  (2024-07-04T13:43:46Z)
• Physical Implementability for Reversible Magic State Manipulation [11.182209956500682]
  This study introduces a reversible framework for the manipulation of magic states in odd dimensions. We propose the concept of physical implementability for characterizing the hardness and cost of maintaining reversibility.
  arXiv  Detail & Related papers  (2024-05-27T17:02:16Z)
• Extracting Many-Body Quantum Resources within One-Body Reduced Density Matrix Functional Theory [0.0]
  Quantum Fisher information (QFI) is a central concept in quantum sciences used to quantify the ultimate precision limit of parameter estimation. Here we combine ideas from functional theories and quantum information to develop a novel functional framework for the QFI of fermionic and bosonic ground states. Our results provide the first connection between the one-body reduced density matrix functional theory and the quantum Fisher information.
  arXiv  Detail & Related papers  (2023-11-21T13:33:53Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• 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)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• QKSA: Quantum Knowledge Seeking Agent -- resource-optimized reinforcement learning using quantum process tomography [1.3946983517871423]
  We extend the universal reinforcement learning (URL) agent models of artificial general intelligence to quantum environments. The utility function of a classical exploratory Knowledge Seeking Agent, KL-KSA, is generalized to distance measures from quantum information theory. QKSA is the first proposal for a framework that resembles the classical URL models.
  arXiv  Detail & Related papers  (2021-12-07T11:36: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)
• Towards a NISQ Algorithm to Simulate Hermitian Matrix Exponentiation [0.0]
  A practical fault-tolerant quantum computer is worth looking forward to as it provides applications that outperform their known classical counterparts. It would take decades to make it happen, exploiting the power of noisy intermediate-scale quantum(NISQ) devices, which already exist, is becoming one of current goals. In this article, a method is reported as simulating a hermitian matrix exponentiation using parametrized quantum circuit.
  arXiv  Detail & Related papers  (2021-05-28T06:37:12Z)
• 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)
• 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)
• Machine Learning Force Fields [54.48599172620472]
  Machine Learning (ML) has enabled numerous advances in computational chemistry. One of the most promising applications is the construction of ML-based force fields (FFs) This review gives an overview of applications of ML-FFs and the chemical insights that can be obtained from them.
  arXiv  Detail & Related papers  (2020-10-14T13:14: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.