Harvesting magic from the vacuum

• URL: http://arxiv.org/abs/2409.11473v2
• Date: Fri, 1 Nov 2024 08:59:52 GMT
• Title: Harvesting magic from the vacuum
• Authors: Ron Nyström, Nicola Pranzini, Esko Keski-Vakkuri,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Magic is the quantum resource allowing a quantum computer to perform operations that cannot be simulated efficiently by classical computation. As such, generating magic in a quantum system is crucial for achieving quantum advantage. 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, making it possible to generate magic from QFT.

Related papers

• On the Hardness of Measuring Magic [0.4601544125705421]
  Measuring the amount of magic used by a device allows us to quantify its potential computational power. We introduce Pauli instability as a measure of magic and experimentally measure it on the IBM Eagle quantum processor. Our results suggest that one may only measure magic when a quantum computer does not provide a speed-up.
  arXiv  Detail & Related papers  (2024-08-03T04:29:34Z)
• 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)
• Unconditional quantum MAGIC advantage in shallow circuit computation [2.8289044717329905]
  We show that the magic advantage can be unconditionally established, at least in a shallow circuit with a constant depth. We construct a specific nonlocal game inspired by the linear binary constraint system. We also provide an efficient algorithm to aid the search for potential magic-requiring nonlocal games.
  arXiv  Detail & Related papers  (2024-02-19T15:59:48Z)
• Extracting randomness from quantum 'magic' [4.607344782066309]
  We show that when a subsystem of a quantum state is measured, the resultant projected ensemble of the unmeasured subsystem can exhibit a high degree of randomness. Our findings suggest an efficient approach for leveraging magic as a resource to generate random quantum states.
  arXiv  Detail & Related papers  (2024-02-15T18:33: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)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Measuring magic on a quantum processor [5.639451539396458]
  We propose and experimentally demonstrate a protocol for measuring magic based on randomized measurements. This protocol can provide a characterization of the effectiveness of a quantum hardware in producing states that cannot be effectively simulated on a classical computer.
  arXiv  Detail & Related papers  (2022-03-31T18:00:01Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• 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)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)

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.