Related papers: Algorithmic Cooling of a Quantum Simulator
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We discuss the possibility of preparing highly entangled states by simply cooling atoms into the ground state of an applied interaction Hamiltonian. As in laser sideband cooling, we take advantage of a relatively large detuning of the…
Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics, to general optimization problems.…
Simulating computationally intractable many-body problems on a quantum simulator holds great potential to deliver insights into physical, chemical, and biological systems. While the implementation of Hamiltonian dynamics within a quantum…
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…
Preparation of low-energy quantum many-body states has a wide range of applications in quantum information processing and condensed matter physics. Quantum cooling algorithms offer a promising alternative to other methods based, for…
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…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
A measurement-based quantum computer could consist of a local-gapped Hamiltonian system, whose thermal states --at sufficiently low temperature-- are universal resources for the computation. Initialization of the computer would correspond…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
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…
In the current era of noisy quantum devices, there is a need for quantum algorithms that are efficient and robust against noise. Towards this end, we introduce the projected cooling algorithm for quantum computation. The projected cooling…
We present a new approach to study the thermodynamic properties of $d$-dimensional classical systems by reducing the problem to the computation of ground state properties of a $d$-dimensional quantum model. This classical-to-quantum mapping…
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…
Algorithmic cooling can be used to find correlated states of many-body quantum systems. It is based on quantum circuits that perform nonunitary operations, whose implementation can be challenging on near-term quantum computers. In this work…
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog…
Quantum annealers are an alternative approach to quantum computing which make use of the adiabatic theorem to efficiently find the ground state of a physically realizable Hamiltonian. Such devices are currently commercially available and…
Interesting problems in quantum computation take the form of finding low-energy states of (pseudo)spin systems with engineered Hamiltonians that encode the problem data. Motivated by the practical possibility of producing very…
We present a hybrid quantum-classical algorithm to simulate thermal states of a classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…