© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:cond-mat/0702580 · IEEE Transactions on Applied Superconductivity

Adiabatic Quantum Computation With Flux Qubits, First Experimental Results

S. H. W. van der Ploeg, A. Izmalkov, M. Grajcar, Uwe Hübner, S. Linzen, Sergey V. Uchaikin, Th. Wagner, Anatoly Yu. Smirnov, Alec Maassen van den Brink, M. H. S. Amin, Alexandre M. Zagoskin, Evgeni V. Il’ichev, H.‐G. Meyer

Published Jun 1, 2007• 16 citations

Abstract

Controllable adiabatic evolution of a multi-qubit system can be used for adiabatic quantum computation (AQC). This evolution ends at a configuration where the Hamiltonian of the system encodes the solution of the problem to be solved. As a first steps towards realization of AQC we have investigated two, three and four flux qubit systems. These systems were characterized by making use of a radio-frequency method. We designed two-qubit systems with coupling energies up to several kelvins. For the three-flux-qubit systems we determined the complete ground-state flux diagram in the three dimensional flux space around the qubits common degeneracy point. We show that the system's Hamiltonian can be completely reconstructed from our measurements. Our concept for the implementation of AQC, by making use of flux qubits, is discussed.

DOI: 10.1109/tasc.2007.898156

Related papers

Superconducting system for adiabatic quantum computing

Valentina Corato, Tommaso Roscilde, B. Ruggiero +2 more

We study the Hamiltonian of a system of inductively coupled flux qubits, which has been theoretically proposed for adiabatic quantum computation to handle NP problems. We study the evolution of a basic structure consisting of three coupled rf-SQUIDs upon tuning the external flux bias, and we show that the adiabatic nature of the evolution is guaranteed by the presence of the single-SQUID gap. We further propose a scheme and the first realization of an experimental device suitable for verifying the theoretical results.

Journal of Physics Conference Series•Jun 1, 2006•3 citations

Measurement of the ground-state flux diagram of three coupled qubits as a first step towards the demonstration of adiabatic quantum computation

A. Izmalkov, M. Grajcar, S. H. W. van der Ploeg +4 more

Measurement of the ground-state flux diagram of three coupled qubits as a first step towards the demonstration of adiabatic quantum computation, A. Izmalkov, M. Grajcar, S. H. W. van der Ploeg, U. Hübner, E. Il'ichev, H.-G. Meyer, A. M. Zagoskin

arXiv:cond-mat/0605070•Europhysics Letters (EPL)•Oct 6, 2006•14 citations

Adiabatic quantum computation with spin ensembles

Naeimeh Mohseni, Marek Narożniak, Alexey N. Pyrkov +3 more

In the standard approach to adiabatic quantum computing (AQC), quantum information stored on qubits are adia- batically evolved to find the lowest energy state of a problem Hamiltonian. Here we investigate a variation of AQC where spin ensembles are used in place of qubits. The use of ensembles duplicates the quantum information, and allows errors to be suppressed during the adiabatic evolution. We show that there are two distinct types of problem Hamiltonians under this mapping, where the first excited state is a single particle perturbation on the ground state (Type I); or a macroscopically distinct fully polarized state (Type II). For Type I problems, we find that the minimum gap for large ensembles is well predicted by mean-field theory and the AQC performance improves with ensemble size, realizing error-suppression. For Type II problems, the performance of the AQC is mixed, and the gap can increase or decrease with ensemble size depending on the problem instance. The incidences of the Type II problems are greatly suppressed with ensemble size, and consequently for randomly chosen problem instances the success probability of the scheme improves with the ensemble size. Our approach shows that it is possible to perform AQC without the necessity of controlling individual qubits, which allows for an alternative route towards implementing AQC.

AIP conference proceedings•Jan 1, 2020•0 citations

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System

Kebiao Xu, Tianyu Xie, Zhaokai Li +8 more

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

arXiv:1611.03293•Physical Review Letters•Mar 30, 2017•41 citations

Feedback-controlled adiabatic quantum computation

R. D. Wilson, Alexandre M. Zagoskin, Sergey E. Savel'ev +2 more

We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control the computation speed to maximize the success probability. We show that this scheme can provide a polynomial speed-up in performance and that it is possible to choose a suitable set of feedback-control parameters for an arbitrary problem Hamiltonian.

arXiv:1301.0459•Physical Review A•Nov 5, 2012•13 citations

Adiabatic Quantum Computing and Global Solution of NP-Hard QUBO Problems: A General Approach

Sanjay Sharma, Ravi Kumar

QUBO problems are NP-hard and have wide applications in optimization, including finance, logistics, machine learning, and combinatorial problems. However, classical algorithms employed for solving them can often get stuck in local minima. This paper presents an Adiabatic Quantum Computing (AQC) approach towards finding an optimal solution for QUBO problems. The QUBO problem has been first encoded into Hamiltonians. The adiabatic theorem has been used to achieve success of an AQC solution with a rate which is found to be dependent on relative gap between the ground state and first exited state of the Hamiltonian.

IEEE International Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)•Mar 12, 2026•0 citations

Controllable adiabatic evolution of a multi-qubit system can be used for adiabatic quantum computation (AQC). This evolution ends at a configuration where the Hamiltonian of the system encodes the solution of the problem to be solved. As a first steps towards realization of AQC we have investigated two, three and four flux qubit systems. These systems were characterized by making use of a radio-frequency method. We designed two-qubit systems with coupling energies up to several kelvins. For the three-flux-qubit systems we determined the complete ground-state flux diagram in the three dimensional flux space around the qubits common degeneracy point. We show that the system's Hamiltonian can be completely reconstructed from our measurements. Our concept for the implementation of AQC, by making use of flux qubits, is discussed.

We study the Hamiltonian of a system of inductively coupled flux qubits, which has been theoretically proposed for adiabatic quantum computation to handle NP problems. We study the evolution of a basic structure consisting of three coupled rf-SQUIDs upon tuning the external flux bias, and we show that the adiabatic nature of the evolution is guaranteed by the presence of the single-SQUID gap. We further propose a scheme and the first realization of an experimental device suitable for verifying the theoretical results.

In the standard approach to adiabatic quantum computing (AQC), quantum information stored on qubits are adia- batically evolved to find the lowest energy state of a problem Hamiltonian. Here we investigate a variation of AQC where spin ensembles are used in place of qubits. The use of ensembles duplicates the quantum information, and allows errors to be suppressed during the adiabatic evolution. We show that there are two distinct types of problem Hamiltonians under this mapping, where the first excited state is a single particle perturbation on the ground state (Type I); or a macroscopically distinct fully polarized state (Type II). For Type I problems, we find that the minimum gap for large ensembles is well predicted by mean-field theory and the AQC performance improves with ensemble size, realizing error-suppression. For Type II problems, the performance of the AQC is mixed, and the gap can increase or decrease with ensemble size depending on the problem instance. The incidences of the Type II problems are greatly suppressed with ensemble size, and consequently for randomly chosen problem instances the success probability of the scheme improves with the ensemble size. Our approach shows that it is possible to perform AQC without the necessity of controlling individual qubits, which allows for an alternative route towards implementing AQC.

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

QUBO problems are NP-hard and have wide applications in optimization, including finance, logistics, machine learning, and combinatorial problems. However, classical algorithms employed for solving them can often get stuck in local minima. This paper presents an Adiabatic Quantum Computing (AQC) approach towards finding an optimal solution for QUBO problems. The QUBO problem has been first encoded into Hamiltonians. The adiabatic theorem has been used to achieve success of an AQC solution with a rate which is found to be dependent on relative gap between the ground state and first exited state of the Hamiltonian.