Noisy Intermediate-scale Quantum Research Articles

Subspace-Search Quantum Imaginary Time Evolution for Excited State Computations.

Quantum systems in excited states are attracting significant interest with the advent of noisy intermediate-scale quantum (NISQ) devices. While ground states of small molecular systems are typically explored using hybrid variational algorithms like the variational quantum eigensolver (VQE), the study of excited states has received much less attention, partly due to the absence of efficient algorithms. In this work, we introduce the subspace search quantum imaginary time evolution (SSQITE) method, which calculates excited states using quantum devices by integrating key elements of the subspace search variational quantum eigensolver (SSVQE) and the variational quantum imaginary time evolution (VarQITE) method. The effectiveness of SSQITE is demonstrated through calculations of low-lying excited states of benchmark model systems including H2 and LiH molecules. A toy Hamiltonian is also employed to demonstrate that the robustness of VarQITE in avoiding local minima extends to its use in excited state algorithms. With this robustness in avoiding local minima, SSQITE shows promise for advancing quantum computations of excited states across a wide range of applications.

Multi-Objective Simulated Annealing-Based Quantum Circuit Cutting for Distributed Quantum Computation

Abstract In the current noisy intermediate-scale quantum (NISQ) era, the number of qubits and the depth of quantum circuits in a quantum computer are limited because of complex operation among increasing number of qubits, low-fidelity quantum gates under noise, and short coherence time of physical qubits. However, with distributed quantum computation (DQC) in which multiple small-scale quantum computers cooperate, large-scale quantum circuits can be implemented. In DQC, it is a key step to decompose large-scale quantum circuits into several small-scale subcircuits equivalently. In this paper, we propose a quantum circuit cutting scheme for the circuits consisting of only single-qubit gates and two-qubit gates. In the scheme, the minimum number of non-local gates and the minimum rounds of subcircuits operation are obtained by using the multi-objective simulated annealing (MOSA) algorithm to cluster the gates and to choose the cutting positions whilst using non-local gates. A reconstruction process is also proposed to calculate the probability distribution of output states of the original circuit. As an example, the 7-qubit circuit of Shor algorithm factoring 15 is used to verify the algorithm. Five cutting schemes are recommended, which can be selected according to practical requirements. Compared with the results of the mixing integer programming (MIP) algorithm, the number of execution rounds is efficiently reduced by slightly increasing the number of nonlocal gates.

Robust optimal control for a systematic error in the control amplitude of transmon qubits

In the era of Noisy Intermediate-Scale Quantum computing as well as in error correcting circuits, physical qubits coherence time and high fidelity gates are essential to the functioning of quantum computers. In this paper, we demonstrate theoretically and experimentally, that pulses designed by optimization can be used to counteract the loss of fidelity due to a control amplitude error of the transmon qubit. We analyze the control landscape obtained by robust optimal control and find it to depend on the error range, namely the solutions can get trapped in the basin of attraction of sub-optimal solutions. Robust controls are found for different error values and are compared to an incoherent loss of fidelity mechanism due to a finite relaxation rate. The controls are tested on the IBMQ’s qubit and found to demonstrate resilience against significant ∼10% errors.

A comprehensive review of quantum machine learning: from NISQ to fault tolerance.

Quantum machine learning, which involves running machine learning algorithms on quantum devices, has garnered significant attention in both academic and business circles. In this paper, we offer a comprehensive and unbiased review of the various concepts that have emerged in the field of quantum machine learning. This includes techniques used in Noisy Intermediate-Scale Quantum (NISQ) technologies and approaches for algorithms compatible with fault-tolerant quantum computing hardware. Our review covers fundamental concepts, algorithms, and the statistical learning theory pertinent to quantum machine learning.

Quantum Tunneling: From Theory to Error‐Mitigated Quantum Simulation

AbstractEver since the discussions about a possible quantum computer arised, quantum simulations have been at the forefront of possible utilities, with the task of quantum simulations being one that promises quantum advantage. Recently, advancements have made it feasible to simulate complex molecules using Variational Quantum Eigensolvers or study the dynamics of many‐body spin Hamiltonians. These simulations have the potential to yield valuable outcomes through the application of error mitigation techniques. Simulating smaller models carries a great amount of importance as well and currently, in the Noisy Intermediate Scale Quantum era, is more feasible since it is less prone to errors. The objective of this work is to examine the theoretical background and the circuit implementation of a quantum tunneling simulation, with an emphasis on hardware considerations. This study presents the theoretical background required for such implementation and highlights the main stages of its development. By building on classic approaches of quantum tunneling simulations, this study aims at improving the result of such simulations by employing error mitigation techniques, Zero Noise Extrapolation, and Readout Error Mitigation and uses them in conjunction with multiprogramming of the quantum chip, a technique used for solving the hardware under‐utilization problem that arises in such contexts.

Hybrid quantum-classical computation for automatic guided vehicles scheduling

Motivated by recent efforts to develop quantum computing for practical, industrial-scale challenges, we demonstrate the effectiveness of state-of-the-art hybrid (not necessarily quantum) solvers in addressing the business-centric optimization problem of scheduling Automatic Guided Vehicles (AGVs). Some solvers can already leverage noisy intermediate-scale quantum (NISQ) devices. In our study, we utilize D-Wave hybrid solvers that implement classical heuristics with potential assistance from a quantum processing unit. This hybrid methodology performs comparably to existing classical solvers. However, due to the proprietary nature of the software, the precise contribution of quantum computation remains unclear. Our analysis focuses on a practical, business-oriented scenario: scheduling AGVs within a factory constrained by limited space, simulating a realistic production setting. Our approach maps a realistic AGVs problem onto one reminiscent of railway scheduling and demonstrates that the AGVs problem is better suited to quantum computing than its railway counterpart, the latter being denser in terms of the average number of constraints per variable. The main idea here is to highlight the potential usefulness of a hybrid approach for handling AGVs scheduling problems of practical sizes. We show that a scenario involving up to 21 AGVs, significant due to possible deadlocks, can be efficiently addressed by a hybrid solver in seconds.

Simulating Cavity-Modified Electron Transfer Dynamics on NISQ Computers.

We present an algorithm based on the quantum-mechanically exact tensor-train thermo-field dynamics (TT-TFD) method for simulating cavity-modified electron transfer dynamics on noisy intermediate-scale quantum (NISQ) computers. The utility and accuracy of the proposed methodology is demonstrated on a model for the photoinduced intramolecular electron transfer reaction within the carotenoid-porphyrin-C60 molecular triad in tetrahydrofuran (THF) solution. The electron transfer rate is found to increase significantly with increasing coupling strength between the molecular system and the cavity. The rate process is also seen to shift from overdamped monotonic decay to under-damped oscillatory dynamics. The electron transfer rate is seen to be highly sensitive to the cavity frequency, with the emergence of a resonance cavity frequency for which the effect of coupling to the cavity is maximal. Finally, an implementation of the algorithm on the IBM Osaka quantum computer is used to demonstrate how TT-TFD-based electron transfer dynamics can be simulated accurately on NISQ computers.

Solving linear systems on quantum hardware with hybrid HHL++

The limited capabilities of current quantum hardware significantly constrain the scale of experimental demonstrations of most quantum algorithmic primitives. This makes it challenging to perform benchmarking of the current hardware using useful quantum algorithms, i.e., application-oriented benchmarking. In particular, the Harrow-Hassidim-Lloyd (HHL) algorithm is a critical quantum linear algebra primitive, but the majority of the components of HHL are far out of the reach of noisy intermediate-scale quantum devices, which has led to the proposal of hybrid classical-quantum variants. The goal of this work is to further bridge the gap between proposed near-term friendly implementations of HHL and the kinds of quantum circuits that can be executed on noisy hardware. Our proposal adds to the existing literature of hybrid quantum algorithms for linear algebra that are more compatible with the current scale of quantum devices. Specifically, we propose two modifications to the Hybrid HHL algorithm proposed by Lee et al., leading to our algorithm Hybrid HHL++\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\hbox {HHL}^{++}$$\\end{document}: (1) propose a novel algorithm for determining a scaling factor for the linear system matrix that maximizes the utility of the amount of ancillary qubits allocated to the phase estimation component of HHL, and (2) introduce a heuristic for compressing the HHL circuit. We demonstrate the efficacy of our work by running our modified Hybrid HHL on Quantinuum System Model H-series trapped-ion quantum computers to solve different problem instances of small-scale portfolio optimization problems, leading to the largest experimental demonstrations of HHL for an application to date.

Towards an efficient variational quantum algorithm for solving linear equations

Variational quantum algorithms are promising methods with the greatest potential to achieve quantum advantage, widely employed in the era of noisy intermediate-scale quantum computing. This study presents an advanced variational hybrid algorithm (EVQLSE) that leverages both quantum and classical computing paradigms to address the solution of linear equation systems. Initially, an innovative loss function is proposed, drawing inspiration from the similarity measure between two quantum states. This function exhibits a substantial improvement in computational complexity when benchmarked against the variational quantum linear solver. Subsequently, a specialized parameterized quantum circuit structure is presented for small-scale linear systems, which exhibits powerful expressive capabilities. Through rigorous numerical analysis, the expressiveness of this circuit structure is quantitatively assessed using a variational quantum regression algorithm, and it obtained the best score compared to the others. Moreover, the expansion in system size is accompanied by an increase in the number of parameters, placing considerable strain on the training process for the algorithm. To address this challenge, an optimization strategy known as quantum parameter sharing is introduced, which proficiently minimizes parameter volume while adhering to exacting precision standards. Finally, EVQLSE is successfully implemented on a quantum computing platform provided by IBM for the resolution of large-scale problems characterized by a dimensionality of 220.

Enhancing quantum annealing accuracy through replication-based error mitigation*

Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.

Quantum-assisted rendezvous on graphs: explicit algorithms and quantum computer simulations

Abstract We study quantum advantage in one-step rendezvous games on simple graphs analytically, numerically, and using noisy intermediate-scale quantum (NISQ) processors. Our protocols realise the recently discovered (Mironowicz 2023 New J. Phys. 25 013023) optimal bounds for small cycle graphs and cubic graphs. In the case of cycle graphs, we generalise the protocols to arbitrary graph size. The NISQ processor experiments realise the expected quantum advantage with high accuracy for rendezvous on the complete graph K 3. In contrast, for the graph 2 K 4 , formed by two disconnected 4-vertex complete graphs, the performance of the NISQ hardware is sub-classical, consistent with the deeper circuit and known qubit decoherence and gate error rates.

Delayed-measurement one-way quantum computing on cloud quantum computer

Abstract One-way quantum computation focuses on initially generating an entangled cluster state followed by a sequence of measurements with classical communication of their individual outcomes. Recently, a delayed-measurement approach has been applied to replace classical communication of individual measurement outcomes. In this work, by considering the delayed-measurement approach, we demonstrate a modified one-way CNOT gate using the on-cloud superconducting quantum computing platform: Quafu. The modified protocol for one-way quantum computing requires only three qubits rather than the four used in the standard protocol. Since this modified cluster state decreases the number of physical qubits required to implement one-way computation, both the scalability and complexity of the computing process are improved. Compared to previous work, this modified one-way CNOT gate is superior to the standard one in both fidelity and resource requirements. We have also numerically compared the behavior of standard and modified methods in large-scale one-way quantum computing. Our results suggest that in a noisy intermediate-scale quantum (NISQ) era, the modified method shows a significant advantage for one-way quantum computation.

Quantum support vector data description for anomaly detection

Abstract Anomaly detection is a critical problem in data analysis and pattern recognition, finding applications in various domains. We introduce quantum support vector data description (QSVDD), an unsupervised learning algorithm designed for anomaly detection. QSVDD utilizes a shallow-depth quantum circuit to learn a minimum-volume hypersphere that tightly encloses normal data, tailored for the constraints of noisy intermediate-scale quantum (NISQ) computing. Simulation results on the MNIST and Fashion MNIST image datasets, as well as credit card fraud detection, demonstrate that QSVDD outperforms both quantum autoencoder and deep learning-based approaches under similar training conditions. Notably, QSVDD requires an extremely small number of model parameters, which increases logarithmically with the number of input qubits. This enables efficient learning with a simple training landscape, presenting a compact quantum machine learning model with strong performance for anomaly detection.

Overdispersion in gate tomography: Experiments and continuous, two-scale random walk model on the Bloch sphere

Noisy intermediate-scale quantum computers (NISQ) are computing hardware in their childhood, but they are showing high promise and growing quickly. They are based on so-called qubits, which are the quantum equivalents of bits. Any given qubit state results in a given probability of observing a value of zero or one in the readout process. One of the main concerns for NISQ machines is the inherent noisiness of qubits, i.e. the observable frequencies of zeros and ones do not correspond to the theoretically expected probability, as the qubit states are subject to random disturbances over time and with each additional algorithmic operation applied to them. Models to describe the influence of this noise exist. In this study, we conduct extensive experiments on quantum noise. Based on our data, we show that existing noise models lack important aspects. Specifically, they fail to properly capture the aggregation of noise effects over time (or over an algorithm’s runtime), and they are underdispersed. With underdispersion, we refer to the fact that observable frequencies scatter much more between repeated experiments than what the standard assumptions of the binomial distribution would allow for. Based on these shortcomings, we develop an extended noise model for the probability distribution of observable frequencies as a function of the number of gate operations. The model roots back to a known continuous random walk on the (Bloch) sphere, where the angular diffusion coefficient can be used to characterize the standard noisiness of gate operations. Here, we superimpose a second random walk at the scale of multiple readouts to account for overdispersion. Further, our model has known, explicit components for noise during state preparation and measurement (SPAM). The interaction of these two random walks predicts theoretical, runtime-dependent bounds for probabilities. Overall, it is a three-parameter distributional model that fits the data much better than the corresponding one-scale model (without overdispersion), and we demonstrate the better fit and the plausibility of the predicted bounds via Bayesian data-model analysis.

H-QNN: A Hybrid Quantum–Classical Neural Network for Improved Binary Image Classification

Image classification is an important application for deep learning. With the advent of quantum technology, quantum neural networks (QNNs) have become the focus of research. Traditional deep learning-based image classification involves using a convolutional neural network (CNN) to extract features from the image and a multi-layer perceptron (MLP) network to create the decision boundaries. However, quantum circuits with parameters can extract rich features from images and also create complex decision boundaries. This paper proposes a hybrid QNN (H-QNN) model designed for binary image classification that capitalizes on the strengths of quantum computing and classical neural networks. Our H-QNN model uses a compact, two-qubit quantum circuit integrated with a classical convolutional architecture, making it highly efficient for computation on noisy intermediate-scale quantum (NISQ) devices that are currently leading the way in practical quantum computing applications. Our H-QNN model significantly enhances classification accuracy, achieving a 90.1% accuracy rate on binary image datasets. In addition, we have extensively evaluated baseline CNN and our proposed H-QNN models for image retrieval tasks. The obtained quantitative results exhibit the generalization of our H-QNN for downstream image retrieval tasks. Furthermore, our model addresses the issue of overfitting for small datasets, making it a valuable tool for practical applications.

Gate-based quantum neurons in hybrid neural networks

Abstract Quantum computing is conceived as a promising and powerful next-generation platform for information processing and it has been shown that it could bring significant accelerations to certain tasks, compared to its classical counterparts. With recent advances in Noisy Intermediate-Scale Quantum~(NISQ) devices, we can process classical data from real-world problems using hybrid quantum systems. In this work, we investigate the critical problem of designing a gate-based hybrid quantum neuron under NISQ constraints to enable the construction of scalable hybrid quantum deep neural networks~(HQDNNs). We explore and characterize diverse quantum circuits for hybrid quantum neurons and discuss related critical components of HQDNNs. We also utilize a new schema to infer multiple predictions from a single hybrid neuron. We further compose a highly customizable platform for simulating HQDNNs via Qiskit and test them on diverse classification problems including the iris and the wheat seed datasets. The results show that even HQDNNs with the simplest neurons could lead to superior performance on these tasks. Finally, we show that the HQDNNs are robust to certain levels of noise, making them preferred on NISQ devices. Our work provides a comprehensive investigation of building scalable near-term gate-based HQDNNs and paves the way for future studies of quantum deep learning via both simulations on classical computers and experiments on accessible NISQ devices.

Flexible blind quantum computation with unnecessarily universal quantum servers

Blind quantum computation (BQC) allows clients with limited quantum capabilities to delegate their tasks to powerful quantum servers and still keep their inputs, algorithms, and outputs private. However, in the noisy intermediate-scale quantum (NISQ) era, quantum computers as servers only control limited number of qubits and are not powerful enough. In addition, each of current BQC models is usually suitable for only one type of users. Therefore, this paper offers a flexible BQC (BQCf for short) model for two types of users with different quantum capabilities where any one of two types of users can complete BQC tasks with the help of the other type of users and quantum servers. To be more specific, we propose two BQCf protocols by using the given model. In the first protocol, one user Alice only with the ability to prepare single-qubit states can realize BQC tasks by cooperating with another user Bob who is just capable of performing single-qubit measurements and a quantum server Charlie. Similarly in the second one, Bob can realize BQC tasks by cooperating with Alice and Charlie. In both protocols, the server Charlie only requires a quantum register of small size and performing CZ gates and thus it is unnecessary to be universal and may be less difficult to realize in the short run. Furthermore, both proposed protocols are verifiable, namely that the user can detect whether the server is honest. Finally, examples of the proposed protocols for implementing Deutsch’s algorithms are simulated through Qiskit framework to show their feasibility and correctness.

Impact of unreliable devices on stability of quantum computations

Noisy intermediate-scale quantum (NISQ) devices are valuable platforms for testing the tenets of quantum computing, but these devices are susceptible to errors arising from de-coherence, leakage, cross-talk and other sources of noise. This raises concerns regarding the stability of results when using NISQ devices since strategies for mitigating errors generally require well-characterized and stationary error models. Here, we quantify the reliability of NISQ devices by assessing the necessary conditions for generating stable results within a given tolerance. We use similarity metrics derived from device characterization data to derive and validate bounds on the stability of a 5-qubit implementation of the Bernstein-Vazirani algorithm. Simulation experiments conducted with noise data from IBM washington, spanning January 2022 to April 2023, revealed that the reliability metric fluctuated between 41% and 92%. This variation significantly surpasses the maximum allowable threshold of 2.2% needed for stable outcomes. Consequently, the device proved unreliable for consistently reproducing the statistical mean in the context of the Bernstein-Vazirani circuit.

HQ-DCGAN: Hybrid quantum deep convolutional generative adversarial network approach for ECG generation

The class imbalance of electrocardiogram (ECG) data is a serious impediment to the development of diagnostic systems for heart disease. To address this issue, this paper proposes HQ-DCGAN, a hybrid quantum deep convolutional generative adversarial network, specifically designed for the generation of ECGs. The proposed algorithm employs different quantum convolutional layers for the generator and discriminator as feature extractors and utilizes parameterized quantum circuits (PQCs) to enhance computational capabilities, along with the model-feature mapping process. Moreover, this algorithm preserves the nonlinearity and scalability inherent to classical convolutional neural networks (CNNs), thereby optimizing the utilization of quantum resources, and ensuring compatibility with contemporary quantum devices. In addition, this paper proposes a novel evaluation metric, 1D Fréchet Inception Distance (1DFID), to assess the quality of the generated ECG signals. Simulation experiments show that HQ-DCGAN exhibits strong performance in ECG signal generation. Furthermore, the generated signals achieve an average classification accuracy of 82.2%, outperforming the baseline algorithms. It has been experimentally proven that HQ-DCGAN is friendly to currently noisy intermediate-scale quantum (NISQ) computers, in terms of both number of qubits and circuit depths, while improving the stability.

Prolonging a discrete time crystal by quantum-classical feedback

Nonequilibrium phases of quantum matter featuring time crystalline eigenstate order have been realized recently on noisy intermediate-scale quantum (NISQ) devices. While ideal quantum time crystals exhibit collective subharmonic oscillations and spatiotemporal long-range order persisting for infinite times, the decoherence time of current NISQ devices sets a natural limit to the survival of these phases, restricting their observation to a shallow quantum circuit. Here we propose a time-periodic scheme that leverages quantum-classical feedback protocols in subregions of the system to enhance a time crystal signal significantly exceeding the decoherence time of the device. As a case of study, we demonstrate the survival of the many-body localized discrete time crystal phase in the one-dimensional periodically kicked Ising model, accounting for decoherence of the system with an environment. Based on classical simulation of quantum circuit realizations we find that this approach is suitable for implementation on existing quantum hardware and presents a prospective path to simulate complex quantum many-body dynamics that transcend the low depth limit of current digital quantum computers. Published by the American Physical Society 2024