Predictability as a quantum resource

• URL: http://arxiv.org/abs/2107.13468v2
• Date: Mon, 23 May 2022 15:42:12 GMT
• Title: Predictability as a quantum resource
• Authors: Marcos L. W. Basso and Jonas Maziero
• Abstract summary: We show that for a system prepared in a state $rho$, $P$ of $rho$, with reference to an observable $X$, is equal to $C$. We also give a resource theory for predictability, identifying its free quantum states and free quantum operations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Just recently, complementarity relations (CRs) have been derived from the basic rules of Quantum Mechanics. The complete CRs are equalities involving quantum coherence, $C$, quantum entanglement, and predictability, $P$. While the first two are already quantified in the resource theory framework, such a characterization lacks for the last. In this article, we start showing that, for a system prepared in a state $\rho$, $P$ of $\rho$, with reference to an observable $X$, is equal to $C$, with reference to observables mutually unbiased (MU) to $X$, of the state $\Phi_{X}(\rho)$, which is obtained from a non-revealing von Neumann measurement (NRvNM) of $X$. We also show that $P^X(\rho)>C^{Y}(\Phi_{X}(\rho))$ for observables not MU. Afterwards, we provide quantum circuits for implementing NRvNMs and use these circuits to experimentally test these (in)equalities using the IBM's quantum computers. Furthermore, we give a resource theory for predictability, identifying its free quantum states and free quantum operations and discussing some predictability monotones. Besides, after applying one of these predictability monotones to study bipartite systems, we discuss the relation among the resource theories of quantum coherence, predictability, and purity.

Related papers

• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma. This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles. Even with sublinear barriers, we use Feynman-Kac techniques to lift classical to quantum ones establishing tight lower bound $T_mathrmmix = 2Omega(nalpha)$.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• 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)
• Non-Heisenbergian quantum mechanics [0.0]
  Relaxing the postulates of an axiomatic theory is a natural way to find more general theories. Here, we use this way to extend quantum mechanics by ignoring the heart of Heisenberg's quantum mechanics. Perhaps surprisingly, this non-Heisenberg quantum theory, without a priori assumption of the non-commutation relation, leads to a modified Heisenberg uncertainty relation.
  arXiv  Detail & Related papers  (2024-02-17T18:00:07Z)
• Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis [39.889087719322184]
  We study the generalization properties of quantum classifiers adversarially trained against bounded-norm white-box attacks. We derive novel information-theoretic upper bounds on the generalization error of adversarially trained quantum classifiers.
  arXiv  Detail & Related papers  (2024-01-31T21:07:43Z)
• An Updated Quantum Complementarity Principle [0.0]
  Bohr's complementarity principle has long been a fundamental concept in quantum mechanics. Recent advancements demonstrate that quantum complementarity relations can be rigorously derived from the axioms of quantum mechanics.
  arXiv  Detail & Related papers  (2023-12-05T13:10:10Z)
• Quantum Heavy-tailed Bandits [36.458771174473924]
  We study multi-armed bandits (MAB) and linear bandits (SLB) with heavy-tailed rewards and quantum reward. We first propose a new quantum mean estimator for heavy-tailed distributions, which is based on the Quantum Monte Carlo Estimator. Based on our quantum mean estimator, we focus on quantum heavy-tailed MAB and SLB and propose quantum algorithms based on the Upper Confidence Bound (UCB) framework.
  arXiv  Detail & Related papers  (2023-01-23T19:23:10Z)
• 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)
• Relative Facts of Relational Quantum Mechanics are Incompatible with Quantum Mechanics [0.0]
  RQM measurement arise from interactions which entangle a system $$S and an observer $A$ without decoherence. The criterion states that whenever an interpretation introduces a notion of outcomes, these outcomes must follow the probability distribution specified by the Born rule.
  arXiv  Detail & Related papers  (2022-08-24T23:15:00Z)
• Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum Ans\"atze [13.651587339535961]
  We develop a framework for convolutional quantum circuits with SU$(d)$symmetry. We prove Harrow's statement on equivalence between $nameSU(d)$ and $S_n$ irrep bases.
  arXiv  Detail & Related papers  (2021-12-14T18:03:43Z)
• Symmetric distinguishability as a quantum resource [21.071072991369824]
  We develop a resource theory of symmetric distinguishability, the fundamental objects of which are elementary quantum information sources. We study the resource theory for two different classes of free operations: $(i)$ $rmCPTP_A$, which consists of quantum channels acting only on $A$, and $(ii)$ conditional doubly (CDS) maps acting on $XA$.
  arXiv  Detail & Related papers  (2021-02-24T19:05:02Z)
• 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.