Related papers: Preparing thermal states of quantum systems by dim…
In this paper, we explore the possibility of building a quantum memory that is robust to thermal noise using large $N$ matrix quantum mechanics models. First, we investigate the gauged $SU(N)$ matrix harmonic oscillator and different ways…
Multilevel autonomous quantum thermal machines are discussed. In particular, we explore the relation between the size of the machine (captured by Hilbert space dimension), and the performance of the machine. Using the concepts of virtual…
Quantum systems typically reach thermal equilibrium rather quickly when coupled to a thermal environment. The usual way of bounding the speed of this process is by estimating the spectral gap of the dissipative generator. However the gap,…
In many quantum quench experiments involving cold atom systems the post-quench system can be described by a quantum field theory of free scalars or fermions, typically in a box or in an external potential. We work with free scalars in…
Describing matter at near absolute zero temperature requires understanding a system's quantum ground state and the low energy excitations around it, the quasiparticles, which are thermally populated by the system's contact to a heat bath.…
Landauer's limit on heat dissipation during information erasure is critical as devices shrink, requiring optimal pure-state preparation to minimise errors. However, Nernst's third law states this demands infinite resources in energy, time,…
The long time accumulation of the \textit{random} actions of a single particle "reservoir" on its coupled system can transfer some temperature information of its initial state to the coupled system. This dynamic process can be referred to…
We discuss what kind of quantum channels can enable thermalization processes. We show that in order to determine a system's temperature, a thermometer needs to dynamically gain information about the system's local Hamiltonian and not just…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
Simulating strongly-correlated quantum many-body systems at finite temperatures is a significant challenge in computational physics. In this work, we present a scalable finite-temperature tensor network algorithm for two-dimensional quantum…
The third law of thermodynamics, also known as the Nernst unattainability principle, puts a fundamental bound on how close a system, whether classical or quantum, can be cooled to a temperature near to absolute zero. On the other hand, a…
We present quantitative predictions for quantum simulator experiments on Ising models from trapped ions to Rydberg chains and show how the thermalization, and thus decoherence times, can be controlled by considering common, independent, and…
We upper- and lower-bound the optimal precision with which one can estimate an unknown Hamiltonian parameter via measurements of Gibbs thermal states with a known temperature. The bounds depend on the uncertainty in the Hamiltonian term…
We prove that any one-dimensional (1D) quantum state with small quantum conditional mutual information in all certain tripartite splits of the system, which we call a quantum approximate Markov chain, can be well-approximated by a Gibbs…
We analyze the problem of preparing quantum Gibbs states of lattice spin Hamiltonians with local and commuting terms on a quantum computer and in nature. Our central result is an equivalence between the behavior of correlations in the Gibbs…
We investigate fundamental connections between thermodynamics and quantum information theory. First, we show that the operational framework of thermal operations is nonequivalent to the framework of Gibbs-preserving maps, and we comment on…
The preparation of quantum states, especially cooling, is a fundamental technology for nanoscale devices. The past decade has seen important results related to both the limits of state transformation and the limits to their efficiency --…
Efficient simulation of a quantum system generally relies on structural properties of the quantum state. Motivated by the recent results by Bakshi et al. on the sudden death of entanglement in high-temperature Gibbs states of quantum spin…
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently…
Simulating many-body systems is one of the most promising applications of near-term quantum computers. An important open question is how to efficiently prepare the ground states of arbitrary fermionic Hamiltonians, especially those with…