相关论文: Universal adiabatic quantum computation via the sp…

Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…

Quantum adiabatic evolutions find a broad range of applications in quantum physics and quantum technologies. The traditional form of the quantum adiabatic theorem limits the speed of adiabatic evolution by the minimum energy gaps of the…

Models of quantum computation are important because they change the physical requirements for achieving universal quantum computation (QC). For example, one-way QC requires the preparation of an entangled "cluster" state followed by…

We decompose the quantum adiabatic evolution as the products of gauge invariant unitary operators and obtain the exact nonadiabatic correction in the adiabatic approximation. A necessary and sufficient condition that leads to adiabatic…

Perturbed Hamming weight problems serve as examples of optimization instances for which the adiabatic algorithm provably out performs classical simulated annealing. In this work we study the efficiency of the adiabatic algorithm for solving…

We propose an approach suitable for solving NP-complete problems via adiabatic quantum computation with an architecture based on a lattice of interacting spins (qubits) driven by locally adjustable effective magnetic fields. Interactions…

We present a method to experimentally realize large-scale permutation-symmetric Hamiltonians for continuous-time quantum protocols such as quantum walk and adiabatic quantum computation. In particular, the method can be used to perform an…

An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…

We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a data base of $N$ items. In particular we examine the effects on the computation time of adding energy to the system. We find that by…

Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…

In this work we present an effective Hamiltonian description of the quantum dynamics of a generalized Lambda system undergoing adiabatic evolution. We assume the system to be initialized in the dark subspace and show that its holonomic…

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…

Shortcuts to adiabaticity provide a general approach to mimic adiabatic quantum processes via arbitrarily fast evolutions in Hilbert space. For these counter-diabatic evolutions, higher speed comes at higher energy cost. Here, the…

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…

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…

In Phys. Rev. A {\bf 71}, 060312(R) (2005) the robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian was examined. We expand this analysis to include the case of the global…

We show that a local Hamiltonian of spin-3/2 particles with only two-body nearest-neighbor Affleck-Kennedy-Lieb-Tasaki and exchange-type interactions has an unique ground state, which can be used to implement universal quantum computation…

The quantum speed limit specifies a universal bound of the fidelity between the initial state and the time-evolved state. We apply this method to find a bound of the fidelity between the adiabatic state and the time-evolved state. The bound…

Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…

We propose a method to produce fast transitionless dynamics for finite-dimensional quantum systems without requiring additional Hamiltonian components not included in the initial control setup, remaining close to the true adiabatic path at…