Related papers: Non-adiabatic geometric quantum computation with t…
Adiabatic quantum optimization has been proposed as a route to solve NP-complete problems, with a possible quantum speedup compared to classical algorithms. However, the precise role of quantum effects, such as entanglement, in these…
Conditional geometric phase shift gate, which is fault tolerate to certain errors due to its geometric property, is made by NMR technique recently under adiabatic condition. By the adiabatic requirement, the result is inexact unless the…
The theoretical investigation of non-adiabatic processes is hampered by the complexity of the coupled electron-nuclear dynamics beyond the Born-Oppenheimer approximation. Classically, the simulation of such reactions is limited by the…
We propose a feasible scheme to implement a universal set of quantum gates based on geometric phases and superadiabatic quantum control. Consolidating the advantages of both strategies, the proposed quantum gates are robust and fast. The…
Recently, geometric phases, which is fault tolerate to certain errors intrinsically due to its geometric property, are getting considerable attention in quantum computing theoretically. So far, only one experiment about adiabatic geometric…
Geometric phase has the intrinsic property of being resistant to some types of local noises as it only depends on global properties of the evolution path. Meanwhile, the non-Abelian geometric phase is in the matrix form, and thus can…
One of the difficulties in adiabatic quantum computation is the limit on the computation time. Here we propose two schemes to speed-up the adiabatic evolution. To apply this controlled adiabatic evolution to adiabatic quantum computation,…
Recently, it is proposed to do quantum computation through the Berry's phase(adiabatic cyclic geometric phase) shift with NMR (Jones et al, Nature, 403, 869(2000)). This geometric quantum gate is hopefully to be fault tolerant to certain…
We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different…
The nonadiabatic geometric quantum computation is promising as it is robust against certain types of local noises. However, its experimental implementation is challenging due to the need of complex control on multi-level and/or multiple…
The geometric phase stands as a foundational concept in quantum physics, revealing deep connections between geometric structures and quantum dynamical evolution. Unlike dynamical phases, geometric phases exhibit intrinsic resilience to…
Existing quantum algorithms for quantum chemistry work well near the equilibrium geometry of molecules, but the results can become unstable when the chemical bonds are broken at large atomic distances. For any adiabatic approach, this…
Geometric quantum computation relies on the geometric phase that arises in adiabatic cyclic evolutions of non-degenerate quantum systems, enabling the design of robust quantum gates. However, the adiabatic condition requires long evolution…
Adiabatic $U(2)$ geometric phases are studied for arbitrary quantum systems with a three-dimensional Hilbert space. Necessary and sufficient conditions for the occurrence of the non-Abelian geometrical phases are obtained without actually…
The challenge in building high-fidelity quantum gates lies in overcoming control errors and decoherence effects caused by the coupling between the quantum system and the external environment. Nonadiabatic holonomic quantum computation uses…
On-the-fly quantum nonadiabatic dynamics for large systems greatly benefits from the adiabatic representation readily available from the electronic structure programs. However, frequently occurring in this representation conical…
The conventional formulation of the non-adiabatic (Aharonov-Anandan) phase is based on the equivalence class $\{e^{i\alpha(t)}\psi(t,\vec{x})\}$ which is not a symmetry of the Schr\"{o}dinger equation. This equivalence class when understood…
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…
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…
We study an architecture for implementing adiabatic quantum computation with trapped neutral atoms. Ground state atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism, thereby providing the requisite…