On the Hardness of Measuring Magic
- URL: http://arxiv.org/abs/2408.01663v1
- Date: Sat, 3 Aug 2024 04:29:34 GMT
- Title: On the Hardness of Measuring Magic
- Authors: Roy J. Garcia, Gaurav Bhole, Kaifeng Bu, Liyuan Chen, Haribabu Arthanari, Arthur Jaffe,
- Abstract summary: 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.
- Score: 0.4601544125705421
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computers promise to solve computational problems significantly faster than classical computers. These 'speed-ups' are achieved by utilizing a resource known as magic. Measuring the amount of magic used by a device allows us to quantify its potential computational power. Without this property, quantum computers are no faster than classical computers. Whether magic can be accurately measured on large-scale quantum computers has remained an open problem. To address this question, we introduce Pauli instability as a measure of magic and experimentally measure it on the IBM Eagle quantum processor. We prove that measuring large (i.e., extensive) quantities of magic is intractable. Our results suggest that one may only measure magic when a quantum computer does not provide a speed-up. We support our conclusions with both theoretical and experimental evidence. Our work illustrates the capabilities and limitations of quantum technology in measuring one of the most important resources in quantum computation.
Related papers
- Quantum magic dynamics in random circuits [1.9568111750803001]
Magic refers to the degree of "quantumness" in a system that cannot be fully described by stabilizer states and Clifford operations alone.
In quantum computing, stabilizer states and Clifford operations can be efficiently simulated on a classical computer.
arXiv Detail & Related papers (2024-10-28T15:29:21Z) - 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) - 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) - 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) - 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) - Playing with a Quantum Computer [0.0]
We show a direct and straightforward way to use quantum computers in an introductory course on quantum physics.
We use an algorithm that solves a simple and easily understandable problem while providing a quantum advantage.
arXiv Detail & Related papers (2021-08-13T14:33:45Z) - 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) - Quantum Computing without Quantum Computers: Database Search and Data
Processing Using Classical Wave Superposition [101.18253437732933]
We present experimental data on magnetic database search using spin wave superposition.
We argue that in some cases the classical wave-based approach may provide the same speedup in database search as quantum computers.
arXiv Detail & Related papers (2020-12-15T16:21:53Z) - 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) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
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.