Related papers: Adiabatic evolution under quantum control

Adiabatic gauge potential is the origin of nonadiabatic transitions. In counterdiabatic driving, which is a method of shortcuts to adiabaticity, adiabatic gauge potential can be used to realize identical dynamics to adiabatic time evolution…

Applying time-dependent driving is a basic way of quantum control. Driven systems show various dynamics as its time scale is changed due to the different amount of nonadiabatic transitions. The fast-forward scaling theory enables us to…

Motivated for the fault tolerant quantum computation, quantum gate by adiabatic geometric phase shift is extensively investigated. In this paper, we demonstrate the nonadiabatic scheme for the geometric phase shift and conditional geometric…

The ability to accurately control a quantum system is a fundamental requirement in many areas of modern science such as quantum information processing and the coherent manipulation of molecular systems. It is usually necessary to realize…

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…

A proof of the adiabatic theorem for quantum systems whose time evolution proceeds along discrete time, e.g., quantum maps and quantum circuits, is shown.

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…

We study feedback control of classical Hamiltonian systems with the controlling parameter varying slowly in time. The control aims to change system's energy. We show that the control problems can be solved with help of an adiabatic…

This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…

We analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'.

Adiabaticity of quantum evolution is important in many settings. One example is the adiabatic quantum computation. Nevertheless, up to now, there is no effective method to test the adiabaticity of the evolution when the eigenenergies of the…

Adiabatic processes are important for studying the dynamics of a time-dependent system. Conventionally, the adiabatic processes can only be achieved by varying the system slowly. We speed up both classical and quantum adiabatic processes by…

The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved…

Time evolution of quantum systems is accelerated by the fast-forward scaling. We reformulate the method to study systems in a finite-dimensional Hilbert space. For several simple systems, we explicitly construct the acceleration potential.…

In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…

For adiabatic controls of quantum systems, the non-adiabatic transitions are reduced by increasing the operation time of processes. Perfect quantum adiabaticity usually requires the infinitely slow variation of control parameters. In this…

We develop new protocols for high-fidelity single qubit gates that exploit and extend theoretical ideas for accelerated adiabatic evolution. Our protocols are compatible with qubit architectures with highly isolated logical states, where…

Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…

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…

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…