Quantum States with Maximal Magic

• URL: http://arxiv.org/abs/2412.21083v1
• Date: Mon, 30 Dec 2024 17:02:22 GMT
• Title: Quantum States with Maximal Magic
• Authors: Gianluca Cuffaro, Christopher A. Fuchs,
• Abstract summary: 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. 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.
• Score: 0.0
• License:
• Abstract: Finding ways to quantify magic is an important problem in quantum information theory. Recently Leone, Oliviero and Hamma introduced a class of magic measures for qubits, the stabilizer entropies of order $\alpha$, to aid in studying nonstabilizer resource theory. This suggests a way to search for those states that are as distinct as possible from the stabilizer states. In this work we explore the problem in any finite dimension $d$ and characterize the states that saturate an upper bound on stabilizer entropies of order $\alpha\geq2$. Particularly, 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. No other states can reach so high. This result is surprising, as the initial motivation for studying SICs was a purely quantum-foundational concern in QBism. Yet 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.

Related papers

• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Generalized Quantum Stein's Lemma and Second Law of Quantum Resource Theories [47.02222405817297]
  A fundamental question in quantum information theory is whether an analogous second law can be formulated to characterize the convertibility of resources for quantum information processing by a single function. In 2008, a promising formulation was proposed, linking resource convertibility to the optimal performance of a variant of the quantum version of hypothesis testing. In 2023, a logical gap was found in the original proof of this lemma, casting doubt on the possibility of such a formulation of the second law.
  arXiv  Detail & Related papers  (2024-08-05T18:00:00Z)
• Certifying nonstabilizerness in quantum processors [0.0]
  Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. We introduce the notion of set magic: a set of states has this property if at least one state in the set is a non-stabilizer state. We show that certain two-state overlap inequalities, recently introduced as witnesses of basis-independent coherence, are also witnesses of multi-qubit set magic.
  arXiv  Detail & Related papers  (2024-04-24T18:01:02Z)
• 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)
• Pseudomagic Quantum States [1.693280275647873]
  "Notions of nonstabilizerness" quantify how non-classical quantum states are in a precise sense. We introduce 'pseudomagic' ensembles of quantum states that, despite low nonstabilizerness, are computationally indistinguishable from those with high nonstabilizerness.
  arXiv  Detail & Related papers  (2023-08-30T18:00:02Z)
• 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)
• Is there a finite complete set of monotones in any quantum resource theory? [39.58317527488534]
  We show that there does not exist a finite set of resource monotones which completely determines all state transformations. We show that totally ordered theories allow for free transformations between all pure states.
  arXiv  Detail & Related papers  (2022-12-05T18:28:36Z)
• Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis [59.545114016224254]
  Quantum algorithms for topological data analysis seem to provide an exponential advantage over the best classical approach. We show that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers. We argue that an exponential quantum advantage can be recovered if the input data is given as a specification of simplices.
  arXiv  Detail & Related papers  (2022-09-28T17:53:25Z)
• Scalable measures of magic resource for quantum computers [0.0]
  We introduce efficient measures of magic resource for pure quantum states with a sampling cost independent of the number of qubits. We show the transition of classically simulable stabilizer states into intractable quantum states on the IonQ quantum computer.
  arXiv  Detail & Related papers  (2022-04-21T12:50:47Z)
• Computational self-testing for entangled magic states [0.0]
  We show that a magic state for the CCZ gate can be self-tested while that for the T gate cannot. Our result is applicable to a proof of quantumness, where we can classically verify whether a quantum device generates a quantum state having non-zero magic.
  arXiv  Detail & Related papers  (2021-11-04T09:25:40Z)
• 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.