Bulletin of the American Physical Society
APS March Meeting 2017
Volume 62, Number 4
Monday–Friday, March 13–17, 2017; New Orleans, Louisiana
Session S19: Nanothermodynamics and Quantum InformationInvited
|
Hide Abstracts |
Sponsoring Units: GQI GSNP Chair: Sebastian Deffner Room: 278-279 |
Thursday, March 16, 2017 11:15AM - 11:51AM |
S19.00001: Fluctuation theorems, optimal control, and information engines Invited Speaker: Gavin Crooks |
Thursday, March 16, 2017 11:51AM - 12:27PM |
S19.00002: Exploring quantum thermodynamics in continuous measurement of superconducting qubits Invited Speaker: Kater Murch The extension of thermodynamics into the realm of quantum mechanics, where quantum fluctuations dominate and systems need not occupy definite states, poses unique challenges. Superconducting quantum circuits offer exquisite control over the environment of simple quantum systems allowing the exploration of thermodynamics at the quantum level through measurement and feedback control. We use a superconducting transmon qubit that is resonantly coupled to a waveguide cavity as an effectively one-dimensional quantum emitter. By driving the emitter and detecting the fluorescence with a near-quantum-limited Josephson parametric amplifier, we track the evolution of the quantum state and characterize the work and heat along single quantum trajectories. By using quantum feedback control to compensate for heat exchanged with the emitter's environment we are able to extract the work statistics associated with the quantum evolution and examine fundamental fluctuation theorems in non-equilibrium thermodynamics. [Preview Abstract] |
Thursday, March 16, 2017 12:27PM - 1:03PM |
S19.00003: Nanothermodynamics in the strong coupling regime Invited Speaker: Christopher Jarzynski In macroscopic thermodynamics, energy gained by a system is lost by its surroundings (or vice-versa), in accordance with the first law of thermodynamics. However, if the system-environment interaction energy cannot be neglected -- as in the case of a microscopic system such as a single molecule in solution -- then it is not immediately clear where to draw the line between the energy of the system and that of the environment. To which subsystem does the interaction energy belong? I will describe a microscopic formulation of both the first and second laws of thermodynamics that applies to this situation. In this framework, seven key thermodynamic quantities -- internal energy, entropy, volume, enthalpy, Gibbs free energy, heat and work -- are given precise microscopic definitions, and the first and second laws are preserved without requiring corrections due to finite system-environment coupling. Furthermore, these definitions reduce to the usual ones in the limit of macroscopic systems of interest. This condition establishes that a unifying framework can be developed, encompassing stochastic thermodynamics at one end and macroscopic thermodynamics at the other. A central element of this framework is a thermodynamic definition of the volume of the system of interest, which converges to the usual geometric definition when the system is large. [Preview Abstract] |
Thursday, March 16, 2017 1:03PM - 1:39PM |
S19.00004: Extending Landauer’s bound from bit erasure to arbitrary computation Invited Speaker: David Wolpert The minimal thermodynamic work required to erase a bit, known as Landauer’s bound, has been extensively investigated both theoretically and experimentally. However, when viewed as a computation that maps inputs to outputs, bit erasure has a very special property: the output does not depend on the input. Existing analyses of thermodynamics of bit erasure implicitly exploit this property, and thus cannot be directly extended to analyze the computation of arbitrary input-output maps. Here we show how to extend these earlier analyses of bit erasure to analyze the thermodynamics of arbitrary computations. Doing this establishes a formal connection between the thermodynamics of computers and much of theoretical computer science. We use this extension to analyze the thermodynamics of the canonical ``general purpose computer’’ considered in computer science theory: a universal Turing machine (UTM). We consider a UTM which maps input programs to output strings, where inputs are drawn from an ensemble of random binary sequences, and prove: i) The minimal work needed by a UTM to run some particular input program X and produce output Y is the Kolmogorov complexity of Y minus the log of the ``algorithmic probability’’ of Y. This minimal amount of thermodynamic work has a finite upper bound, which is independent of the output Y, depending only on the details of the UTM. ii) The expected work needed by a UTM to compute some given output Y is infinite. As a corollary, the overall expected work to run a UTM is infinite. iii) The expected work needed by an arbitrary Turing machine T (not necessarily universal) to compute some given output Y can either be infinite or finite, depending on Y and the details of T. To derive these results we must combine ideas from nonequilibrium statistical physics with fundamental results from computer science, such as Levin’s coding theorem and other theorems about universal computation. [Preview Abstract] |
Thursday, March 16, 2017 1:39PM - 2:15PM |
S19.00005: Trade-off between speed and cost in shortcuts to adiabaticity Invited Speaker: Steve Campbell Recent years have witnessed a surge of interest in the study of thermal nano-machines that are capable of converting disordered forms of energy into useful work. It has been shown for both classical and quantum systems that external drivings can allow a system to evolve adiabatically even when driven in finite time, a technique commonly known as shortcuts to adiabaticity. \\\\ It was suggested to use such external drivings to render the unitary processes of a thermodynamic cycle quantum adiabatic, while being performed in finite time. However, implementing an additional external driving requires resources that should be accounted for. Furthermore, and in line with natural intuition, these transformations should not be achievable in arbitrarily short times. \\\\ First, we will present a computable measure of the cost of a shortcut to adiabaticity. Using this, we then examine the speed with which a quantum system can be driven. As a main result, we will establish a rigorous link between this speed, the quantum speed limit, and the (energetic) cost of implementing such a shortcut to adiabaticity. Interestingly, this link elucidates a trade-off between speed and cost, namely that instantaneous manipulation is impossible as it requires an infinite cost. [Preview Abstract] |
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2024 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700