Related papers: The Constant Geometric Speed Schedule for Adiabati…
Efficient control schemes that enable fast, high-fidelity operations are essential for any practical quantum computation. However, current optimization protocols are intractable due to stringent requirements imposed by the microscopic…
Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum gap during the adiabatic quantum optimization for an NP-hard…
Keeping a quantum system in a given instantaneous eigenstate is a control problem with numerous applications, e.g., in quantum information processing. The problem is even more challenging in the setting of open quantum systems, where…
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a…
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…
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…
It has previously been established that adiabatic quantum computation, operating based on a continuous Zeno effect due to dynamical phases between eigenstates, is able to realise an optimal Grover-like quantum speedup. In other words, is…
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint…
We investigate the irreconcilability issue that raises in translating the search algorithm from the Continuous-Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along…
We investigate a simple and robust scheme for choosing the phases of adiabatic electronic states smoothly (as a function of geometry) so as to maximize the performance of ab initio non-adiabatic dynamics methods. Our approach is based upon…
Geometric phases are robust to local noises and the nonadiabatic ones can reduce the evolution time, thus nonadiabatic geometric gates have strong robustness and can approach high fidelity. However, the advantage of geometric phase has not…
The preparation of ground states of spin systems is a fundamental operation in quantum computing and serves as the basis of adiabatic quantum computing. This form of quantum computation is subject to the adiabatic theorem which in turn…
The quantum adiabatic method, which maintains populations in their instantaneous eigenstates throughout the state evolution, is an established and often a preferred choice for state preparation and manipulation. Though it minimizes the…
There are a number of tasks in quantum information science that exploit non-transitional adiabatic dynamics. Such a dynamics is bounded by the adiabatic theorem, which naturally imposes a speed limit in the evolution of quantum systems.…
The accelerated optical lattice has emerged as a valuable technique for the investigation of quantum transport physics and has found widespread application in quantum sensing, including atomic gravimeters and atomic gyroscopes. In our…
In open quantum systems theory, reduced models are invaluable for conceptual understanding and computational efficiency. Adiabatic elimination is a useful model reduction method for systems with separated timescales, where a reduced model…
Based on the adiabatic geometric phase concerning with density matrix[1] , we extend it to the sub-geometric phase in the non-adiabatic case. It is found that whatever the real part or imaginary part of the sub-geometric phase can play an…
We consider the optimal driving of the ground state of a many-body quantum system across a quantum phase transition in finite time. In this context, excitations caused by the breakdown of adiabaticity can be minimized by adjusting the…
Geometric phases, which accompany the evolution of a quantum system and depend only on its trajectory in state space, are commonly studied in two-level systems. Here, however, we study the adiabatic geometric phase in a weakly anharmonic…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…