相关论文: Adiabatic Quantum State Generation and Statistical…

We study the eigenlevel spectrum of quantum adiabatic algorithm for 3-satisfiability problem, focusing on single-solution instances. The properties of the ground state and the associated gap, crucial for determining the running time of the…

Synthetic data generation has proven to be a promising solution for addressing data availability issues in various domains. Even more challenging is the generation of synthetic time series data, where one has to preserve temporal dynamics,…

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

Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the…

The quantum adiabatic theorem is fundamental to time dependent quantum systems, but being able to characterize quantitatively an adiabatic evolution in many-body systems can be a challenge. This work demonstrates that the use of appropriate…

The adiabatic theorem refers to a setup where an evolution equation contains a time-dependent parameter whose change is very slow, measured by a vanishing parameter $\epsilon$. Under suitable assumptions the solution of the…

We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…

State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distributions using matrix product states with recently discovered…

A computational model of adiabatic evolutionary quantum system (or AEQS, pronounced "eeh-ks") was introduced in [Yamakami,2022] as a sort of quantum annealing and its underlying input-driven Hamiltonians are generated…

We derive an adiabatic theorem for Markov chains using well known facts about mixing and relaxation times. We discuss the results in the context of the recent developments in adiabatic quantum computation.

We examine the complexity of learning the distributions produced by finite-state quantum sources. We show how prior techniques for learning hidden Markov models can be adapted to the quantum generator model to find that the analogous state…

In 2004 Ambainis and Regev formulated a certain form of quantum adiabatic theorem and provided an elementary proof which is especially accessible to computer scientists. Their result is achieved by discretizing the total adiabatic evolution…

The evolution of a driven quantum system is said to be adiabatic whenever the state of the system stays close to an instantaneous eigenstate of its time-dependent Hamiltonian. The celebrated quantum adiabatic theorem ensures that such pure…

Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…

Quantum adiabatic evolution is a dynamical evolution of a quantum system under slow external driving. According to the quantum adiabatic theorem, no transitions occur between non-degenerate instantaneous eigen-energy levels in such a…

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present…

Motivated by the quantum adiabatic algorithm (QAA), we consider the scaling of the Hamiltonian gap at quantum first order transitions, generally expected to be exponentially small in the size of the system. However, we show that a quantum…

We present an optimized adiabatic quantum schedule for unstructured search building on the original approach of Roland and Cerf [Phys. Rev. A 65, 042308 (2002)]. Our schedule adiabatically varies the Hamiltonian even more rapidly at the…

This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a…

What are the conditions for adiabatic quantum computation (AQC) to outperform classical computation? Although there exist several quantum adiabatic algorithms achieving the strong quantum speedup, the essential keys to their speedups are…