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

Carlo Cafaro, Shannon Ray, and Paul M. Alsing
Phys. Rev. E 105, 034143 – Published 31 March 2022

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. Specifically, starting from pure output quantum states describing the evolution of a spin-1/2 particle in an external time-dependent magnetic field, we consider the probability paths emerging from the parametrized squared probability amplitudes of quantum origin. The information manifold of such paths is equipped with a Riemannian metrization specified by the Fisher information evaluated along the parametrized squared probability amplitudes. 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. Moreover, we determine that the efficiency and the temporal rate of change of the IGC are monotonic decreasing and increasing functions, respectively, of the constant entropic speed along these optimum paths. Then, after discussing the connection between thermodynamic length and IGC in the physical scenarios being analyzed, we briefly examine the link between IGC and entropy production rate. 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.

  • Figure
  • Figure
  • Received 23 July 2021
  • Accepted 11 March 2022

DOI:https://doi.org/10.1103/PhysRevE.105.034143

©2022 American Physical Society

Physics Subject Headings (PhySH)

Statistical Physics & ThermodynamicsQuantum Information, Science & Technology

Authors & Affiliations

Carlo Cafaro1, Shannon Ray2, and Paul M. Alsing2

  • 1SUNY Polytechnic Institute, Albany, New York 12203, USA
  • 2Air Force Research Laboratory, Information Directorate, Rome, New York 13441, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 105, Iss. 3 — March 2022

Reuse & Permissions
Access Options
CHORUS

Article Available via CHORUS

Download Accepted Manuscript
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×