相关论文: A modified quantum adiabatic evolution for the Deu…

The efficiency of adiabatic quantum evolution is governed by the evolution time $T$, which typically scales as $\mathcal{O}(\Delta^{-2})$ with the minimum energy gap $\Delta$. However, the rigorous lower bound is…

This paper is concerned with a linearized version of the transport problem where the Schr\"{o}dinger-Poisson operator is replaced by a non-autonomous Hamiltonian, slowly varying in time. We consider an explicitly solvable model where a…

A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of…

We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to…

Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring…

Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…

We review the quantum adiabatic approximation for closed systems, and its recently introduced generalization to open systems (M.S. Sarandy and D.A. Lidar, e-print quant-ph/0404147). We also critically examine a recent argument claiming that…

Existing quantum discrete adiabatic approaches are hindered by circuit depth that increases linearly with the number of evolution steps, a significant challenge for current quantum hardware with limited coherence times. To address this, we…

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…

The combined quantum electron-nuclear dynamics is often associated with the Born-Huang expansion of the molecular wave function and the appearance of nonadiabatic effects as a perturbation. On the other hand, native multicomponent…

For the adiabatic version of Grover's quantum search algorithm as proposed by Roland and Cerf, we study the impact of decoherence caused by a rather general coupling to some environment. For quite generic conditions, we find that the…

We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiabatic Theorem…

In this paper, we discuss time evolution and adiabatic approximation in $PT$-symmetric quantum mechanics. we give the time evolving equation for a class of $PT$-symmetric Hamiltonians and some conditions of the adiabatic approximation for…

Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for…

We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical…

A shortcut to adiabaticity (STA) is concerned with the fast and robust manipulation of the dynamics of a quantum system that reproduces the effect of an adiabatic process. A recently proposed method enables the generation of shortcuts from…

In their Letter, Garnerone et al. claim that an adiabatic quantum algorithm can extract information about a PageRank vector with either a polynomial or exponential reduction in time resources over the classical algorithm with comparable…

We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assignment that maximizes the number of satisfied clauses. The…

We describe a general framework for regarding oracle-assisted quantum algorithms as tools for discriminating between unitary transformations. We apply this to the Deutsch-Jozsa problem and derive all possible quantum algorithms which solve…

This work concerns a study of the quantum mechanical extension of the work of Horwitz et al. [1] on the stability of classical Hamiltonian systems by geometrical methods. Simulations are carried out for several important examples, these…