相关论文: Comment on "Nonadiabatic Conditional Geometric Pha…
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…
Nonadiabatic holonomic quantum computation has been proposed as a method to implement quantum logic gates with robustness comparable to that of adiabatic holonomic gates but with shorter execution times. In this paper, we establish an…
Quantum computation has demonstrated advantages over classical computation for special hard problems, where a set of universal quantum gates is essential. Geometric phases, which have built-in resilience to local noise, have been used to…
Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…
We present a new approach to quantum computation involving the geometric phase. In this approach, an entire computation is performed by adiabatically evolving a suitably chosen quantum system in a closed circuit in parameter space. The…
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…
In this letter, we point out that the widely used quantitative conditions in the adiabatic theorem are insufficient in that they do not guarantee the validity of the adiabatic approximation. We also reexamine the inconsistency issue raised…
Nonadiabatic geometric quantum computation (NGQC) has been developed to realize fast and robust geometric gate. However, the conventional NGQC is that all of the gates are performed with exactly the sameamount of time, whether the geometric…
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
Nonadiabatic holonomic quantum computation as one of the key steps to achieve fault tolerant quantum information processing has so far been realized in a number of physical settings. However, in some physical systems particularly in spin…
Diabatic quantum annealing aims to mitigate the challenges posed by small energy gaps and decoherence in quantum optimization by exploiting nonadiabatic transitions. In this paper, we compare the performance of two diabatic protocols in a…
We introduce non-adiabatic semiclassical dressed states for a quantum system interacting with an electromagnetic field of variable amplitude and phase, and presence of dumping. We also introduce a generalized adiabatic condition, which…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
We explore nonadiabatic quantum phase transitions in an Ising spin chain with a linearly time-dependent transverse field and two different spins per unit cell. Such a spin system passes through critical points with gapless excitations,…
We show that a novel, general phase space mapping Hamiltonian for nonadiabatic systems, which is reminiscent of the renowned Meyer-Miller mapping Hamiltonian, involves a commutator variable matrix rather than the conventional…
Nonadiabatic transition dynamics lies at the core of many electron/hole transfer, photoactivated, and vacuum field-coupled processes. About a century after Ehrenfest proposed "Phasenraum" and the Ehrenfest theorem, we report a conceptually…
In this review, after providing the basic physical concept behind quantum annealing (or adiabatic quantum computation), we present an overview of some recent theoretical as well as experimental developments pointing to the issues which are…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…