Fighting against noise is crucial for Noisy Intermediate Scale Quantum (NISQ) devices to demonstrate practical quantum applications. In this work, we give a paradigm of quantum error mitigation based on the vectorization of density matrices for variational quantum algorithms. Different from the ideas of existing quantum error mitigation methods that try to distill noiseless information from noisy quantum states, our proposal directly changes the way of encoding information and maps the density matrices of noisy quantum states to noiseless virtual pure states, which is realized by an NISQ-friendly measurement protocol and a classical postprocessing procedure. Our protocol requires no knowledge of the noise model, no ability to tune the noise strength, and no ancilla qubits for complicated controlled unitaries. Under our encoding, NISQ devices are always preparing virtual pure quantum states that are highly desired resources for variational quantum algorithms to have good performance in many tasks. We show how this protocol can be well fitted into variational quantum algorithms. We give several concrete ansatz constructions that are suitable for our proposal and do theoretical analysis on the sampling complexity, the expressibility, and the trainability. We also give a discussion on how this protocol is influenced by large noise and how it can be well combined with other quantum error mitigation protocols. The effectiveness of our proposal is demonstrated by various numerical experiments.
Fighting against noise is crucial for Noisy Intermediate Scale Quantum (NISQ) devices to demonstrate practical quantum applications. In this work, we give a paradigm of quantum error mitigation based on the vectorization of density matrices for variational quantum algorithms. Different from the ideas of existing quantum error mitigation methods that try to distill noiseless information from noisy quantum states, our proposal directly changes the way of encoding information and maps the density matrices of noisy quantum states to noiseless virtual pure states, which is realized by an NISQ-friendly measurement protocol and a classical postprocessing procedure. Our protocol requires no knowledge of the noise model, no ability to tune the noise strength, and no ancilla qubits for complicated controlled unitaries. Under our encoding, NISQ devices are always preparing virtual pure quantum states that are highly desired resources for variational quantum algorithms to have good performance in many tasks. We show how this protocol can be well fitted into variational quantum algorithms. We give several concrete ansatz constructions that are suitable for our proposal and do theoretical analysis on the sampling complexity, the expressibility, and the trainability. We also give a discussion on how this protocol is influenced by large noise and how it can be well combined with other quantum error mitigation protocols. The effectiveness of our proposal is demonstrated by various numerical experiments.
Machine Learning-based quantum error mitigation (ML-QEM) has emerged as a promising approach for improving the performance of noisy quantum algorithms. However, existing ML-QEM methods often have restricted applicability to variational circuits and rely on inaccessible noiseless training data. In this work, we propose a practical ML-QEM protocol tailored to variational quantum algorithms, which generates training data by simulating (near-)Clifford circuits. This data is used for model selection and training, producing a mitigation model that can correct variational circuits with arbitrary parameters and transfer across different target Hamiltonians of similar structure. We benchmark the proposed method on the Variational Quantum Eigensolver (VQE) task for the Sherrington-Kirkpatrick Hamiltonian of up to n=12 qubits under various noise models, analyzing its effect on trainability and comparing its performance against standard Zero-Noise Extrapolation (ZNE). The results demonstrate consistent several-fold error suppression across all tested settings and superior performance over ZNE in the high-noise regime, providing evidence for the applicability of the proposed protocol to present-day NISQ processors.
Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy intermediate-scale quantum (NISQ) processors. Such systems leverage classical optimization to tune the parameters of a parameterized quantum circuit (PQC). The goal is minimizing a cost function that depends on measurement outputs obtained from the PQC. Optimization is typically implemented via stochastic gradient descent (SGD). On NISQ computers, gate noise due to imperfections and decoherence affects the stochastic gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits, but they in turn cause an increase in the variance of the gradient estimates. This work studies the impact of quantum gate noise on the convergence of SGD for the variational eigensolver (VQE), a fundamental instance of VQAs. The main goal is ascertaining conditions under which QEM can enhance the performance of SGD for VQEs. It is shown that quantum gate noise induces a nonzero error-floor on the convergence error of SGD (evaluated with respect to a reference noiseless PQC), which depends on the number of noisy gates, the strength of the noise, as well as the eigenspectrum of the observable being measured and minimized. In contrast, with QEM, any arbitrarily small error can be obtained. Furthermore, for error levels attainable with or without QEM, QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently large, and a sufficiently large number of measurements is allowed at each SGD iteration. Numerical examples for a max-cut problem corroborate the main theoretical findings.
The development of practical quantum algorithms hinges critically on the ability to efficiently manage and compress quantum states. Noisy Intermediate-Scale Quantum (NISQ) computers, characterized by limited qubit counts and inherent noise, exacerbate this challenge. This paper proposes a novel quantum state compression technique utilizing tensor decomposition and variational quantum algorithms to minimize qubit requirements while mitigating error accumulation. The core idea involves transforming a complex quantum state into a lower-rank tensor representation, subsequently optimized using a variational quantum algorithm. This approach aims to capture the essential information within the original state, reducing computational overhead and enhancing the feasibility of running quantum algorithms on NISQ devices. We outline the theoretical framework, detailing the mathematical formulation of the compression process, including the tensor representation, variational optimization, and error correction strategies. The paper explores the key parameters influencing the compression ratio and error rates, ultimately demonstrating the potential of this technique to unlock the computational power of NISQ computers.
Minimizing the effect of noise is essential for quantum computers. The conventional method to protect qubits against noise is through quantum error correction. However, for current quantum hardware in the so-called noisy intermediate-scale quantum (NISQ) era, noise presents in these systems and is too high for error correction to be beneficial. Quantum error mitigation is a set of alternative methods for minimizing errors, including error extrapolation, probabilistic error cancellation, measurement error mitigation, subspace expansion, symmetry verification, virtual distillation, etc. The requirement for these methods is usually less demanding than error correction. Quantum error mitigation is a promising way of reducing errors on NISQ quantum computers. This paper gives a comprehensive introduction to quantum error mitigation. The state-of-art error mitigation methods are covered and formulated in a general form, which provides a basis for comparing, combining and optimizing different methods in future work.
Variational Quantum Algorithms are a major method of harnessing Noisy Intermediate-Scale Quantum devices to solve classically intractable problems in physics, chemistry, optimization, and machine learning. The current review offers a critical overview of VQAs, with special emphasis on their theoretical backgrounds, algorithmic structures, and application performance within realistic models of noise. Several key variants, such as the Variational Quantum Eigensolver, Quantum Approximate Optimization Algorithm, and Quantum Neural Networks, are compared in terms of noise robustness, ansatz archi- tecture, and hybrid quantum-classical methods of optimization. Benchmarks in fields such as quantum chemistry, finance modeling, and particles and nuclei physics reveal the poten- tial of VQAs in achieving practical quantum advantage. Fundamentally limiting factors 1such as barren plateaus, optimization overhead, and hardware constraints are considered in addition to mitigation strategies, including adaptive construction of ansatz, informed training in the presence of noise, and quantum error correction using QVECTOR. The paper is concluded with an overview of the scalability and future of VQAs in the direction of transitioning toward fault-tolerant quantum computing.
Quantum error mitigation is essential for many computing tasks on the noisy quantum computer with a limited number of qubits. In this paper, we propose a practical protocol of error mitigation by virtually purifying the quantum state without qubit overhead or requiring only one ancilla qubit. In dual-state purification, we effectively generate a purified state with increased fidelity using the erroneous state and its dual state, respectively, prepared with the noisy quantum circuit and the dual map of its inverse circuit. Combined with tomography purification, we can make sure that the final estimate of an observable is obtained from a pure state. While the absolute error increases, the numerical result, based on a depolarizing model, suggests that our protocol reduces the error compared to the case without the protocol by a rescaling factor decreasing with the qubit number and circuit depth; i.e., the relative performance of purification is better for larger circuits. On a cloud quantum computer, we successfully demonstrate the reduced error with a quantum variational eigensolver circuit.