Related papers: Adiabatic and Hamiltonian computing on a 2D lattic…
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 prove the existence of a unitary transformation that enables two arbitrarily given Hamiltonians in the same Hilbert space to be transformed into one another. The result is straightforward yet, for example, it lays the foundation to…
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum…
Due to its geometric nature, holonomic quantum computation is fault-tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open…
The quantum mechanical motion of the atomic nuclei is considered over a single- or a multi-dimensional subspace of electronic states which is separated by a gap from the rest of the electronic spectrum over the relevant range of nuclear…
We present two applications of emergent local Hamiltonians to speed up quantum adiabatic protocols for isolated noninteracting and weakly interacting fermionic systems in one-dimensional lattices. We demonstrate how to extract maximal work…
We propose a simple construction of shortcuts to adiabaticity tracking instantaneous stationary states in classical spin systems without knowing tracked stationary states. In our construction, control fields of counter-diabatic driving are…
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,…
We present a general approach to speed up the adiabatic process without adding the traditional counterdiabatic driving (CD) Hamiltonian. The strategy is to design an easy-to-get intermediate Hamiltonian to connect the original Hamiltonian…
We consider the quantum Zeno dynamics arising from monitoring a time-dependent projector. Starting from a stroboscopic measurement protocol, it is shown that the effective Hamiltonian for Zeno dynamics involves a nonadiabatic geometric…
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…
Shortcuts to adiabaticity are strategies for conserving adiabatic invariants under non-adiabatic (i.e. fast-driving) conditions. Here, we show how to extend classical, Hamiltonian shortcuts to adiabaticity to allow the crossing of a…
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.…
A new and intuitive perturbative approach to time-dependent quantum mechanics problems is presented, which is useful in situations where the evolution of the Hamiltonian is slow. The state of a system which starts in an instantaneous…
The non-adiabatic holonomic quantum computation with the advantages of fast and robustness attracts widespread attention in recent years. Here, we propose the first scheme for realizing universal single-qubit gates based on an…
We propose a concatenated approach for implementing transitionless quantum driving regardless of adiabatic conditions while being robustness with respect to all kinds of systematic errors induced by pulse duration, pulse amplitude,…
Controllable adiabatic evolution of a multi-qubit system can be used for adiabatic quantum computation (AQC). This evolution ends at a configuration where the Hamiltonian of the system encodes the solution of the problem to be solved. As a…
We develop a resource efficient method by which the ground-state of an arbitrary k-local, optimization Hamiltonian can be encoded as the ground-state of a (k-1)-local optimization Hamiltonian. This result is important because adiabatic…
We apply the method of transitionless quantum driving for time-dependent quantum systems to spin systems. For a given Hamiltonian, the driving Hamiltonian is constructed so that the adiabatic states of the original system obey the…
We present a general method for studying coupled qubits driven by adiabatically changing external parameters. Extended calculations are provided for a two-bit Hamiltonian whose eigenstates can be used as logical states for a quantum CNOT…