Quantum Magic in Quantum Electrodynamics

• URL: http://arxiv.org/abs/2503.03098v1
• Date: Wed, 05 Mar 2025 01:32:06 GMT
• Title: Quantum Magic in Quantum Electrodynamics
• Authors: Qiaofeng Liu, Ian Low, Zhewei Yin,
• Abstract summary: Non-stabilizerness -- the magic -- refers to the computational advantage of certain quantum states over classical computers.<n>We study the production of magic states in Quantum Electrodynamics via 2-to-2 scattering processes involving electrons and muons.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In quantum computing, non-stabilizerness -- the magic -- refers to the computational advantage of certain quantum states over classical computers and is an essential ingredient for universal quantum computation. Employing the second order stabilizer R\'enyi entropy to quantify magic, we study the production of magic states in Quantum Electrodynamics (QED) via 2-to-2 scattering processes involving electrons and muons. Considering all 60 stabilizer initial states, which have zero magic, the angular dependence of magic produced in the final states is governed by only a few patterns, both in the non-relativistic and the ultra-relativistic limits. Some processes, such as the low-energy $e^-\mu^-\to e^-\mu^-$ and Bhabha scattering $e^-e^+\to e^-e^+$, do not generate magic at all. In most cases the largest magic generated is significantly less than the maximal possible value of $\log (16/7) \approx 0.827$. The only instance where QED is able to generate maximal magic is the low-energy $\mu^-\mu^+\to e^-e^+$, in the limit $m_e/m_\mu \to 0$, which is well approximated in nature. Our results suggest QED, although capable of producing maximally entangled states easily, may not be an efficient mechanism for generating quantum advantages.

Related papers

• Non-stabilizerness in open XXZ spin chains: Universal scaling and dynamics [0.0]
  We investigate magic in the open XXZ spin chain under either boundary gain and loss, or bulk dephasing. We develop a novel, highly efficient algorithm for computing $M$ within the matrix product states formalism. These findings position magic as a powerful diagnostic tool for probing universality and dynamics in open quantum systems.
  arXiv  Detail & Related papers  (2025-04-15T12:41:52Z)
• Maximal Magic for Two-qubit States [0.0]
  We investigate two-qubit states with maximal magic, which are most distinct from classical simulability.<n>We reveal a striking interplay between magic and entanglement: the entanglement of maximal magic states is restricted to two possible values.
  arXiv  Detail & Related papers  (2025-02-24T19:00:00Z)
• Quantum States with Maximal Magic [0.0]
  We show that if a Weyl-Heisenberg (WH) covariant Symmetric Informationally Complete (SIC) quantum measurement exists, its states uniquely maximize the stabilizer entropies by saturating the bound.<n>Our result may have implications for quantum computation at a practical level, as it demonstrates that this notion of maximal magic inherits all the difficulties of the 25-year-old SIC existence problem, along with the deep questions in number theory associated with it.
  arXiv  Detail & Related papers  (2024-12-30T17:02:22Z)
• Quantum control of a single $\mathrm{H}_2^+$ molecular ion [34.82692226532414]
  $mathrmH+$ is the simplest stable molecule, and its internal structure is calculable to high precision from first principles. Standard control methods such as laser cooling, fluorescence detection and optical pumping are not applicable to $mathrmH+$. We demonstrate full quantum control of a single $mathrmH+$ molecule by co-trapping it with an atomic 'helper' ion.
  arXiv  Detail & Related papers  (2024-09-10T13:22:19Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• 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)
• Logical Magic State Preparation with Fidelity Beyond the Distillation Threshold on a Superconducting Quantum Processor [20.66929930736679]
  Fault-tolerant quantum computing based on surface code has emerged as an attractive candidate for practical large-scale quantum computers. We present a hardware-efficient and scalable protocol for arbitrary logical state preparation for the rotated surface code. We further experimentally implement it on the textitZuchongzhi 2.1 superconducting quantum processor.
  arXiv  Detail & Related papers  (2023-05-25T12:10:59Z)
• 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)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
  We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
  arXiv  Detail & Related papers  (2021-07-01T01:02:17Z)
• Quantum Simulation of Molecules without Fermionic Encoding of the Wave Function [62.997667081978825]
  fermionic encoding of the wave function can be bypassed, leading to more efficient quantum computations. An application to computing the ground-state energy and 2-RDM of H$_4$ is presented.
  arXiv  Detail & Related papers  (2021-01-27T18:57:11Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.