相关论文: Non-adiabatic geometric quantum computation with t…

Shortcuts to adiabaticity have been proposed to speed up the "slow" adiabatic transport of an atom or a wave packet of atoms. However, the freedom of the inverse engineering approach with appropriate boundary conditions provides thousands…

The nonadiabatic holonomic quantum computation based on the geometric phase is robust against the built-in noise and decoherence. In this work, we theoretically propose a scheme to realize nonadiabatic holonomic quantum gates in a surface…

We present the formulation of the problem of the coherent dynamics of quantum mechanical two-level systems in the adiabatic region in terms of the differential geometry of plane curves. We show that there is a natural plane curve…

Nonadiabatic holonomic quantum computation (NHQC) offers intrinsic resilience to certain control imperfections. However, conventional nonadiabatic holonomic protocols are constrained by the fixed-pulse-area condition, which limits…

We suggest a scheme to implement a universal set of non-Abelian geometric transformations for a single logical qubit composed of three superconducting transmon qubits coupled to a single cavity. The scheme utilizes an adiabatic evolution in…

This article deals with non-adiabatic processes (i.e. processes excluded by the adiabatic theorem) from the geometrical (group-theoretical) point of view. An approximated formula for the probabilities of the non-adiabatic transitions is…

A geometric phase is found for a general quantum state that undergoes adiabatic evolution. For the case of eigenstates, it reduces to the original Berry's phase. Such a phase is applicable in both linear and nonlinear quantum systems.…

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 novel non-Hermitian adiabatic quantum optimization algorithm. One of the new ideas is to use a non-Hermitian auxiliary "initial'' Hamiltonian that provides an effective level repulsion for the main Hamiltonian. This effect…

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…

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…

The adiabatic theorem shows that the instantaneous eigenstate is a good approximation of the exact solution for a quantum system in adiabatic evolution. One may therefore expect that the geometric phase calculated by using the eigenstate…

Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…

We introduce a hardware-specific, problem-dependent digital-analog quantum algorithm of a counterdiabatic quantum dynamics tailored for optimization problems. Specifically, we focus on trapped-ion architectures, taking advantage from global…

In quantum information processing, the development of fast and robust control schemes remains a central challenge. Although quantum adiabatic evolution is inherently robust against control errors, it typically demands long evolution times.…

In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…

Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…

Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…

When a quantum system is driven adiabatically through a parametric cycle in a degenerate Hilbert space, the state would acquire a non-Abelian geometric phase, which is stable and forms the foundation for holonomic quantum computation (HQC).…

Geometric manipulation of a quantum system offers a method for fast, universal, and robust quantum information processing. Here, we propose a scheme for universal all-geometric quantum computation using non-adiabatic quantum holonomies. We…