相关论文: Quantum adiabatic optimization and combinatorial l…

We investigate a quadratic unconstrained binary optimization (QUBO) formulation of the graph isomorphism problem using the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE). For small graph…

A gapped quantum system that is adiabatically perturbed remains approximately in its eigenstate after the evolution. We prove that, for constant gap, general quantum processes that approximately prepare the final eigenstate require a…

Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping…

Adiabatic quantum annealers encounter scalability challenges due to exponentially fast diminishing energy gaps between ground and excited states with qubit-count increase. This introduces errors in identifying ground states compounded by a…

In this paper,we present a rigorous demonstration and discussion of the quantum adiabatic theorem for systems having a non degenerate continuous spectrum. A new strategy is initiated by defining a kind of gap, "a virtual gap", for the…

We study the Hamiltonian associated with the quantum adiabatic algorithm with a random cost function. Because the cost function lacks structure we can prove results about the ground state. We find the ground state energy as the number of…

The adiabatic theorem is an important concept in quantum mechanics, it tells that a quantum system subjected to gradually changing external conditions remains to the same instantaneous eigenstate of its Hamiltonian as it initially in. In…

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…

Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum…

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…

Adiabatic quantum algorithms represent a promising approach to universal quantum computation. Whilst in a closed system these algorithms are limited by avoided level crossings, where the gap becomes exponentially small in the system size,…

Automating quantitative trading strategy development in dynamic markets is challenging, especially with increasing demand for personalized investment solutions. Existing methods often fail to explore the vast strategy space while preserving…

Transition amplitudes between instantaneous eigenstates of quantum two-level system are evaluated analytically on the basis of a new parametrization of its evolution operator, which has recently been proposed to construct exact solutions.…

Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…

We prove an analytical expression for the size of the gap between the ground and the first excited state of quantum adiabatic algorithm for the 3-satisfiability, where the initial Hamiltonian is a projector on the subspace complementary to…

We elucidate the geometry of quantum adiabatic evolution. By minimizing the deviation from adiabaticity we find a Riemannian metric tensor underlying adiabatic evolution. Equipped with this tensor, we identify a unified geometric…

We introduce a modified model where h-dependent artificial interface conditions, occurring at the boundary of an interaction region, allow to obtain adiabatic approximations for the relevant resonant states connected to the quantum…

Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…

Efficient descriptions of open quantum systems can be obtained by performing an adiabatic elimination of the fast degrees of freedom and formulating effective operators for the slow degrees of freedom in reduced dimensions. Here, we perform…

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…