Quantum Computing by Coherent Cooling

  title={Quantum Computing by Coherent Cooling},
  author={Jiajin Feng and Biao Wu and Frank Wilczek},
  journal={Physical Review A},
Interesting problems in quantum computation take the form of finding low-energy states of spin systems with engineered Hamiltonians that encode the problem data. Motivated by the practical possibility of producing very low-temperature spin systems, we propose and exemplify the possibility to compute by coupling the computational spins to a non-Markovian bath of spins that serve as a heat sink. We demonstrate both analytically and numerically that this strategy can achieve quantum advantage in… 

Figures from this paper


Adiabatic quantum computation is equivalent to standard quantum computation
The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown, so this result implies that the adiABatic computation model and the standard quantum circuit model are polynomially equivalent.
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.
Achievable Polarization for Heat-Bath Algorithmic Cooling.
This work investigates the achievable polarization by analyzing the limit when no more entropy can be extracted from the system and gives an analytic form for the maximum polarization achievable for the case when the initial state of the qubits is totally mixed.
Quantum phases of matter on a 256-atom programmable quantum simulator.
This work demonstrates a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms, featuring strong interactions controlled by coherent atomic excitation into Rydberg states, and realizes a quantum spin model with tunable interactions for system sizes ranging from 64 to 256 qubits.
Demonstration of a Nonstoquastic Hamiltonian in Coupled Superconducting Flux Qubits
Quantum annealing (QA) is a heuristic algorithm for finding low-energy configurations of a system, with applications in optimization, machine learning, and quantum simulation. Up to now, all
Initialization of quantum simulators by sympathetic cooling
It is shown that already a single dissipatively driven auxiliary particle can efficiently prepare the quantum simulator in a low-energy state of largely arbitrary Hamiltonians.
Quantum annealing with manufactured spins
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.
Resonant Quantum Search with Monitor Qubits
An algorithm for the generalized search problem based on a continuous Hamiltonian and exploiting resonance that has the same time complexity O(N/k) as the Grover algorithm is presented.
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
This paper shows that this algorithm for exhaustive search can be implemented by replacing the W-H transform by almost any quantum mechanical operation, which leads to several new applications where it improves the number of steps by a square-root.
Cyclic cooling of quantum systems at the saturation limit
The achievable bounds of cooling quantum systems, and the possibility to violate them is not well-explored experimentally. For example, among the common methods to enhance spin polarization