Quantifying dynamical magic with completely stabilizer preserving operations as free

• URL: http://arxiv.org/abs/2202.07867v2
• Date: Fri, 1 Jul 2022 17:16:44 GMT
• Title: Quantifying dynamical magic with completely stabilizer preserving operations as free
• Authors: Gaurav Saxena and Gilad Gour
• Abstract summary: 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.
• Score: 10.66048003460524
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we extend the resource theory of magic to the channel case by considering completely stabilizer preserving operations (CSPOs) as free. We introduce and characterize the set of CSPO preserving and completely CSPO preserving superchannels. 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 and show that they bound the single-shot dynamical magic cost and distillation. We also provide analytical conditions for qubit interconversion under CSPOs and show that it is a linear programming feasibility problem and hence can be efficiently solved. Lastly, we give a classical simulation algorithm whose runtime is related to the generalized robustness of magic for channels. Our algorithm depends on some pre-defined precision, and if there is no bound on the desired precision then it achieves a constant runtime.

Related papers

• Qubit magic-breaking channels [41.94295877935867]
  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.
  arXiv  Detail & Related papers  (2024-09-06T17:37:41Z)
• Magic of the Heisenberg Picture [0.0]
  We study a non-stabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer R'enyi entropy analog in operator space is a good magic monotone satisfying the usual conditions. This monotone reveals structural properties of many-body magic generation, and can inspire Clifford-assisted tensor network methods.
  arXiv  Detail & Related papers  (2024-08-28T18:00:01Z)
• Magic spreading in random quantum circuits [0.0]
  Calderbank-Shor-Steane entropy is a measure of non-stabilizerness. Our main finding is that magic resources equilibrate on timescales logarithmic in system size N. We conjecture that our findings describe the phenomenology of non-stabilizerness growth in a broad class of chaotic many-body systems.
  arXiv  Detail & Related papers  (2024-07-04T13:43:46Z)
• Handbook for Quantifying Robustness of Magic [0.0]
  Robustness of magic (RoM) characterizes the degree of usefulness of a given quantum state for non-Clifford operation. We present efficient novel algorithms to compute the RoM. We numerically demonstrate our state-of-the-art results for copies of magic states and partially disentangled quantum states.
  arXiv  Detail & Related papers  (2023-11-02T16:15:00Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Online Continual Learning Without the Storage Constraint [67.66235695269839]
  We contribute a simple algorithm, which updates a kNN classifier continually along with a fixed, pretrained feature extractor. It can adapt to rapidly changing streams, has zero stability gap, operates within tiny computational budgets, has low storage requirements by only storing features. It can outperform existing methods by over 20% in accuracy on two large-scale online continual learning datasets.
  arXiv  Detail & Related papers  (2023-05-16T08:03:07Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• The vacuum provides quantum advantage to otherwise simulatable architectures [49.1574468325115]
  We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states. We provide an algorithm to calculate the probability density function of the measurement outcomes.
  arXiv  Detail & Related papers  (2022-05-19T18:03:17Z)
• 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)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• The axiomatic and the operational approaches to resource theories of magic do not coincide [1.6758573326215689]
  We argue that proposed stabiliser-based simulation techniques of CSP maps are strictly more powerful than Gottesman-Knill-like methods. The result is analogous to a well-known fact in entanglement theory, namely that there is a gap between the operationally defined class of local operations and classical communication.
  arXiv  Detail & Related papers  (2020-11-23T19:00:04Z)

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.