Qubit magic-breaking channels

• URL: http://arxiv.org/abs/2409.04425v1
• Date: Fri, 6 Sep 2024 17:37:41 GMT
• Title: Qubit magic-breaking channels
• Authors: Ayan Patra, Rivu Gupta, Alessandro Ferraro, Aditi Sen De,
• Abstract summary: We develop a notion of quantum channels that can make states useless for universal quantum computation by destroying their magic. We establish the properties of these channels in arbitrary dimensions and present an algorithm for determining the same.
• Score: 41.94295877935867
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a notion of quantum channels that can make states useless for universal quantum computation by destroying their magic (non-stabilizerness) - we refer to them as magic-breaking channels. We establish the properties of these channels in arbitrary dimensions. We prove the necessary and sufficient criteria for qubit channels to be magic-breaking and present an algorithm for determining the same. Moreover, we provide compact criteria in terms of the parameters for several classes of qubit channels to be magic-breaking under various post-processing operations. Further, we investigate the necessary and sufficient conditions for the tensor product of multiple qubit channels to be magic-breaking. We establish implications of the same for the dynamical resource theory of magic preservability.

Related papers

• 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)
• Information theoretic resource-breaking channels [0.0]
  We illustrate our proposed notion, referred to as process resource-breaking channels, by examining two important communication protocols, quantum dense coding, and teleportation. We prove that the sets of dense coding (DBT) and teleportation resource-breaking channels (TBT) are convex and compact. We construct witness operators capable of identifying non-TBT(non-DBT) maps.
  arXiv  Detail & Related papers  (2023-09-06T15:44:50Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Pauli component erasing quantum channels [58.720142291102135]
  We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace. We show that the obtained family of channels forms a semigroup and derive its generators.
  arXiv  Detail & Related papers  (2022-05-12T00:11:43Z)
• The platypus of the quantum channel zoo [12.4245398967236]
  We study a simple, low-dimensional family of quantum channels with exotic quantum information-theoretic features. We generalize the qutrit channel in two ways, and the resulting channels and their capacities display similarly rich behavior.
  arXiv  Detail & Related papers  (2022-02-16T23:54:07Z)
• Quantifying dynamical magic with completely stabilizer preserving operations as free [10.66048003460524]
  We quantify the magic of quantum channels by extending the generalized robustness and the min relative entropy of magic from the state to the channel domain. We also provide analytical conditions for qubit interconversion under CSPOs and show that it is a linear programming feasibility problem.
  arXiv  Detail & Related papers  (2022-02-16T05:13: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)
• Entanglement resource theory of quantum channel [0.0]
  We show two general ways of constructing entanglement measure of channels. We also present several entanglement measures of channels based on the Choi relative entropy of channels, concurrence and $k$-ME concurrence.
  arXiv  Detail & Related papers  (2021-03-17T02:53:45Z)
• 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)
• Quantum Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)

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.