Limitations of probabilistic error cancellation for open dynamics beyond sampling overhead

Quantum error control and mitigation techniques help improve how quantum computers handle errors, making algorithms run more efficiently despite noisy hardware. These strategies work at the software level and are built into programs before they run on quantum machines. Unlike quantum error correction, which actively detects and fixes errors during computation, error mitigation does not use real-time corrections but instead reduces the impact of errors after computations. Error mitigation can also help reduce the extra resources needed for full error correction. This chapter explains how these techniques relate to each other, provides an overview of key error mitigation methods and their limitations, and highlights leading academic and technological players in this field. It also covers current trends, such as integrating error-aware programming, benchmarking performance, and ensuring access to quantum hardware for testing. To advance quantum computing, it is recommended that research ecosystems support specialized centers and contribute to key strategic areas in the field.

Digital quantum simulators provide a diversified tool for solving the evolution of quantum systems with complicated Hamiltonians and hold great potential for a wide range of applications. Although much attention is paid to the unitary evolution of closed quantum systems, dissipation and noise are vital in understanding the dynamics of practical quantum systems. In this work, we experimentally demonstrate a digital simulation of an open quantum system in a controllable Markovian environment with the assistance of a single ancillary qubit. By Trotterizing the quantum Liouvillians, the continuous evolution of an open quantum system is effectively realized, and its application in error mitigation is demonstrated by adjusting the simulated noise intensities. High-order Trotter for open quantum dynamics is also experimentally investigated and shows higher accuracy. Our results represent a significant step toward hardware-efficient simulation of open quantum systems and error mitigation in quantum algorithms in noisy intermediate-scale quantum systems.

The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 − 5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.

We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to detect a component of the error operator and represents one layer of the technique. We build on the results on extended flag gadgets and put it on a firm theoretical foundation. We prove that this technique can recover the noiseless state under the assumption of noise not affecting the checks. The method does not incur any encoding overhead and instead chooses the checks based on the input circuit. We provide an algorithm for obtaining such checks for an arbitrary target circuit. Since the method applies to any circuit and input state, it can be easily combined with other error mitigation techniques. We evaluate the performance of the proposed methods using extensive numerical simulations on 1850 random input circuits composed of Clifford gates and non-Clifford single-qubit rotations, a class of circuits encompassing most commonly considered variational algorithm circuits. We observe average improvements in fidelity of 34 percentage points with six layers of checks.

Quantum simulation is a powerful tool to study the properties of quantum systems. The dynamics of open quantum systems are often described by completely positive (CP) maps, for which several quantum simulation schemes exist. Such maps, however, represent only a subset of a larger class of maps: the general dynamical maps which are linear, Hermitian preserving, and trace preserving but not necessarily positivity preserving. Here we present a simulation scheme for these general dynamical maps, which occur when the underlying system-reservoir model undergoes entangling (and thus non-Markovian) dynamics. Such maps also arise as the inverse of CP maps, which are commonly used in error mitigation. We illustrate our simulation scheme on an IBM quantum processor, demonstrating its ability to recover the initial state of a Lindblad evolution. This paves the way for a novel form of quantum error mitigation. Our scheme only requires one ancilla qubit as an overhead and a small number of one and two qubit gates. Consequently, we expect it to be of practical use in near-term quantum devices.

Simulating quantum systems using classical computers encounters inherent challenges due to the exponential scaling with system size. To overcome this challenge, quantum simulation uses a well-controlled quantum system to simulate another less controllable system. Over the last 20 years, many physical platforms have emerged as quantum simulators, such as ultracold atoms, Rydberg atom arrays, trapped ions, nuclear spin, superconducting circuits, and integrated photonics. Trapped ions, with induced spin interactions and universal quantum gates, have demonstrated remarkable versatility, capable of both analog and digital quantum simulation. Recent experimental results, covering a range of research areas including condensed matter physics, quantum thermodynamics, high-energy physics, and quantum chemistry, guide this introductory review to the growing field of quantum simulation.

The variational quantum eigensolver is a promising way to solve the Schrödinger equation on a noisy intermediate-scale quantum (NISQ) computer, while its success relies on a well-designed wave function ansatz. Inspired by the quantum neural network, we propose a new hardware heuristic ansatz where its expressibility can be improved by increasing either the depth or the width of the circuit. Such a character makes this ansatz adaptable to different hardware environments. More importantly, it provides a general framework to improve the efficiency of the quantum resource utilization. For example, on a superconducting quantum computer where circuit depth is usually the bottleneck and the qubits thus cannot be fully used, circuit depth can be significantly reduced by introducing ancilla qubits. Ancilla qubits also make the circuit less sensitive to noises in practical application. These results open a new avenue to develop practical applications of quantum computation in the NISQ era.

The real-time simulation of large many-body quantum systems is a formidable task, that may only be achievable with a genuine quantum computational platform. Currently, quantum hardware with a number of qubits sufficient to make classical emulation challenging is available. This condition is necessary for the pursuit of a so-called quantum advantage, but it also makes verifying the results very difficult. In this paper, we flip the perspective and utilize known theoretical results about many-body quantum critical dynamics to qualitatively benchmark digital quantum hardware and various error mitigation techniques. In particular, we benchmark against known universal scaling laws in the Hamiltonian simulation of a time-dependent transverse-field Ising Hamiltonian of up to 133 qubits. Incorporating only basic error mitigation and suppression methods, our study shows reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates, before noise becomes prevalent. These results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning. We demonstrate this on the example of digitized quantum annealing for optimization and identify an optimal working point in terms of both circuit depth and time step on a 133-site optimization problem. Published by the American Physical Society 2024

A quantum chemistry study of the first singlet (S1) and triplet (T1) excited states of phenylsulfonyl-carbazole compounds, proposed as useful thermally activated delayed fluorescence (TADF) emitters for organic light emitting diode (OLED) applications, was performed with the quantum Equation-Of-Motion Variational Quantum Eigensolver (qEOM-VQE) and Variational Quantum Deflation (VQD) algorithms on quantum simulators and devices. These quantum simulations were performed with double zeta quality basis sets on an active space comprising the highest occupied and lowest unoccupied molecular orbitals (HOMO, LUMO) of the TADF molecules. The differences in energy separations between S1 and T1 (ΔEST) predicted by calculations on quantum simulators were found to be in excellent agreement with experimental data. Differences of 17 and 88 mHa with respect to exact energies were found for excited states by using the qEOM-VQE and VQD algorithms, respectively, to perform simulations on quantum devices without error mitigation. By utilizing state tomography to purify the quantum states and correct energy values, the large errors found for unmitigated results could be improved to differences of, at most, 4 mHa with respect to exact values. Consequently, excellent agreement could be found between values of ΔEST predicted by quantum simulations and those found in experiments.

Quantum Random Access Memory (QRAM) plays a pivotal role in accelerating quantum algorithms, especially in quantum machine learning. However, its implementation on noisy intermediate-scale quantum (NISQ) computers faces major challenges due to high qubit requirements and large circuit depth. These factors amplify quantum noise, limiting QRAM performance and scalability. In this work, we introduce a gate-pruning strategy that mitigates noise while preserving QRAM functionality. Our approach reduces circuit depth by eliminating small-angle rotation gates which are particularly noise-sensitive on NISQ hardware. This pruning significantly improves QRAM resilience without compromising data-loading efficiency or superposition-based querying. We further show that the pruned QRAM supports a variational quantum classifier capable of parallel training with logarithmic qubit scaling. Experiments on benchmark datasets confirm that our approach enhances noise resilience and classification accuracy, underscoring its potential for practical quantum machine learning in the NISQ era.

Adaptive variational quantum algorithms arguably offer the best prospects for quantum advantage in the Noisy Intermediate-Scale Quantum era. Since the inception of the first such algorithm, the Adaptive Derivative-Assembled Problem-Tailored Variational Quantum Eigensolver (ADAPT-VQE), many improvements have appeared in the literature. We combine the key improvements along with a novel operator pool—which we term Coupled Exchange Operator (CEO) pool—to assess the cost of running state-of-the-art ADAPT-VQE on hardware in terms of measurement counts and circuit depth. We show a dramatic reduction of these quantum computational resources compared to the early versions of the algorithm: CNOT count, CNOT depth and measurement costs are reduced by up to 88%, 96% and 99.6%, respectively, for molecules represented by 12 to 14 qubits (LiH, H6 and BeH2). We also find that our state-of-the-art CEO-ADAPT-VQE outperforms the Unitary Coupled Cluster Singles and Doubles ansatz, the most widely used static VQE ansatz, in all relevant metrics, and offers a five order of magnitude decrease in measurement costs as compared to other static ansätze with competitive CNOT counts.

The Nambu–Jona-Lasinio (NJL) model has been widely studied for investigating the chiral phase structure of strongly interacting matter. The study of the thermodynamics of field theories within the framework of Lattice Field Theory is limited by the sign problem, which prevents Monte Carlo evaluation of the functional integral at a finite chemical potential. Using the quantum imaginary time evolution (QITE) algorithm, we construct a quantum simulation for the (1 + 1) dimensional NJL model at finite temperature and finite chemical potential. We observe consistency among digital quantum simulation, exact diagonalization and analytical solution, indicating further applications of quantum computing in simulating QCD thermodynamics.

We numerically analyze the feasibility of a platform-neutral, general strategy to perform quantum simulations of fermionic lattice field theories under open boundary conditions. The digital quantum simulator requires solely one- and two-qubit gates and is scalable since integrating each Hamiltonian term requires a finite (non-scaling) cost. The exact local fermion encoding we adopt relies on auxiliary Z2 lattice gauge fields by adding a pure gauge Hamiltonian term akin to the Toric Code. By numerically emulating the quantum simulator real-time dynamics, we observe a timescale separation for spin- and charge-excitations in a spin-12 Hubbard ladder in the t−J model limit.

Quantum error mitigation is regarded as a possible path to near-term quantum utility. The methods under the quantum error mitigation umbrella term, such as probabilistic error cancellation (PEC), zero-noise extrapolation (ZNE) or Clifford data regression (CDR) are able to significantly reduce the error for the estimation of expectation values, although at an exponentially scaling cost, i.e., in the sampling overhead. In this work, we present a method to reduce the sampling overhead of PEC through Pauli error propagation combined with classical preprocessing. Our findings indicate that this method significantly reduces sampling overheads for Clifford circuits, leveraging the well-defined interaction between the Clifford group and Pauli noise. Additionally, we show that the method is applicable to non-Clifford circuits, though with more limited effectiveness, primarily constrained by the number of non-Clifford gates present in the circuit. We further provide examples of Clifford sub-circuits commonly encountered in relevant calculations, such as resource state generation in measurement-based quantum computing.

A number of quantum algorithms have been performed on small quantum computers; these include Shor's prime factorization algorithm, error correction, Grover's search algorithm and a number of analog and digital quantum simulations. Because of the number of gates and qubits necessary, however, digital quantum particle simulations remain untested. A contributing factor to the system size required is the number of ancillary qubits needed to implement matrix exponentials of the potential operator. Here, we show that a set of tunneling problems may be investigated with no ancillary qubits and a cost of one single-qubit operator per time step for the potential evolution, eliminating at least half of the quantum gates required for the algorithm and more than that in the general case. Such simulations are within reach of current quantum computer architectures.