Related papers: Quantum algorithms for cooling: a simple case stud…

Heat-bath algorithmic cooling (HBAC) provides algorithmic ways to improve the purity of quantum states. These techniques are complex iterative processes that change from each iteration to the next and this poses a significant challenge to…

We study the problem of dynamic cooling whereby a target qubit is cooled at the expense of heating up $N-1$ further identical qubits, by means of a global unitary operation. A standard back-of-the-envelope high temperature estimate…

Algorithmic cooling shows that it is possible to locally reduce the entropy of a qubit belonging to an isolated ensemble such as nuclear spins in molecules or nitrogen-vacancy centers in diamonds. In the same physical setting, we introduce…

Engineering design processes involve iterative design evaluations requiring numerous computationally intensive numerical simulations. Quantum algorithms promise substantial speedups for specific tasks relevant to engineering simulations.…

Cooling a mechanical mode to its motional ground state opens up avenues for both scientific and technological advancements in the field of quantum meteorology and information processing. We propose a multi-parameter optimization scheme for…

Cooling down a trapped ion into its motional ground state is a central step for trapped ions based quantum information processing. State of the art cooling schemes often work under a set of optimal cooling conditions derived analytically…

Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which…

Algorithmic cooling is a potentially important technique for making scalable NMR quantum computation feasible in practice. Given the constraints imposed by this approach to quantum computing, the most likely cooling algorithms to be…

Heat-Bath Algorithmic Cooling is a set of techniques for producing highly pure quantum systems by utilizing a surrounding heat-bath and unitary interactions. These techniques originally used the thermal environment only to fully thermalize…

Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by…

Algorithmic cooling methods manipulate an open quantum system in order to lower its temperature below that of the environment. We show that significant cooling is achieved on an ensemble of spin-pair systems by exploiting the long-lived…

We consider the problem of finding the energy minimum of a complex quantum Hamiltonian by employing a non-Markovian bath prepared in a low energy state. The energy minimization problem is thus turned into a thermodynamic cooling protocol in…

Controlled preparation of highly pure quantum states is at the core of practical applications of quantum information science, from the state initialization of most quantum algorithms to a reliable supply of ancilla qubits that satisfy the…

Refrigeration limits are of fundamental and practical importance. We here show that quantum systems can be cooled below existing incoherent cooling bounds by employing coherent virtual qubits, even if the amount of coherence is incompletely…

We describe a quantum computer based upon the coherent manipulation of two-level atoms between discrete one-dimensional momentum states. Combinations of short laser pulses with kinetic energy dependent free phase evolution can perform the…

Dissipative processes have long been proposed as a means of performing computational tasks on quantum computers that may be intrinsically more robust to noise. In this work, we prove two main results concerning the error-resilience…

Dissipation and the accompanying fluctuations are often seen as detrimental for quantum systems, since they are associated with fast relaxation and loss of phase coherence. However, it has been proposed that a pure state can be prepared if…

Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical system allows us to reduce the…

We introduce a method for digital preparation of ground states of simulated Hamiltonians, inspired by cooling in nature and adapted to leverage the capabilities of digital quantum hardware. The cold bath is simulated by a single ancillary…

We propose a simple, robust protocol to prepare a low-energy state of an arbitrary Hamiltonian on a quantum computer or programmable quantum simulator. The protocol is inspired by the adiabatic demagnetization technique, used to cool…