Related papers: Approach to realizing nonadiabatic geometric gates…
The geometric phase acquired by the vector states under an adiabatic evolution along a noncyclic path can be calculated correctly in any instantaneous basis of a Hamiltonian that varies in time due to a time-dependent classical field.
Geometric phases, arising from cyclic evolutions in a curved parameter space, appear in a wealth of physical settings. Recently, and largely motivated by the need of an experimentally realistic definition for quantum computing applications,…
Quantum technologies based on adiabatic techniques can be highly effective, but often at the cost of being very slow. Here we introduce a set of experimentally realistic, non-adiabatic protocols for spatial state preparation, which yield…
This work identifies geometric effects on dynamics due to nonadiabatic couplings in Born Oppenheimer systems and provides a systematic method for deriving corrections to mixed quantum-classical methods. Specifically, an exact path integral…
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…
The concept of off-diagonal geometric phase (GP) has been introduced in order to recover interference information about the geometry of quantal evolution where the standard GPs are not well-defined. In this Letter, we propose a physical…
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 propose a simple but versatile protocol to engineer time-dependent Hamiltonians inversely for geometric quantum computation. By utilizing SU(2) transformation, a speedup goal on gate operation is achieved with more freedom to design the…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
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,…
Non-adiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general…
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
We propose a new strategy to physically implement a universal set of quantum gates based on geometric phases accumulated in the nondegenerate eigenstates of a designated invariant operator in a periodic physical system. The system is driven…
In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also…
The geometric phases of the cyclic states of a generalized harmonic oscillator with nonadiabatic time-periodic parameters are discussed in the framework of squeezed state. It is shown that the cyclic and quasicyclic squeezed states…
Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
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…
Nonadiabatic holonomic quantum computation has attracted increasing interest because of its robustness. In this paper, based on the shortcuts to adiabaticity (STA), we propose a scheme to construct a three-qubit nonadiabatic holonomic gate…
We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state.…