Related papers: Decoherence in adiabatic quantum computation
We consider the effects of decoherence on Landau-Zener crossings encountered in a large-scale adiabatic-quantum-computing setup. We analyze the dependence of the success probability, i.e. the probability for the system to end up in its new…
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of…
We analyze the performance of adiabatic quantum computation (AQC) under the effect of decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast…
I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds…
The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by the…
In this paper, decoherence is studied for quantum systems undergoing adiabatic processes, which are coupled to huge quantum environments. It is shown that decoherence can happen with respect to a preferred basis given by transient…
For the adiabatic version of Grover's quantum search algorithm as proposed by Roland and Cerf, we study the impact of decoherence caused by a rather general coupling to some environment. For quite generic conditions, we find that the…
Despite more than a decade of research on adiabatic quantum computation (AQC), its decoherence properties are still poorly understood. Many theoretical works have suggested that AQC is more robust against decoherence, but a quantitative…
Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum…
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical…
Motivated by the similarity between adiabatic quantum algorithms and quantum phase transitions, we study the impact of decoherence on the sweep through a second-order quantum phase transition for the prototypical example of the Ising chain…
Adiabatic quantum computation (AQC) is a promising counterpart of universal quantum computation, based on the key concept of quantum annealing (QA). QA is claimed to be at the basis of commercial quantum computers and benefits from the fact…
The codespace of a quantum error-correcting code can often be identified with the degenerate ground-space within a gapped phase of quantum matter. We argue that the stability of such a phase is directly related to a set of coherent error…
A scalable superconducting architecture for adiabatic quantum computers is proposed. The architecture is based on time-independent, nearest-neighbor interqubit couplings: it can handle any problem in the class NP even in the presence of…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
Suppressing undesired nonunitary effects is a major challenge in quantum computation and quantum control. In this work, by considering the adiabatic dynamics in presence of a surrounding environment, we theoretically and experimentally…
Adiabatic quantum computing (AQC) is a promising approach for discrete and often NP-hard optimization problems. Current AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for…
Non-adiabatic holonomic quantum computation in decoherence-free subspaces protects quantum information from control imprecisions and decoherence. For the non-collective decoherence that each qubit has its own bath, we show the…
We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of…
Decoherence of quantum states is a major hurdle towards scalable and reliable quantum computing. Lower decoherence (i.e., higher fidelity) can alleviate the error correction overhead and obviate the need for energy-intensive noise reduction…