We map adiabatic quantum evolution on the classical Hamiltonian dynamics of a 1D gas (Pechukas gas) and simulate the latter numerically. This approach turns out to be both insightful and numerically efficient, as seen from our example of a CNOT gate simulation. For a general class of Hamiltonians we show that the escape probability from the initial state scales no faster than |\dotλ|^γ, where |\dotλ| is the adiabaticity parameter. The scaling exponent for the escape probability is γ= 1/2 for all levels, except the edge (bottom and top) ones, where γ<~1/3. In principle, our method can solve arbitrarily large adiabatic quantum Hamiltonians.
We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bath and in the presence of a time-dependent Hamiltonian. The merit of these models is that they can be solved exactly, and will help us to study the interplay between non-adiabatic transitions and dissipation in many-body quantum systems. After the adiabatic evolution, we evaluate the excess energy (average value of the Hamiltonian) as a measure of the deviation from reaching the target final ground state. We compute the excess energy in a variety of different situations, where the nature of the b…
Recent work at Fraunhofer FKIE shows that Morefield's method for multiple target data association can in theory be solved on an adiabatic quantum computer. The present paper validates the theory and examines the significant limitations of currently available adiabatic quantum computers for solving the data association problem. The limitations of such architectures are both theoretical and practical in nature, and both are discussed. The data association problem is formulated as a quadratic unconstrained binary optimization (QUBO) problem; consequently, much of the discussion is relevant to oth…
Quantum phase transitions materialize as level crossings in the ground-state energy when the parameters of the Hamiltonian are varied. The resulting ground-state phase diagrams are straightforward to determine by exact diagonalization on classical computers, but are challenging on quantum computers because of the accuracy needed and the near degeneracy of competing states close to the level crossings. In this work, we use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution. This methodology is illustr…
We discuss in this chapter the basics of adiabatic computation, as well as some physical implementations. After a short introduction of the quantum circuit model, we describe quantum adiabatic computation, quantum annealing, and the strong relations between the three. We conclude with a brief presentation of the D-Wave computer and some future challenges.
Auburn University（奥本大学）；Oak Ridge National Laboratory（橡树岭国家实验室）
Adiabatic quantum computers are a promising platform for approximately solving challenging optimization problems. We present a quantum approach to solving the balanced $k$-means clustering training problem on the D-Wave 2000Q adiabatic quantum computer. Existing classical approaches scale poorly for large datasets and only guarantee a locally optimal solution. We show that our quantum approach better targets the global solution of the training problem, while achieving better theoretic scalability on large datasets. We test our quantum approach on a number of small problems, and observe cluster…
The article is addressing a possibility of implementation of spin network states on adiabatic quantum computer. The discussion is focused on application of currently available technologies and analyzes a concrete example of D-Wave machine. A class of simple spin network states which can be implemented on the Chimera graph architecture of the D-Wave quantum processor is introduced. However, extension beyond the currently available quantum processor topologies is required to simulate more sophisticated spin network states, which may inspire development of new generations of adiabatic quantum com…
The theoretical investigation of non-adiabatic processes is hampered by the complexity of the coupled electron-nuclear dynamics beyond the Born-Oppenheimer approximation. Classically, the simulation of such reactions is limited by the unfavourable scaling of the computational resources as a function of the system size. While quantum computing exhibits proven quantum advantage for the simulation of real-time dynamics, the study of quantum algorithms for the description of non-adiabatic phenomena is still unexplored. In this work, we propose a quantum algorithm for the simulation of fast non-adi…
The purpose of the D-Wave adiabatic quantum computer is to find a set of qubit values that minimize its objective function. For various reasons, the set of qubit values returned by the D-Wave has errors. This paper presents a method of improving the results returned by the D-Wave. The method individually modifies the qubit values returned by the D-Wave to find a set of values which is a minimum of the objective function. That set however is not necessarily guaranteed to be a global minimum. The method is simple and easily incorporated into any algorithm that has direct access to the sets of va…
The class of problems represented by frustrated cluster loops, FCL, is a robust set of problems that spans a wide range of computational difficulty and that are easy to determine what their solutions are. Here, we use frustrated cluster loops to test the relative performance of the D-Wave without post-processing and the D-Wave with multi-qubit correction (MQC) post-processing. MQC post-processing has shown itself exceptionally beneficial in improving the performance of the D-Wave 2000Q when processing difficult FCL problems.
In this work we present a quantum algorithm for multiobjective combinatorial optimization. We show how to map a convex combination of objective functions onto a Hamiltonian and then use that Hamiltonian to prove that the quantum adiabatic algorithm of Farhi \emph{et al.} [arXiv:quant-ph/0001106] can find Pareto-optimal solutions in finite time provided certain convex combinations of objectives are used and the underlying multiobjective problem meets certain restrictions.
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We propose an alternative factorization method, within the digitized-adiabatic quantum computing paradigm, by digitizing an adiabatic quantum factorization algorithm enhanced by shortcuts to adiabaticity techniques. We find that this fast factorization algorithm is suitable for available gate-based quantum computers. We test our quantum algorithm in an IBM quantum c…
The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system -- the quantum Ising chain in transverse field -- and implement it on the D-Wave machine. An ideal adiabatic quench of the quantum Ising chain should lead to an ordered broken symmetry ground state with all spins aligned in the same direction. An actual quench can be imperfect due to decoherence…
Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum superpositions of coherent states, such as Schrodinger cat states. Therefore, these quantum computers are referred to as "quantum bifurcation machines (QbMs)." QbMs can be used for qauntum adiabatic optimization and universal quantum computation. Superconducting circuits with Josephson junctions, Josephson parametric oscillators (JPOs) in particular, are promising fo…
The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased s…
We present a quantum algorithm for implementing $ϕ^4$ lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the implementation of the evolution operator is proportional to the lattice size. The algorithm allows efficient $ϕ^4$ state preparation for a large range of input parameters in both the normal and broken-symmetry phases. The states are prepared using a combination of variational and adiabatic evolution methods. First, the ground state of a local Hamiltonian, which includes …
Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their applicability to weak interactions. Here we introduce the Variational Adiabatic Gauge Transformation (VAGT), a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit that brings the Hamiltonian to either its block-diagonal or full-diagonal form. If a Hamiltonian can be diagonalized …
Projective Quantum Eigensolver via Adiabatically Decoupled Subsystem Evolution: a Resource Efficient Approach to Molecular Energetics in Noisy Quantum Computers
We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with $N$ sites and the coordination number $Z$. The method is based on the $1/Z$ expansion for the density matrix of the system. In each order, the ground state energy is found neglecting the higher-order correlations between the sites, as long as the set of equations remains non-singular. The conditions of the appearance of a singularity, equivalent to the disappearance of energy gap in the given approximation, can be directly obtained from the equations. Then the next order in t…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a Hamiltonian defining the problem to solve and a mixing Hamiltonian. The adiabatic theorem initially defined in quantum physic allows to compute a solution for the Schrödinger equation, but the foundation of this methods requires strong skill in physics and mathematics. Our main objectives in this paper are at first to provide an algorithm-based presentation (…
A central challenge in the successful implementation of adiabatic quantum algorithms is to maintain the quantum adiabaticity during the entire evolution. However, the energy gap between the ground and the excited states of interacting many-body systems often decreases quickly with the number of qubits, and the quantum adiabaticity can be severely impaired. Despite numerous previous efforts, a practical method to preserve the quantum adiabaticity has yet to be developed. Here we present a universal approach to enhancing the quantum adiabaticity via cavity or circuit QED. By coupling an adiabati…
Washington University（华盛顿大学）；Oak Ridge National Laboratory（橡树岭国家实验室）
In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in economics, business, finance, etc. We attempt to solve a number of small knapsack problems whose optimal solutions are known; we find that adiabatic quantum optimization fails to produce solutions corresponding to optimal filling of the knapsack in all problem instances. We compare results obtained on the quantum hardware to the classical simulated annealing algorithm and two s…
A non-adiabatic nuclear wavepacket dynamics simulation of the H$_2$O$^+$ de-excitation process is performed based on electronic structure calculations using the variational quantum eigensolver. The adiabatic potential energy surfaces and non-adiabatic coupling vectors are computed with algorithms for noisy intermediate-scale quantum devices, and time propagation is simulated with conventional methods for classical computers. The results of non-adiabatic transition dynamics from the $\tilde{B}$ state to $\tilde{A}$ state reproduce the trend reported in previous studies, which suggests that this…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather than discrete gates. We explore an alternative approach in which slowly varying measurements are used to mimic adiabatic evolution. We show that for certain Hamiltonians, which remain frustration-free all along the adiabatic path, the necessary measurements can be implemented through the measurement of random terms from the Hamiltonian. This offers a new, a…
Dimensionality reduction is the fundamental problem for machine learning and pattern recognition. During data preprocessing, the feature selection is often demanded to reduce the computational complexity. The problem of feature selection is categorized as a NP optimization problem. Exhaustive search of huge set of features takes huge amount of time on classical computer. In the present paper we discuss the role of quantum adiabatic computation to perform feature selection with bi-quadratic optimization and provide a quantum feature selection algorithm. Our algorithm runs with the quantum adiab…
Scalable universal holonomic quantum computation realized with an adiabatic quantum data bus and potential implementation using superconducting flux qubits
Shortcuts to adiabaticity are well-known methods for controlling the quantum dynamics beyond the adiabatic criteria, where counter-diabatic (CD) driving provides a promising means to speed up quantum many-body systems. In this work, we show the applicability of CD driving to enhance the digitized adiabatic quantum computing paradigm in terms of fidelity and total simulation time. We study the state evolution of an Ising spin chain using the digitized version of the standard CD driving and its variants derived from the variational approach. We apply this technique in the preparation of Bell and…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum annealing, computation by continuous-time quantum walk, and special purpose quantum simulators all use this strategy. In this work, we carry out a detailed examination of adiabatic and quantum walk implementation of the quantum search algorithm, using the more physically realistic hypercube connectivity, rather than the complete graph, for our base Hamiltonian.…
Experimental simulation of non-equilibrium quantum piston on a programmable photonic quantum computer
KTH Royal Institute of Technology（皇家理工学院）；Single Quantum B.V.（Single Quantum有限公司）；RISE Research Institutes of Sweden（瑞典RISE研究院）；Huazhong University of Science and Technology（华中科技大学）
