Complexity and efficiency of minimum entropy production probability paths from quantum dynamical evolutions

• URL: http://arxiv.org/abs/2107.11328v2
• Date: Sat, 2 Apr 2022 11:45:36 GMT
• Title: Complexity and efficiency of minimum entropy production probability paths from quantum dynamical evolutions
• Authors: Carlo Cafaro, Shannon Ray, Paul M. Alsing
• Abstract summary: We present an information geometric characterization of quantum driving schemes specified by su (2;C) time-dependent Hamiltonians. We evaluate the so-called information geometric complexity (IGC) and our newly proposed measure of entropic efficiency.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an information geometric characterization of quantum driving schemes specified by su(2;C) time-dependent Hamiltonians in terms of both complexity and efficiency concepts. By employing a minimum action principle, the optimum path connecting initial and final states on the manifold in finite-time is the geodesic path between the two states. In particular, the total entropy production that occurs during the transfer is minimized along these optimum paths. For each optimum path that emerges from the given quantum driving scheme, we evaluate the so-called information geometric complexity (IGC) and our newly proposed measure of entropic efficiency constructed in terms of the constant entropy production rates that specify the entropy minimizing paths being compared. From our analytical estimates of complexity and efficiency, we provide a relative ranking among the driving schemes being investigated. Finally, we conclude by commenting on the fact that an higher entropic speed in quantum transfer processes seems to necessarily go along with a lower entropic efficiency together with a higher information geometric complexity.

Related papers

• Semidefinite optimization of the quantum relative entropy of channels [3.9134031118910264]
  This paper introduces a method for calculating the quantum relative entropy of channels. It provides efficiently computable upper and lower bounds that sandwich the true value with any desired precision.
  arXiv  Detail & Related papers  (2024-10-21T18:00:01Z)
• Complexity of Quantum-Mechanical Evolutions from Probability Amplitudes [0.0]
  We study the complexity of both time-optimal and time sub-optimal quantum Hamiltonian evolutions connecting arbitrary source and a target states on the Bloch sphere equipped with the Fubini-Study metric.
  arXiv  Detail & Related papers  (2024-08-26T12:54:51Z)
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms [64.10576998630981]
  We show the first tight characterization of the optimal Hessian-dependent sample complexity. A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances. The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
  arXiv  Detail & Related papers  (2023-06-21T17:03:22Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Entropic Neural Optimal Transport via Diffusion Processes [105.34822201378763]
  We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions. Our algorithm is based on the saddle point reformulation of the dynamic version of EOT which is known as the Schr"odinger Bridge problem. In contrast to the prior methods for large-scale EOT, our algorithm is end-to-end and consists of a single learning step.
  arXiv  Detail & Related papers  (2022-11-02T14:35:13Z)
• Minimally dissipative information erasure in a quantum dot via thermodynamic length [0.415623340386296]
  We implement Landauer erasure on a driven electron level in a semiconductor quantum dot. We compare the standard protocol in which the energy is increased linearly in time with the one coming from geometric optimisation. We show experimentally that geodesic drivings minimise dissipation for slow protocols, with a bigger improvement as one approaches perfect erasure.
  arXiv  Detail & Related papers  (2022-09-05T09:20:09Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Low-rank Optimal Transport: Approximation, Statistics and Debiasing [51.50788603386766]
  Low-rank optimal transport (LOT) approach advocated in citescetbon 2021lowrank LOT is seen as a legitimate contender to entropic regularization when compared on properties of interest. We target each of these areas in this paper in order to cement the impact of low-rank approaches in computational OT.
  arXiv  Detail & Related papers  (2022-05-24T20:51:37Z)
• Information Geometric Aspects of Probability Paths with Minimum Entropy Production for Quantum State Evolution [0.0]
  We show a correspondence between a faster transfer and a higher rate of entropy production. We conclude that higher entropic speed is associated with lower entropic efficiency within the context of quantum state transfer.
  arXiv  Detail & Related papers  (2020-07-06T13:16:28Z)
• Information Geometry Aspects of Minimum Entropy Production Paths from Quantum Mechanical Evolutions [0.0]
  We show that to a faster transfer there corresponds necessarily a higher entropy production rate. We employ a minimum action method to transfer a quantum system from an initial state to a final state on the manifold.
  arXiv  Detail & Related papers  (2020-02-06T13:23:22Z)
• A Near-Optimal Gradient Flow for Learning Neural Energy-Based Models [93.24030378630175]
  We propose a novel numerical scheme to optimize the gradient flows for learning energy-based models (EBMs) We derive a second-order Wasserstein gradient flow of the global relative entropy from Fokker-Planck equation. Compared with existing schemes, Wasserstein gradient flow is a smoother and near-optimal numerical scheme to approximate real data densities.
  arXiv  Detail & Related papers  (2019-10-31T02:26:20Z)

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.