相关论文: A Numerical Study of the Performance of a Quantum …

Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…

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…

This thesis investigates quantum algorithms for eigenstate preparation, with a focus on solving eigenvalue problems such as the Schrodinger equation by utilizing near-term quantum computing devices. These problems are ubiquitous in several…

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

An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine…

Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…

Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation…

In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…

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,…

I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of the clauses forming the 3-SAT proposition using a…

Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for…

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…

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 computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…

Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…

We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of $L$ gates we can construct a quantum…

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…

Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable…

At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…

The working of a quantum computer is described in the concrete example of a quantum simulator of the single-particle Schrodinger equation. We show that a register of 6-10 qubits is sufficient to realize a useful quantum simulator capable of…