A magic monotone for faithful detection of non-stabilizerness in mixed states

• URL: http://arxiv.org/abs/2409.18570v1
• Date: Fri, 27 Sep 2024 09:13:55 GMT
• Title: A magic monotone for faithful detection of non-stabilizerness in mixed states
• Authors: Krzysztof Warmuz, Ernest Dokudowiec, Chandrashekar Radhakrishnan, Tim Byrnes,
• Abstract summary: We introduce a monotone to quantify the amount of non-stabilizerness (or magic for short) in an arbitrary quantum state. The monotone gives a necessary and sufficient criterion for detecting the presence of magic for both pure and mixed states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a monotone to quantify the amount of non-stabilizerness (or magic for short), in an arbitrary quantum state. The monotone gives a necessary and sufficient criterion for detecting the presence of magic for both pure and mixed states. The monotone is based on determining the boundaries of the stabilizer polytope in the space of Pauli string expectation values. The boundaries can be described by a set of hyperplane inequations, where violation of any one of these gives a necessary and sufficient condition for magic. The monotone is constructed by finding the hyperplane with the maximum violation and is a type of Minkowski functional. We also introduce a witness based on similar methods. The approach is more computationally efficient than existing faithful mixed state monotones such as robustness of magic due to the smaller number and discrete nature of the parameters to be optimized.

Related papers

• Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness [50.78508362183774]
  Shuffling-type gradient methods are favored in practice for their simplicity and rapid empirical performance.<n>Most require the Lipschitz condition, which is often not met in common machine learning schemes.
  arXiv  Detail & Related papers  (2025-07-11T15:36:48Z)
• Nearly Optimal Sample Complexity of Offline KL-Regularized Contextual Bandits under Single-Policy Concentrability [49.96531901205305]
  We propose the emphfirst algorithm with $tildeO(epsilon-1)$ sample complexity under single-policy concentrability for offline contextual bandits. Our proof leverages the strong convexity of the KL regularization, and the conditional non-negativity of the gap between the true reward and its pessimistic estimator. We extend our algorithm to contextual dueling bandits and achieve a similar nearly optimal sample complexity.
  arXiv  Detail & Related papers  (2025-02-09T22:14:45Z)
• Nonlinear Stochastic Gradient Descent and Heavy-tailed Noise: A Unified Framework and High-probability Guarantees [56.80920351680438]
  We study high-probability convergence in online learning, in the presence of heavy-tailed noise. Compared to state-of-the-art, who only consider clipping and require noise with bounded $p$-th moments, we provide guarantees for a broad class of nonlinearities.
  arXiv  Detail & Related papers  (2024-10-17T18:25:28Z)
• A Unified Theory of Stochastic Proximal Point Methods without Smoothness [52.30944052987393]
  Proximal point methods have attracted considerable interest owing to their numerical stability and robustness against imperfect tuning. This paper presents a comprehensive analysis of a broad range of variations of the proximal point method (SPPM)
  arXiv  Detail & Related papers  (2024-05-24T21:09:19Z)
• Stabilizer entropies are monotones for magic-state resource theory [0.0]
  We establish the monotonicity of stabilizer entropies for $alpha geq 2$ within the context of magic-state resource theory restricted to pure states. We extend stabilizer entropies to mixed states as monotones via convex roof constructions.
  arXiv  Detail & Related papers  (2024-04-17T18:00:02Z)
• Learning the stabilizer group of a Matrix Product State [0.0]
  We present a novel classical algorithm designed to learn the stabilizer group of a given Matrix Product State (MPS) We benchmark our method on $T$-doped states randomly scrambled via Clifford unitary dynamics. Our method, thanks to a very favourable scaling $mathcalO(chi3)$, represents the first effective approach to obtain a genuine magic monotone for MPS.
  arXiv  Detail & Related papers  (2024-01-29T19:00:13Z)
• Theory of free fermions dynamics under partial post-selected monitoring [49.1574468325115]
  We derive a partial post-selected Schrdinger"o equation based on a microscopic description of continuous weak measurement. We show that the passage to the monitored universality occurs abruptly at finite partial post-selection. Our approach establishes a way to study MiPTs for arbitrary subsets of quantum trajectories.
  arXiv  Detail & Related papers  (2023-12-21T16:53:42Z)
• Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond [7.988085110283119]
  We prove that the stabilizer fidelity is multiplicative for the tensor product of an arbitrary number of single-qubit states. We also show that the relative entropy of magic becomes additive if all the single-qubit states but one belong to a symmetry axis of the stabilizer octahedron.
  arXiv  Detail & Related papers  (2023-07-17T05:59:23Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance [59.211456992422136]
  We propose algorithms with high-probability convergence results under less restrictive assumptions. These results justify the usage of the considered methods for solving problems that do not fit standard functional classes in optimization.
  arXiv  Detail & Related papers  (2023-02-02T10:37:23Z)
• Sequences of resource monotones from modular Hamiltonian polynomials [0.0]
  We show that entanglement monotones yield infinite sequences of inequalities that must be satisfied in majorizing state transitions. These inequalities give improved lower bounds for the work cost in finite dimensional systems. As an application to thermodynamics, one can use them to derive finite-dimension corrections to the Clausius inequality.
  arXiv  Detail & Related papers  (2023-01-03T11:33:44Z)
• On the monotonicity of a quantum optimal transport cost [91.3755431537592]
  We show that the generalization of the $2$-Wasserstein distance proposed by Chakrabarti et al. is not monotone under partial traces. We propose a stabilized version of the original definition, which we show to be monotone under the application of general quantum channels.
  arXiv  Detail & Related papers  (2022-11-21T18:33:50Z)
• Quantifying non-stabilizerness via information scrambling [0.6993026261767287]
  A method to quantify quantum resources is to use a class of functions called magic monotones and stabilizer entropies. We numerically show the relation of these sampled correlators to different non-stabilizerness measures for both qubit and qutrit systems. We put forward and simulate a protocol to measure the monotonic behaviour of magic for the time evolution of local Hamiltonians.
  arXiv  Detail & Related papers  (2022-04-24T10:12:47Z)
• On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization [55.937424268654645]
  We consider algorithm-independent lower bounds for the problem of black-box optimization of functions having a bounded norm. We provide a novel proof technique for deriving lower bounds on the regret, with benefits including simplicity, versatility, and an improved dependence on the error probability.
  arXiv  Detail & Related papers  (2020-08-20T03:48:14Z)

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.