Adiabatic Quantum Research Articles

Exploring ground states of Fermi-Hubbard model on honeycomb lattices with counterdiabaticity

Exploring the ground state properties of many-body quantum systems conventionally involves adiabatic processes, alongside exact diagonalization, in the context of quantum annealing or adiabatic quantum computation. Shortcuts to adiabaticity by counter-diabatic driving serve to accelerate these processes by suppressing energy excitations. Motivated by this, we develop variational quantum algorithms incorporating the auxiliary counter-diabatic interactions, comparing them with digitized adiabatic algorithms. These algorithms are then implemented on gate-based quantum circuits to explore the ground states of the Fermi-Hubbard model on honeycomb lattices, utilizing systems with up to 26 qubits. The comparison reveals that the counter-diabatic inspired ansatz is superior to traditional Hamiltonian variational ansatz. Furthermore, the number and duration of Trotter steps are analyzed to understand and mitigate errors. Given the model’s relevance to materials in condensed matter, our study paves the way for using variational quantum algorithms with counterdiabaticity to explore quantum materials in the noisy intermediate-scale quantum era.

Quantum entanglement to extract a true ground state from an approximate ground state

Abstract We propose a procedure to extract a true ground state from an approximate ground state by using quantum entanglement. We use plural ancilla qubits with hierarchical structure, intending to gradually put up approximate precision. We demonstrate the procedure for quantum systems with a few qubits that derive from the (1+1)-dimensional Schwinger model by classically emulated digital quantum simulation. Although we use for simplicity an approximate ground state prepared by the adiabatic quantum computation, our procedure is applicable any approximate ground state that is a superposition of a true ground state and excited states. Our procedure is applicable for an N-qubits Hamiltonian with a non-degenerate ground state.

Simulating adiabatic quantum computing with parameterized quantum circuits

Abstract Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term devices, a number of hybrid approaches have been pursued in which a parameterized quantum circuit prepares and measures quantum states and a classical optimization algorithm minimizes an objective function that encompasses the solution to the problem of interest. In this work, we propose a different approach starting by analyzing how a small perturbation of a Hamiltonian affects the parameters that minimize the energy within a family of parameterized quantum states. We derive a set of equations that allow us to compute the new minimum by solving a constrained linear system of equations that is obtained from measuring a series of observables on the unperturbed system. We then propose a discrete version of adiabatic quantum computing that can be implemented in a near-term device while at the same time is insensitive to the initialization of the parameters and to other limitations hindered in the optimization part of variational quantum algorithms. We compare our proposed algorithm with the variational quantum eigensolver on two classical optimization problems, namely MaxCut and number partitioning, and on a quantum-spin configuration problem, the transverse-field ising chain model, and confirm that our approach demonstrates superior performance.

Single-layer digitized-counterdiabatic quantum optimization for p-spin models

Abstract Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers from limited hardware coherence times. In this sense, counterdiabatic quantum protocols provide a shortcut to this process, steering the system along its ground state with fast-changing Hamiltonian. In this work, we take full advantage of a digitized-counterdiabatic quantum optimization algorithm to find an optimal solution of the p-spin model up to four-local interactions. We choose a suitable scheduling function and initial Hamiltonian such that a single-layer quantum circuit suffices to produce a good ground-state overlap. By further optimizing parameters using variational methods, we solve with unit accuracy two-spin, three-spin, and four-spin problems for 100%, 93%, and 83% of instances, respectively. As a particular case of the latter, we also solve factorization problems involving 5, 9, and 12 qubits. Due to the low computational overhead, our compact approach may become a valuable tool towards quantum advantage in the NISQ era.

Power flow analysis using quantum and digital annealers: a discrete combinatorial optimization approach

Power flow (PF) analysis is a foundational computational method to study the flow of power in an electrical network. This analysis involves solving a set of non-linear and non-convex differential-algebraic equations. State-of-the-art solvers for PF analysis, therefore, face challenges with scalability and convergence, specifically for large-scale and/or ill-conditioned cases characterized by high penetration of renewable energy sources, among others. The adiabatic quantum computing paradigm has been proven to efficiently find solutions for combinatorial problems in the noisy intermediate-scale quantum (NISQ) era, and it can potentially address the limitations posed by state-of-the-art PF solvers. For the first time, we propose a novel adiabatic quantum computing approach for efficient PF analysis. Our key contributions are (i) a combinatorial PF algorithm and a modified version that aligns with the principles of PF analysis, termed the adiabatic quantum PF algorithm (AQPF), both of which use Quadratic Unconstrained Binary Optimization (QUBO) and Ising model formulations; (ii) a scalability study of the AQPF algorithm; and (iii) an extension of the AQPF algorithm to handle larger problem sizes using a partitioned approach. Numerical experiments are conducted using different test system sizes on D-Wave’s Advantage™ quantum annealer, Fujitsu’s digital annealer V3, D-Wave’s quantum-classical hybrid annealer, and two simulated annealers running on classical computer hardware. The reported results demonstrate the effectiveness and high accuracy of the proposed AQPF algorithm and its potential to speed up the PF analysis process while handling ill-conditioned cases using quantum and quantum-inspired algorithms.

Hybrid quantum annealing decomposition framework for unit commitment

Quantum computing is an emerging and promising technology that has overwhelming quantum advantages compared to its classical counterparts. Unit commitment (UC) is a critical issue in the power system, and it becomes more challenging with the integration of intermittent renewable energy. Therefore, this paper proposes an innovative decomposition and coordination optimization framework to accelerate the solution of UC, in which the interaction between an adiabatic quantum computer and a classical computer is designed to harness the immense computational power of quantum computers effectively. First, decomposition methods considering the requirements of quantum computers are introduced to decompose UC into small-scale models. Then, the paper presents a quadratic unconstrained binary optimization modeling method to transform UC problems into the form of quantum computing. Furthermore, due to the limitations of quantum computing resources, a reductive variable technique is proposed to reduce the number of slack variables in the optimization model and ensure that it remains feasible for quantum computers. Case studies conducted in test systems with a quantum annealing simulator and a real quantum annealing computer illustrate the feasibility and effectiveness of the method and demonstrate its potential in the era of quantum computing.

Thermodynamics of adiabatic quantum pumping in quantum dots

Thermodynamics of adiabatic quantum pumping in quantum dots

Support vector machine based on the quadratic unconstrained binary optimization model

Abstract Support vector machine (SVM) is a powerful supervised machine learning model that is often used in binary classification algorithms. As Moore’s Law approaches its theoretical limits and the demand for machine learning to handle large-scale, high-dimensional data analysis intensifies, the necessity of adopting non-traditional computational approaches becomes evident. Quantum computing, in particular, emerges as a vital solution for the effective training of SVM models, providing capabilities beyond those of classical computing systems. To solve the above problems, a QUBO (quadratic unconstrained binary optimization) model is proposed to transform the SVM machine learning model into a quadratic unconstrained binary optimization problem so that they can be effectively trained on the D-Wave platform using adiabatic quantum computer. The results show that the QUBO model can transform the SVM model into a simple quadratic programming problem, which makes it suitable for adiabatic quantum computer processing. When processing large-scale and high-dimensional data, this transformation shows a natural advantage and significantly improves computational efficiency. The application potential of this transformation technology is huge in the medical field.

Photonic counterdiabatic quantum optimization algorithm

One of the key applications of near-term quantum computers has been the development of quantum optimization algorithms. However, these algorithms have largely been focused on qubit-based technologies. Here, we propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm reduces the required quantum operations for optimization compared to adiabatic protocols. This reduction enables us to tackle non-convex continuous optimization within the near-term era of quantum computing. Through illustrative benchmarking, we show that our approach can outperform existing state-of-the-art hybrid adiabatic quantum algorithms in terms of convergence and implementability. Our algorithm offers a practical and accessible experimental realization, bypassing the need for high-order operations and overcoming experimental constraints. We conduct a proof-of-principle demonstration on Xanadu’s eight-mode nanophotonic quantum chip, successfully showcasing the feasibility and potential impact of the algorithm.

Fast forward problem for adiabatic quantum dynamics: Estimation of the energy cost

Fast forward problem for adiabatic quantum dynamics: Estimation of the energy cost

SuperSIM: a comprehensive benchmarking framework for neural networks using superconductor Josephson devices

Abstract This paper introduces SuperSIM, a benchmarking framework tailored for neural networks using superconducting Josephson devices, specifically focusing on Adiabatic Quantum Flux Parametron (AQFP) based Processing-in-Memory (PIM) architectures. Our framework offers in-depth architecture-level simulations and performance assessments to enhance AQFP PIM chip development. It supports single and multi-bit PIM designs, various AQFP memory cell types, and diverse clocking methods. Additionally, it integrates circuit-level models for precise energy, delay, and area measurements, ensuring accurate performance evaluation. The framework includes application, device, and architectural layers for versatile configurations and cycle-accurate energy, latency, and area simulations. Experiments validate our framework, with case studies on algorithm and architecture-level features, examining data precision, crossbar size, operating frequency and clocking scheme impacts on computational accuracy, energy use, overall latency and hardware cost.

Classical computation over quantum architectures

Abstract The lack of purely Quantum Programming Languages constitutes a hurdle in the general description of quantum computational processes; the implementation is heavily dependent on the considered quantum computational model. To bypass the obstacle, this paper pursues a new direction, investigating the compilation of classical programming paradigms over different quantum computational models: Gate-Based, Measurement-Based and Adiabatic Quantum Computation. Since graphs can be exploited to describe both classical and quantum computations, the problem of graph encoding on quantum hardware is tightly connected to our purposes. As such, it holds a major relevance in our quest for quantum compilation. While studying these topics through the lenses of Graph Theory, declarative programming emerges as the ideal candidate for such endeavour. In this paper we consider some existing quantum computational models and for each of them we identify the main subtleties in the compilation of classical languages. In turn, we break these complexities down into easier problems to stimulate further developments in this area of research. As it turns out, the observations for each model differ widely. Nevertheless, as for the tasks here considered, no model seems to claim supremacy over the others. In contrast, declarative programming maintains the spot as the ideal candidate for quantum compilation, independently of the model.

Adiabatic quantum imaginary time evolution

We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime and, unlike standard adiabatic state preparation, the final Hamiltonian is not the system Hamiltonian. Instead, the algorithm obtains the adiabatic Hamiltonian by integrating a classical differential equation that ensures that one follows the imaginary time evolution state trajectory. We introduce some heuristics that allow this protocol to be implemented on quantum architectures with limited resources. We explore the performance of this algorithm via classical simulations in a one-dimensional spin model and highlight essential features that determine its cost, performance, and implementability for longer times, and compare to the original quantum imaginary time evolution for ground-state preparation. More generally, our algorithm expands the range of states accessible to adiabatic state preparation methods beyond those that are expressed as ground states of simple explicit Hamiltonians. Published by the American Physical Society 2024

Frames of Group Sets and Their Application in Bundle Theory

We study fiber bundles where the fibers are not a group G but a free G-space with disjoint orbits. The fibers are then not torsors but disjoint unions of these; hence, we like to call them semi-torsors. Bundles of semi-torsors naturally generalize principal bundles, and we call these semi-principal bundles. These bundles admit parallel transport in the same way that principal bundles do. The main difference is that lifts may end up in another group orbit, meaning that the change cannot be described by group translations alone. The study of such effects is facilitated by defining the notion of a basis of a G-set, in analogy with a basis of a vector space. The basis elements serve as reference points for the orbits so that parallel transport amounts to reordering the basis elements and scaling them with the appropriate group elements. These two symmetries of the bases are described by a wreath product group. The notion of basis also leads to a frame bundle, which is principal and so allows for a conventional treatment. In fact, the frame bundle functor is found to be a retraction from the semi-principal bundles to the principal bundles. The theory presented provides a mathematical framework for a unified description of geometric phases and exceptional points in adiabatic quantum mechanics.

Large Deviation Full Counting Statistics in Adiabatic Open Quantum Dynamics.

The state of an open quantum system undergoing an adiabatic process evolves by following the instantaneous stationary state of its time-dependent generator. This observation allows one to characterize, for a generic adiabatic evolution, the average dynamics of the open system. However, information about fluctuations of dynamical observables, such as the number of photons emitted or the time-integrated stochastic entropy production in single experimental runs, requires controlling the whole spectrum of the generator and not only the stationary state. Here, we show how such information can be obtained in adiabatic open quantum dynamics by exploiting tools from large deviation theory. We prove an adiabatic theorem for deformed generators, which allows us to encode, in a biased quantum state, the full counting statistics of generic time-integrated dynamical observables. We further compute the probability associated with an arbitrary "rare" time history of the observable and derive a dynamics which realizes it in its typical behavior. Our results provide a way to characterize and engineer adiabatic open quantum dynamics and to control their fluctuations.

A benchmarking study of quantum algorithms for combinatorial optimization

We study the performance scaling of three quantum algorithms for combinatorial optimization: measurement-feedback coherent Ising machines (MFB-CIM), discrete adiabatic quantum computation (DAQC), and the Dürr–Høyer algorithm for quantum minimum finding (DH-QMF) that is based on Grover’s search. We use MaxCut problems as a reference for comparison, and time-to-solution (TTS) as a practical measure of performance for these optimization algorithms. For each algorithm, we analyze its performance in solving two types of MaxCut problems: weighted graph instances with randomly generated edge weights attaining 21 equidistant values from −1 to 1; and randomly generated Sherrington–Kirkpatrick (SK) spin glass instances. We empirically find a significant performance advantage for the studied MFB-CIM in comparison to the other two algorithms. We empirically observe a sub-exponential scaling for the median TTS for the MFB-CIM, in comparison to the almost exponential scaling for DAQC and the proven Õ2n\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\widetilde{{{{\\mathcal{O}}}}}\\left(\\sqrt{{2}^{n}}\\right)$$\\end{document} scaling for DH-QMF. We conclude that the MFB-CIM outperforms DAQC and DH-QMF in solving MaxCut problems.

Quantum model regression for generating fuzzy numbers in adiabatic quantum computing

This paper addresses the problem of inherent fuzziness in real-world data, arising from uncertainties, complexities, and limitations of traditional statistical methods. We introduce a pioneering method leveraging Adiabatic Quantum Computing (AQC), based on an adiabatic quantum regression model, to generate fuzzy numbers—ideal tools owing to their extension of real numbers and robust arithmetic properties. This innovative approach overcomes challenges in Quantum Machine Learning (QML) and limitations of Noisy Intermediate-Scale Quantum (NISQ) computers, providing a solution superior to conventional statistical methods and addressing the crucial issue of exponential power increase. Unique to this work, we offer rare closed-form expressions to produce fuzzy numbers through AQC and emphasise the integration of random variables and fuzzy numbers to encapsulate uncertainty fully. We propose a novel transformation of the Cumulative Distribution Function (CDF) into triangular and trapezoidal fuzzy numbers using AQC, enabling a comprehensive description of probability distributions of random variables. Experimental results are detailed, demonstrating the significant applicability and breakthroughs of this research in addressing data fuzziness.

Towards Adiabatic Quantum Computing Using Compressed Quantum Circuits

We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to represent adiabatic gauge potentials. Traditionally, Trotter product formulas are used to turn adiabatic time evolution into quantum circuits and the addition of counterdiabatic driving increases the circuit depth per time step. Instead, we classically optimize a parameterized quantum circuit of fixed depth to simultaneously capture adiabatic evolution together with counterdiabatic driving over many time steps. The methods are applied to the ground-state preparation of quantum Ising chains with transverse and longitudinal fields. We show that the classically optimized circuits can significantly outperform Trotter product formulas. Additionally, we discuss how the approach can be used for combinatorial optimization. Published by the American Physical Society 2024

Modeling the performance and bandwidth of single-atom adiabatic quantum memories

Quantum memories are essential for quantum repeaters, which will form the backbone of the future quantum internet. Such memory can capture a signal state for a controllable amount of time, after which this state can be retrieved. In this work, we theoretically investigated how atomic material and engineering parameters affect the performance and bandwidth of a quantum memory. We have applied a theoretical model for quantum memory operation based on the Lindblad master equation and adiabatic quantum state manipulation. The materials’ properties and their uncertainty are evaluated to determine the performance of Raman-type quantum memories by showcasing two defects in two-dimensional hexagonal boron nitride. We have derived a scheme to calculate the signal bandwidth based on the material parameters as well as the maximum efficiency that can be realized. The bandwidth depends on four factors: the signal photon frequency, the dipole transition moments in the electronic structure, the cavity volume, and the strength of the external control electric field. As our scheme is general and independent of materials, it can be applied to many other quantum materials with a suitable three-level structure. We, therefore, provided a promising route for designing and selecting materials for quantum memories. Our work is, therefore, an important step toward the realization of a large-scale quantum network.

Quantum Parallel Training of a Boltzmann Machine on an Adiabatic Quantum Computer

AbstractDespite the anticipated speed‐up of quantum computing, the achievement of a measurable advantage remains subject to ongoing debate. Adiabatic Quantum Computers (AQCs) are quantum devices designed to solve quadratic uncostrained binary optimization (QUBO) problems, but their intrinsic thermal noise can be leveraged to train computationally demanding machine learning algorithms such as the Boltzmann Machine (BM). Despite an asymptotic advantage is expected only for large networks, a limited quantum speed up can be already achieved on a small BM is shown, by exploiting parallel adiabatic computation. This approach exhibits a 8.6‐fold improvement in wall time on the Bars and Stripes dataset when compared to a parallelized classical Gibbs sampling method, which has never been outperformed before by quantum approaches.