Eavesdropping on the Decohering Environment: Quantum Darwinism, Amplification, and the Origin of Objective Classical Reality

• URL: http://arxiv.org/abs/2107.00035v2
• Date: Fri, 7 Jan 2022 00:35:35 GMT
• Title: Eavesdropping on the Decohering Environment: Quantum Darwinism, Amplification, and the Origin of Objective Classical Reality
• Authors: Akram Touil, Bin Yan, Davide Girolami, Sebastian Deffner, Wojciech H. Zurek
• Abstract summary: We consider a model based on imperfect c-not gates where all the above can be computed. We find that all relevant quantities, such as the quantum mutual information as well as various bounds on the accessible information exhibit similar behavior.
• Score: 2.6201302445459373
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: "How much information about a system $\mathcal{S}$ can one extract from a fragment $\mathcal{F}$ of the environment $\mathcal{E}$ that decohered it?" is the central question of Quantum Darwinism. To date, most answers relied on the quantum mutual information of $\mathcal{SF}$, or on the Holevo bound on the channel capacity of $\mathcal{F}$ to communicate the classical information encoded in $\mathcal{S}$. These are reasonable upper bounds on what is really needed but much harder to calculate -- the accessible information in the fragment $\mathcal{F}$ about $\mathcal{S}$. We consider a model based on imperfect c-not gates where all the above can be computed, and discuss its implications for the emergence of objective classical reality. We find that all relevant quantities, such as the quantum mutual information as well as various bounds on the accessible information exhibit similar behavior. In the regime relevant for the emergence of objective classical reality this includes scaling independent of the quality of the imperfect c-not gates or the size of $\mathcal{E}$, and even nearly independent of the initial state of $\mathcal{S}$.

Related papers

• New Bounds on Quantum Sample Complexity of Measurement Classes [18.531114735719274]
  This paper studies quantum supervised learning for classical inference from quantum states. The hardness of learning is measured via sample complexity under a quantum counterpart of the well-known probably approximately correct (PAC)
  arXiv  Detail & Related papers  (2024-08-22T18:43:13Z)
• A Theory of Interpretable Approximations [61.90216959710842]
  We study the idea of approximating a target concept $c$ by a small aggregation of concepts from some base class $mathcalH$. For any given pair of $mathcalH$ and $c$, exactly one of these cases holds: (i) $c$ cannot be approximated by $mathcalH$ with arbitrary accuracy. We show that, in the case of interpretable approximations, even a slightly nontrivial a-priori guarantee on the complexity of approximations implies approximations with constant (distribution-free and accuracy-
  arXiv  Detail & Related papers  (2024-06-15T06:43:45Z)
• Locally Tomographic Shadows (Extended Abstract) [0.0]
  LT$(mathcalC,mathbfV)$ describes phenomena observable by local agents controlling systems. Some globally distinct states become locally indistinguishable in LT$(mathcalC,mathbfV)$.
  arXiv  Detail & Related papers  (2023-08-31T06:57:20Z)
• Nonlocality under Computational Assumptions [51.020610614131186]
  A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. We show that there exist (efficient) local producing measurements that cannot be reproduced through randomness and quantum-time computation.
  arXiv  Detail & Related papers  (2023-03-03T16:53:30Z)
• Correspondence between open bosonic systems and stochastic differential equations [77.34726150561087]
  We show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment. A particular system with the form of a discrete nonlinear Schr"odinger equation is analyzed in more detail.
  arXiv  Detail & Related papers  (2023-02-03T19:17:37Z)
• Amplification, inference, and the manifestation of objective classical information [0.0]
  Touil et al. examined a different Holevo quantity, one from a quantum-classical state (a quantum $mathcalS$ to a measured $mathcalF$) When good decoherence is present$x2013$, $mathcalE/mathcalF$, is often accessible by a quantum channel $mathcalE/mathcalF$. For the specific model, the accessible information is related to the error probability for optimal detection and, thus, has the same behavior as the quantum Chern
  arXiv  Detail & Related papers  (2022-06-06T18:00:00Z)
• The Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) Equation for Two-Dimensional Systems [62.997667081978825]
  Open quantum systems can obey the Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) equation. We exhaustively study the case of a Hilbert space dimension of $2$.
  arXiv  Detail & Related papers  (2022-04-16T07:03:54Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Generalization in Quantum Machine Learning: a Quantum Information Perspective [0.0]
  We show how different properties of $Q$ affect classification accuracy and generalization. We introduce a quantum version of the Information Bottleneck principle that allows us to explore the various tradeoffs between accuracy and generalization.
  arXiv  Detail & Related papers  (2021-02-17T19:35:21Z)
• Correlations in geometric states [0.0]
  We show the covex combination of geometric states cannot be a geometric state. By using the Koashi-Winter relation of tripartite states the quantum and classical correlations between $A$ and $B$ can expressed as Holevo information.
  arXiv  Detail & Related papers  (2020-03-09T06:09:25Z)
• A Theory of Usable Information Under Computational Constraints [103.5901638681034]
  We propose a new framework for reasoning about information in complex systems. Our foundation is based on a variational extension of Shannon's information theory. We show that by incorporating computational constraints, $mathcalV$-information can be reliably estimated from data.
  arXiv  Detail & Related papers  (2020-02-25T06:09:30Z)

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.