Adiabatic quantum computing (AQC) is a computation protocol to solve difficult problems exploiting quantum advantage, directly applicable to optimization problems. In performing the AQC, different configurations of the Hamiltonian path could lead to dramatic differences in the computation efficiency. It is thus crucial to configure the Hamiltonian path to optimize the computation performance of AQC. Here we apply a reinforcement learning approach to configure AQC for integer programming, where we find the learning process automatically converges to a quantum algorithm that exhibits scaling advantage over the trivial AQC using a linear Hamiltonian path. This reinforcement-learning-based approach for quantum adiabatic algorithm design for integer programming can well be adapted to the quantum resources in different quantum computation devices, due to its built-in flexibility.
Adiabatic quantum computing (AQC) is a computation protocol to solve difficult problems exploiting quantum advantage, directly applicable to optimization problems. In performing the AQC, different configurations of the Hamiltonian path could lead to dramatic differences in the computation efficiency. It is thus crucial to configure the Hamiltonian path to optimize the computation performance of AQC. Here we apply a reinforcement learning approach to configure AQC for integer programming, where we find the learning process automatically converges to a quantum algorithm that exhibits scaling advantage over the trivial AQC using a linear Hamiltonian path. This reinforcement-learning-based approach for quantum adiabatic algorithm design for integer programming can well be adapted to the quantum resources in different quantum computation devices, due to its built-in flexibility.
Quantum algorithm design plays a crucial role in exploiting the computational advantage of quantum devices. Here we develop a deep-reinforcement-learning based approach for quantum adiabatic algorithm design. Our approach is generically applicable to a class of problems with solution hard-to-find but easy-to-verify, e.g., searching and NP-complete problems. We benchmark this approach in Grover-search and 3-SAT problems, and find that the adiabatic algorithm obtained by our RL approach leads to significant improvement in the resultant success probability. In application to Grover search, our RL design automatically produces an adiabatic quantum algorithm that has the quadratic speedup. We find for all our studied cases that quantitatively the RL-designed algorithm has a better performance compared to the analytically constructed nonlinear Hamiltonian path when the encoding Hamiltonian is solvable, and that this RL-design approach remains applicable even when the nonlinear Hamiltonian path is not analytically available. In 3-SAT we find RL design has fascinating transferability---the adiabatic algorithm obtained by training on a specific choice of clause number leads to better performance consistently over the linear algorithm on different clause numbers. These findings suggest the applicability of reinforcement learning for automated quantum adiabatic algorithm design. Further considering the established complexity equivalence of circuit and adiabatic quantum algorithms, we expect the RL-designed adiabatic algorithm to inspire novel circuit algorithms as well. Our approach is potentially applicable to different quantum hardware from trapped ions and optical lattices to superconducting-qubit devices.
Quantum algorithm design lies in the hallmark of applications of quantum
computation and quantum simulation. Here we put forward a deep reinforcement
learning (RL) architecture for automated algorithm design in the framework of
quantum adiabatic algorithm, where the optimal Hamiltonian path to reach a
quantum ground state that encodes a compution problem is obtained by RL
techniques. We benchmark our approach in Grover search and 3-SAT problems, and
find that the adiabatic algorithm obtained by our RL approach leads to
significant improvement in the success probability and computing speedups for
both moderate and large number of qubits compared to conventional algorithms.
The RL-designed algorithm is found to be qualitatively distinct from the linear
algorithm in the resultant distribution of success probability. Considering the
established complexity-equivalence of circuit and adiabatic quantum algorithms,
we expect the RL-designed adiabatic algorithm to inspire novel circuit
algorithms as well. Our approach offers a recipe to design quantum algorithms
for generic problems through a machinery RL process, which paves a novel way to
automated quantum algorithm design using artificial intelligence, potentially
applicable to different quantum simulation and computation platforms from
trapped ions and optical lattices to superconducting-qubit devices.
Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman cryptography. With programable quantum devices, adiabatic quantum computing has been proposed as a plausible approach to solve prime factorization, having promising advantage over classical computing. Here, we find there are certain hard instances that are consistently intractable for both classical simulated annealing and unconfigured adiabatic quantum computing (AQC). Aiming at an automated architecture for optimal configuration of quantum adiabatic factorization, we apply a deep reinforcement learning (RL) method to configure the AQC algorithm. By setting the success probability of the worst-case problem instances as the reward to RL, we show the AQC performance on the hard instances is dramatically improved by RL configuration. The success probability also becomes more evenly distributed over different problem instances, meaning the configured AQC is more stable as compared to the unconfigured case. Through a technique of transfer learning, we find prominent evidence that the framework of AQC configuration is scalable---the configured AQC as trained on five qubits remains working efficiently on nine qubits with a minimal amount of additional training cost.
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand us to accelerate the evolution so that the adiabatic errors can be prevented from accumulation. Here, by treating this trade-off task as a multiobjective optimization problem, we propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways and apply it to the Landau-Zener Hamiltonian and Grover search Hamiltonian. Numerical comparisons with a linear schedule, local adiabatic theorem induced schedule, and gradient-based algorithm searched schedule reveal that the proposed method can achieve significant performance improvements in terms of the adiabatic time and the instantaneous ground-state population maintenance. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such that the adiabatic condition is satisfied. A correct choice of these elements is crucial for an efficient adiabatic quantum computation. In this paper we propose a hybrid quantum-classical algorithm to solve optimization problems with an adiabatic machine assuming restrictions on the class of available problem Hamiltonians. The scheme is based on repeated calls to the quantum machine into a classical iterative structure. In particular we present a technique to learn the encoding of a given optimization problem into a problem Hamiltonian and we prove the convergence of the algorithm. Moreover the output of the proposed algorithm can be used to learn efficient adiabatic algorithms from examples.
The convergence of quantum computing and artificial intelligence presents profound opportunities but faces significant hurdles, particularly in the Noisy Intermediate-Scale Quantum (NISQ) era. Quantum Machine Learning (QML) algorithms, while promising, exhibit sensitivity to noise and scalability challenges, hindering the demonstration of practical quantum advantage. Concurrently, Quantum Error Correction (QEC), essential for fault tolerance, imposes substantial resource overheads and is often developed generically, without specific adaptation to the target application's error sensitivity. This paper reviews the current state of the intersection of AI and quantum computing, examining both QML paradigms, e.g., Variational Quantum Algorithms, Quantum Kernels, and the burgeoning use of AI to enhance quantum computing itself, e.g., quantum control, QEC decoding, circuit design. A critical gap identified is the lack of frameworks that systematically co-design QML algorithms and QEC protocols adaptively. To address this, a novel framework is proposed based on Reinforcement Learning (RL). This framework employs an RL agent to dynamically adjust both the QML circuit architecture, e.g., VQC ansatz, and QEC parameters, e.g., decoding strategy, measurement frequency, based on observed application performance and estimated error characteristics. This adaptive co-design loop aims to optimize the trade-off between QML performance and QEC overhead, enhancing noise resilience and resource efficiency. The potential advantages, feasibility, and limitations of this approach are discussed, alongside with future research directions aimed at realizing robust and practical Quantum AI.