Related papers: Self-protected adiabatic quantum computation
Efficacious quantum information processing relies on extended coherence and precise control. Investigating the limitations surrounding quantum processors is vital for their advancement. In their operation, one challenge is inadvertent wave…
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors,…
Geometric phases depend only on the evolution path determined by the closed circuit in the projective Hilbert space but not on evolution details of the quantum system, leading to geometric quantum computation possessing some intrinsic…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
Coherent interaction of a quantum system with environment usually induces quantum decoherence. However, remarkably, in certain configurations the coherent system-environment coupling can be simultaneously explored to engineer a specific…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic evolution has been used to design and reproduce quantum…
Quantum information requires protection from the adverse affects of decoherence and noise. This review provides an introduction to the theory of decoherence-free subspaces, noiseless subsystems, and dynamical decoupling. It addresses…
The construction of large, coherent quantum systems necessary for quantum computation remains an entreating but elusive goal, due to the ubiquitous nature of decoherence. Recent progress in quantum error correction schemes have given new…
Proposals for quantum computing devices are many and varied. They each have unique noise processes that make none of them fully reliable at this time. There are several error correction/avoidance techniques which are valuable for reducing…
Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the…
The information in quantum computers is often stored in identical two-level systems (spins or pseudo-spins) that are separated by a distance shorter than the characteristic wavelength of a reservoir which is responsible for decoherence. In…
We investigate decoherence effects in the recently suggested quantum computation scheme using weak nonlinearities, strong probe coherent fields, detection and feedforward methods. It is shown that in the weak-nonlinearity-based quantum…
Nonadiabatic holonomic quantum computation has robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates…
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optimization problems. We demonstrate our approach on Grover's problem of finding a marked item inside of unsorted database. We show that the…
The search operation for a marked state by means of Grover's quantum searching algorithm is shown to be an element of group SU(2) which acts on a 2-dimensional space spanned by the marked state and the unmarked collective state. Based on…
Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…
The interaction of a quantum system with its environment causes decoherence, setting a fundamental limit on the suitability of a system for quantum information processing. However, we show that if the quantum system consists of coupled…
Two-dimensional topological states of matter offer a route to quantum computation that would be topologically protected against the nemesis of the quantum circuit model: decoherence. Research groups in industry, government and academic…