Related papers: Projected Cooling Algorithm for Quantum Computatio…
We discuss an explicit protocol which allows one to externally cool and control a composite system by operating on a small subset of it. The scheme permits to transfer arbitrary and unknown quantum states from a memory on the network…
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…
We propose and analyze several schemes for cooling bosonic and fermionic atoms in an optical lattice potential close to the ground state of the no-tunnelling regime. Some of the protocols rely on the concept of algorithmic cooling, which…
Inspired by simulated annealing algorithm, we propose a quantum cooling protocol which includes an annealing process. This protocol can be universally and efficiently applied to various quantum simulators, driving the system from an…
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…
We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique further develops tools from many-body physics - based on finitely correlated or projected entangled pair states -…
We introduce the idea of actually cooling quantum systems by means of incoherent thermal light, hence giving rise to a counter-intuitive mechanism of "cooling by heating". In this effect, the mere incoherent occupation of a quantum…
Invasiveness of quantum measurements is a genuinely quantum mechanical feature that is not necessarily detrimental: Here we show how quantum measurements can be used to fuel a cooling engine. We illustrate quantum measurement cooling (QMC)…
It is proposed that the ability for a quantum circuit to thermalize under time evolution is a valid way to compute linear algebra problems. The algorithm makes use of the eigenstate thermalization hypothesis and full ergodicity in quantum…
It is generally considered that the signal output by a quantum circuit is attenuated exponentially fast in the number of gates. This letter explores how algorithms using mid-circuit measurements and classical conditioning as computational…
Reducing noise in quantum systems is a major challenge towards the application of quantum technologies. Here, we propose and demonstrate a scheme to reduce noise using a quantum autoencoder with rigorous performance guarantees. The quantum…
Limited by today's physical devices, quantum circuits are usually noisy and difficult to be designed deeply. The novel computing architecture of distributed quantum computing is expected to reduce the noise and depth of quantum circuits. In…
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is…
In this work, we study the pairing Hamiltonian with four particles at finite temperatures on a quantum simulator and a superconducting quantum computer. The excited states are obtained by the variational quantum deflation (VQD). The…
We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…
One of the limitations to the quantum computing capability of a continuous-variable system is determined by our ability to cool it to the ground state, because pure logical states, in which we accurately encode quantum information, are…
Over the last decades, there have been many proposals for quantum computation. One of the promising candidates is adiabatic quantum computation (AQC). The central idea of AQC is about finding the ground state of a system with a problem…
Storing quantum information for long times without disruptions is a major requirement for most quantum information technologies. A very appealing approach is to use self-correcting Hamiltonians, i.e. tailoring local interactions among the…