Quantum machines powered by correlated baths
نویسندگان
چکیده
منابع مشابه
Decoherence by engineered quantum baths
Davide Rossini, Tommaso Calarco, 3 Vittorio Giovannetti, Simone Montangero, 4 and Rosario Fazio 1 NEST-CNR-INFM & Scuola Normale Superiore, piazza dei Cavalieri 7, I-56126 Pisa, Italy Dipartimento di Fisica, Università di Trento and BEC-CNR-INFM, I-38050 Povo, Italy ITAMP, Harvard-Smithsonian Center for Astrophysics, Cambridge, MA 02138, USA Institut für Theoretische Festkörperphysik, Universit...
متن کاملCorrelated electron-phonon transport from molecular dynamics with quantum baths
Based on generalized quantum Langevin equations for the tight-binding wave function amplitudes and lattice displacements, electron and phonon quantum transport are obtained exactly using molecular dynamics (MD) in the ballistic regime. The electron-phonon interactions can be handled with a quasi-classical approximation. Both charge and energy transport and their interplay can be studied. We com...
متن کاملThermalization of quantum systems by finite baths
– We consider a discrete quantum system coupled to a finite bath, which may consist of only one particle, in contrast to the standard baths which usually consist of continua of oscillators, spins, etc. We find that such finite baths may nevertheless equilibrate the system though not necessarily in the way predicted by standard open system techniques. This behavior results regardless of the init...
متن کاملVibrational spectra of polyatomic molecules assisted by quantum thermal baths.
We assess the performance of colored-noise thermostats to generate quantum mechanical initial conditions for molecular dynamics simulations, in the context of infrared spectra of large polyatomic molecules. Comparison with centroid molecular dynamics simulations taken as reference shows that the method is accurate in predicting line shifts and band widths in the ionic cluster (NaCl)(32) and in ...
متن کاملSimulations of Quantum Turing Machines by Quantum Multi-Stack Machines
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines M , there exists quantum Boolean circuit (n, t)-simulating M , where n denotes the length of input strings, and t is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Research
سال: 2020
ISSN: 2643-1564
DOI: 10.1103/physrevresearch.2.033315