Bounding generalized relative entropies: Nonasymptotic quantum speed limits

• URL: http://arxiv.org/abs/2008.12192v2
• Date: Mon, 8 Mar 2021 16:00:16 GMT
• Title: Bounding generalized relative entropies: Nonasymptotic quantum speed limits
• Authors: Diego Paiva Pires, Kavan Modi, Lucas Chibebe C\'eleri
• Abstract summary: Information theory has become an increasingly important research field to better understand quantum mechanics. Relative entropy quantifies how difficult is to tell apart two probability distributions, or even two quantum states. We show how this quantity changes under a quantum process.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Information theory has become an increasingly important research field to better understand quantum mechanics. Noteworthy, it covers both foundational and applied perspectives, also offering a common technical language to study a variety of research areas. Remarkably, one of the key information-theoretic quantities is given by the relative entropy, which quantifies how difficult is to tell apart two probability distributions, or even two quantum states. Such a quantity rests at the core of fields like metrology, quantum thermodynamics, quantum communication and quantum information. Given this broadness of applications, it is desirable to understand how this quantity changes under a quantum process. By considering a general unitary channel, we establish a bound on the generalized relative entropies (R\'{e}nyi and Tsallis) between the output and the input of the channel. As an application of our bounds, we derive a family of quantum speed limits based on relative entropies. Possible connections between this family with thermodynamics, quantum coherence, asymmetry and single-shot information theory are briefly discussed.

Related papers

• Quantum Conditional Entropies [7.988085110283119]
  We introduce a comprehensive family of conditional entropies that reveals a unified structure underlying all previously studied forms of quantum conditional R'enyi entropies. This new family satisfies a range of desiderata, including data processing inequalities, additivity under tensor products, duality relations, chain rules, concavity or convexity, and various parameter monotonicity relations. We expect this family of entropies, along with our generalized chain rules, to find applications in quantum cryptography and information theory.
  arXiv  Detail & Related papers  (2024-10-29T12:03:10Z)
• One-Shot Min-Entropy Calculation And Its Application To Quantum Cryptography [21.823963925581868]
  We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state. It gives an alternative tight finite-data analysis for the well-known BB84 quantum key distribution protocol. It provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol.
  arXiv  Detail & Related papers  (2024-06-21T15:11:26Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantitative bounds to propagation of quantum correlations in many-body systems [0.0]
  We establish limits to bipartite quantum correlations in many-body systems. Results confirm that proliferation of classical information in the Universe suppresses quantum correlations.
  arXiv  Detail & Related papers  (2023-10-04T00:24:06Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Unraveling the Mystery of Quantum Measurement with A New Space-Time Approach to Relativistic Quantum Mechanics [9.116661570248171]
  Quantum measurement is a fundamental concept in the field of quantum mechanics. Despite its significance, four fundamental issues continue to pose significant challenges to the broader application of quantum measurement. We employ a new space-time approach to relativistic quantum mechanics to address these issues systematically.
  arXiv  Detail & Related papers  (2023-06-01T13:25:08Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• A thorough introduction to non-relativistic matrix mechanics in multi-qudit systems with a study on quantum entanglement and quantum quantifiers [0.0]
  This article provides a deep and abiding understanding of non-relativistic matrix mechanics. We derive and analyze the respective 1-qubit, 1-qutrit, 2-qubit, and 2-qudit coherent and incoherent density operators. We also address the fundamental concepts of quantum nondemolition measurements, quantum decoherence and, particularly, quantum entanglement.
  arXiv  Detail & Related papers  (2021-09-14T05:06:47Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Experimental Validation of Fully Quantum Fluctuation Theorems Using Dynamic Bayesian Networks [48.7576911714538]
  Fluctuation theorems are fundamental extensions of the second law of thermodynamics for small systems. We experimentally verify detailed and integral fully quantum fluctuation theorems for heat exchange using two quantum-correlated thermal spins-1/2 in a nuclear magnetic resonance setup.
  arXiv  Detail & Related papers  (2020-12-11T12:55:17Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.