Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)

QuFEM: Fast and Accurate Quantum Readout Calibration Using the Finite Element Method

Siwei Tan, Liqiang Lu, Hanyu Zhang, Jia Yan Yu, Congliang Lang, Yongheng Shang, Xinkui Zhao, Mingshuai Chen, Yun Eric Liang, Jianwei Yin

Published Apr 22, 2024• 5 citations
Publisher

Abstract

Quantum readout noise turns out to be the most significant source of error, which greatly affects the measurement fidelity. Matrix-based calibration has been demonstrated to be effective in various quantum platforms. However, existing methodologies are fundamentally limited in either scalability or accuracy. Inspired by the classical finite element method (FEM), a formal method to model the complex interaction between elements, we present our calibration framework named QuFEM. First, we apply a divide-and-conquer strategy that formulates the calibration as a series of tensor products with noise matrices. This matrices are iteratively characterized together with the calibrated probability distribution, aiming to capture the inherent locality of qubit interactions. Then, to accelerate the end-to-end calibration, we propose a sparse tensor-product engine to exploit the sparsity in the intermediate values. Our experiments show that QuFEM achieves 2.5×103× speedup in the 136-qubit calibration compared to the state-of-the-art matrix-based calibration technique [50], and provides 1.2× and 1.4× fidelity improvement on the 18-qubit and 36-qubit real-world quantum devices.

DOI
10.1145/3620665.3640380

Related papers

Efficient quantum readout-error mitigation for sparse measurement outcomes of near-term quantum devices

Bo Yang, Rudy Raymond, Shumpei Uno

The readout error on near-term quantum devices is one of the dominant noise factors, which can be mitigated by classical postprocessing called quantum readout error mitigation (QREM). The standard QREM applies the inverse of noise calibration matrix to the outcome probability distribution using exponential computational resources to the number of measured qubits. This becomes infeasible for the current quantum devices with tens of qubits or more. Here we propose two efficient QREM methods finishing in $O(n{s}^{2})$ time for probability distributions of $n$ qubits and $s$ shots, which mainly aim at mitigating sparse probability distributions such that only a few states are dominant. We compare the proposed methods with several recent QREM methods in the following three cases: expectation values of the GHZ state, its fidelities, and the estimation error of maximum likelihood amplitude estimation (MLAE) algorithm with a modified Grover iterator. The two cases of the GHZ state are on real IBM quantum devices, while the third is with numerical simulation. Using the proposed method, the mitigation of the 65-qubit GHZ state takes only a few seconds, and we witness the fidelity of the 29-qubit GHZ state exceeding 0.5. The proposed methods also succeed in reducing the estimation error in the MLAE algorithm, outperforming the results by other QREM methods in general.

arXiv:2201.11046•Physical Review A•Jul 18, 2022•45 citations

SpREM: Exploiting Hamming Sparsity for Fast Quantum Readout Error Mitigation

Hanyu Zhang, Liqiang Lu, Siwei Tan +3 more

The current Noisy Intermediate-Scale Quantum (NISQ) era suffers from high quantum readout error that severely reduces the measurement fidelity. Matrix-based error mitigation has been demonstrated as a promising software-level technique, which performs matrix-vector multiplication to calibrate the probability distribution with noise. However, this approach shows poor scalability and limited fidelity improvement as the matrix size exponentially increases with the number of qubits. In this paper, we propose SpREM to exploit the inherent sparsity in the mitigation matrix. Inspired by the interaction mechanism between qubits, we identify structured sparsity patterns using Hamming distance. With this insight, we propose the Hamming-Distance Sparse Row (HDSR) compression method and its format, which can achieve higher sparsity than threshold-based pruning meanwhile exhibiting great fidelity improvement. Finally, we propose the computational dataflow of the HDSR format and implement it on hardware. Experiments demonstrate that SpREM achieves 98.9% sparsity and a 27.3× reduction in fidelity loss on the real-world quantum device, compared to threshold-based pruning. It achieves an average 11.2× ~ 36.4× speedup compared to Xilinx Vitis SPARSE library and NVIDIA A100 GPU implementations.

ACM/IEEE Design Automation Conference (DAC)•Jun 23, 2024•4 citations

Recent Advances in Quantum Computing Method Based on FEM for Microwave Components

Xiaolong Li, Feng Feng, Jingyi Feng +1 more

This paper reviews two recent advances in applying quantum computing to solve finite element method (FEM) equations for microwave components. Existing quantum algorithms, such as the Harrow-Hassidim-Lloyd (HHL) algorithm, offer exponential speedup for linear systems but face significant challenges in electromagnetic (EM) simulations. These challenges include the high cost of quantum state preparation, ill-conditioned system matrices, and the inability to directly extract scattering parameters (S-parameters) due to the loss of phase information in quantum measurements. In this paper, two novel approaches are introduced to address these issues. The first approach is an efficient quantum state preparation and preconditioning framework. A systematic method has been developed for preparing quantum states that represent the right-hand side (RHS) vectors in finite element equations for EM problems. This method reduces the gate count by exploiting the sparsity of excitation vectors and improves matrix conditions using sparse approximate inverse (SPAI). The second approach is a quantum method for calculating multiport S-parameter magnitudes, which utilizes an integrated quantum circuit and a specific matrix-scaling technique to compute S-parameters without explicit phase information. Both approaches are validated through application examples, demonstrating the potential of quantum computing for solving complex EM problems.

IEEE International Conference on Radio Frequency and Antenna Technologies (RFAT)•May 1, 2026•0 citations

SiTA: Exploiting Sparsity in Tensor-Product for Accelerating Quantum Readout Error Mitigation

Hanyu Zhang, Zhiwei Ye, Liqiang Lu +6 more

Though quantum computing theoretically provides exponential computational advantage, an end-to-end quantum speedup should consider the encoding, compilation, and many other peripheral process that rely on classical computer. Among them, the readout error mitigation turns out to be the bottleneck, requiring mitigation of noise errors to achieve high fidelity. To this end, leveraging the sparsity in the tensor-product has emerged as an appealing approach to improve computational efficiency. However, existing approaches, based on intermediate data pruning or threshold pruning, suffer from the limited accelerator and fidelity loss. In this paper, we propose SiTA, a quantum error mitigation accelerator that exploits the inherent sparsity of Hilbert space. The key insight is that the superposition states generated by quantum algorithms cover only a subset of the Hilbert space (output sparsity), and the basis state naturally exhibits bit-level sparsity (input sparsity). Therefore, we introduce a sparse dataflow that features probability-level and state-level parallelism, which effectively skips calculations related to zero values. Finally, we design its hardware architecture that supports various computational paradigms of tensor-product, enabling acceleration for readout error mitigation. Experiments show that SiTA achieves an end-to-end speedup of 4.9× to 1604× over prior mitigation methods, without sacrificing fidelity.

ACM/IEEE Design Automation Conference (DAC)•Jul 26, 2026•0 citations

Quantum finite element algorithm for solving Euler–Bernoulli and heat transfer PDEs with Dirichlet, Neumann, and Robin boundary conditions

Dingjie Lu, Zhao Wang, Jun Liu +3 more

Abstract This paper introduces a quantum-enhanced finite element method (FEM) designed for noisy intermediate-scale quantum (NISQ) devices, leveraging variational quantum algorithms (VQAs) to solve engineering partial differential equations. We demonstrate the framework by solving the Euler–Bernoulli beam and the NAFEMS T4 heat transfer problems, which involve Dirichlet, Neumann, and Robin boundary conditions. A key innovation is a ‘set-to-zero’ strategy that incorporates boundary conditions through a correction matrix, K bc , allowing for flexible imposition at any node without domain decomposition. The global stiffness matrix is decomposed into a constant number of Pauli terms, O (1), using the method by Sato et al while boundary terms are handled with a sublinearly scaling partial Pauli measurement technique. The algorithm achieves logarithmic qubit scaling ( n = ⌈ log 2 ⁡ N ⌉ qubits for N degrees of freedom(DOF)) and employs shallow, hardware-efficient circuits with empirically trainable depth for small-scale systems. Validation on the Qiskit statevector simulator shows high accuracy. For the Euler–Bernoulli beam problem with 4 to 64 DOF, the algorithm achieves relative errors of 0.5%–1.5% and fidelities of 0.998–0.999. For the NAFEMS T4 heat transfer benchmark, a 5.4% relative error is observed. The VQA converges robustly within 77–350 iterations, though barren plateaus are a known challenge for scaling to larger systems. This work establishes a scalable framework for quantum FEM, offering a significant memory advantage over classical methods and advancing the potential for quantum-enhanced engineering simulations.

Quantum Science and Technology•Jan 16, 2026•1 citation

A Quantum Algorithm for the Finite Element Method

Ahmad M. Alkadri, Tyler Kharazi, K. Birgitta Whaley +1 more

The finite element method (FEM) is a cornerstone numerical technique for solving partial differential equations (PDEs). Here, we present $\textbf{Qu-FEM}$, a fault-tolerant era quantum algorithm for the finite element method. In contrast to other quantum PDE solvers, Qu-FEM preserves the geometric flexibility of FEM by introducing two new primitives, the unit of interaction and the local-to-global indicator matrix, which enable the assembly of global finite element arrays with a constant-size linear combination of unitaries. We study the modified Poisson equation as an elliptic problem of interest, and provide explicit circuits for Qu-FEM in Cartesian domains. For problems with constant coefficients, our algorithm admits block-encodings of global arrays that require only $\tilde{\mathcal{O}}\left(d^2 p^2 n\right)$ Clifford+$T$ gates for $d$-dimensional, order-$p$ tensor product elements on grids with $2^n$ degrees of freedom in each dimension, where $n$ is the number of qubits representing the $N=2^n$ discrete grid points. For problems with spatially varying coefficients, we perform numerical integration directly on the quantum computer to assemble global arrays and force vectors. Dirichlet boundary conditions are enforced via the method of Lagrange multipliers, eliminating the need to modify the block-encodings that emerge from the assembly procedure. This work presents a framework for extending the geometric flexibility of quantum PDE solvers while preserving the possibility of a quantum advantage.

arXiv:2510.18150•Oct 20, 2025•9 citations
Quantum readout noise turns out to be the most significant source of error, which greatly affects the measurement fidelity. Matrix-based calibration has been demonstrated to be effective in various quantum platforms. However, existing methodologies are fundamentally limited in either scalability or accuracy. Inspired by the classical finite element method (FEM), a formal method to model the complex interaction between elements, we present our calibration framework named QuFEM. First, we apply a divide-and-conquer strategy that formulates the calibration as a series of tensor products with noise matrices. This matrices are iteratively characterized together with the calibrated probability distribution, aiming to capture the inherent locality of qubit interactions. Then, to accelerate the end-to-end calibration, we propose a sparse tensor-product engine to exploit the sparsity in the intermediate values. Our experiments show that QuFEM achieves 2.5×103× speedup in the 136-qubit calibration compared to the state-of-the-art matrix-based calibration technique [50], and provides 1.2× and 1.4× fidelity improvement on the 18-qubit and 36-qubit real-world quantum devices.
The readout error on near-term quantum devices is one of the dominant noise factors, which can be mitigated by classical postprocessing called quantum readout error mitigation (QREM). The standard QREM applies the inverse of noise calibration matrix to the outcome probability distribution using exponential computational resources to the number of measured qubits. This becomes infeasible for the current quantum devices with tens of qubits or more. Here we propose two efficient QREM methods finishing in O(ns2)O(n{s}^{2})O(ns2) time for probability distributions of nnn qubits and sss shots, which mainly aim at mitigating sparse probability distributions such that only a few states are dominant. We compare the proposed methods with several recent QREM methods in the following three cases: expectation values of the GHZ state, its fidelities, and the estimation error of maximum likelihood amplitude estimation (MLAE) algorithm with a modified Grover iterator. The two cases of the GHZ state are on real IBM quantum devices, while the third is with numerical simulation. Using the proposed method, the mitigation of the 65-qubit GHZ state takes only a few seconds, and we witness the fidelity of the 29-qubit GHZ state exceeding 0.5. The proposed methods also succeed in reducing the estimation error in the MLAE algorithm, outperforming the results by other QREM methods in general.
The current Noisy Intermediate-Scale Quantum (NISQ) era suffers from high quantum readout error that severely reduces the measurement fidelity. Matrix-based error mitigation has been demonstrated as a promising software-level technique, which performs matrix-vector multiplication to calibrate the probability distribution with noise. However, this approach shows poor scalability and limited fidelity improvement as the matrix size exponentially increases with the number of qubits. In this paper, we propose SpREM to exploit the inherent sparsity in the mitigation matrix. Inspired by the interaction mechanism between qubits, we identify structured sparsity patterns using Hamming distance. With this insight, we propose the Hamming-Distance Sparse Row (HDSR) compression method and its format, which can achieve higher sparsity than threshold-based pruning meanwhile exhibiting great fidelity improvement. Finally, we propose the computational dataflow of the HDSR format and implement it on hardware. Experiments demonstrate that SpREM achieves 98.9% sparsity and a 27.3× reduction in fidelity loss on the real-world quantum device, compared to threshold-based pruning. It achieves an average 11.2× ~ 36.4× speedup compared to Xilinx Vitis SPARSE library and NVIDIA A100 GPU implementations.
This paper reviews two recent advances in applying quantum computing to solve finite element method (FEM) equations for microwave components. Existing quantum algorithms, such as the Harrow-Hassidim-Lloyd (HHL) algorithm, offer exponential speedup for linear systems but face significant challenges in electromagnetic (EM) simulations. These challenges include the high cost of quantum state preparation, ill-conditioned system matrices, and the inability to directly extract scattering parameters (S-parameters) due to the loss of phase information in quantum measurements. In this paper, two novel approaches are introduced to address these issues. The first approach is an efficient quantum state preparation and preconditioning framework. A systematic method has been developed for preparing quantum states that represent the right-hand side (RHS) vectors in finite element equations for EM problems. This method reduces the gate count by exploiting the sparsity of excitation vectors and improves matrix conditions using sparse approximate inverse (SPAI). The second approach is a quantum method for calculating multiport S-parameter magnitudes, which utilizes an integrated quantum circuit and a specific matrix-scaling technique to compute S-parameters without explicit phase information. Both approaches are validated through application examples, demonstrating the potential of quantum computing for solving complex EM problems.
Though quantum computing theoretically provides exponential computational advantage, an end-to-end quantum speedup should consider the encoding, compilation, and many other peripheral process that rely on classical computer. Among them, the readout error mitigation turns out to be the bottleneck, requiring mitigation of noise errors to achieve high fidelity. To this end, leveraging the sparsity in the tensor-product has emerged as an appealing approach to improve computational efficiency. However, existing approaches, based on intermediate data pruning or threshold pruning, suffer from the limited accelerator and fidelity loss. In this paper, we propose SiTA, a quantum error mitigation accelerator that exploits the inherent sparsity of Hilbert space. The key insight is that the superposition states generated by quantum algorithms cover only a subset of the Hilbert space (output sparsity), and the basis state naturally exhibits bit-level sparsity (input sparsity). Therefore, we introduce a sparse dataflow that features probability-level and state-level parallelism, which effectively skips calculations related to zero values. Finally, we design its hardware architecture that supports various computational paradigms of tensor-product, enabling acceleration for readout error mitigation. Experiments show that SiTA achieves an end-to-end speedup of 4.9× to 1604× over prior mitigation methods, without sacrificing fidelity.
Abstract This paper introduces a quantum-enhanced finite element method (FEM) designed for noisy intermediate-scale quantum (NISQ) devices, leveraging variational quantum algorithms (VQAs) to solve engineering partial differential equations. We demonstrate the framework by solving the Euler–Bernoulli beam and the NAFEMS T4 heat transfer problems, which involve Dirichlet, Neumann, and Robin boundary conditions. A key innovation is a ‘set-to-zero’ strategy that incorporates boundary conditions through a correction matrix, K bc , allowing for flexible imposition at any node without domain decomposition. The global stiffness matrix is decomposed into a constant number of Pauli terms, O (1), using the method by Sato et al while boundary terms are handled with a sublinearly scaling partial Pauli measurement technique. The algorithm achieves logarithmic qubit scaling ( n = ⌈ log 2 ⁡ N ⌉ qubits for N degrees of freedom(DOF)) and employs shallow, hardware-efficient circuits with empirically trainable depth for small-scale systems. Validation on the Qiskit statevector simulator shows high accuracy. For the Euler–Bernoulli beam problem with 4 to 64 DOF, the algorithm achieves relative errors of 0.5%–1.5% and fidelities of 0.998–0.999. For the NAFEMS T4 heat transfer benchmark, a 5.4% relative error is observed. The VQA converges robustly within 77–350 iterations, though barren plateaus are a known challenge for scaling to larger systems. This work establishes a scalable framework for quantum FEM, offering a significant memory advantage over classical methods and advancing the potential for quantum-enhanced engineering simulations.
The finite element method (FEM) is a cornerstone numerical technique for solving partial differential equations (PDEs). Here, we present Qu-FEM\textbf{Qu-FEM}Qu-FEM, a fault-tolerant era quantum algorithm for the finite element method. In contrast to other quantum PDE solvers, Qu-FEM preserves the geometric flexibility of FEM by introducing two new primitives, the unit of interaction and the local-to-global indicator matrix, which enable the assembly of global finite element arrays with a constant-size linear combination of unitaries. We study the modified Poisson equation as an elliptic problem of interest, and provide explicit circuits for Qu-FEM in Cartesian domains. For problems with constant coefficients, our algorithm admits block-encodings of global arrays that require only O~(d2p2n)\tilde{\mathcal{O}}\left(d^2 p^2 n\right)O~(d2p2n) Clifford+TTT gates for ddd-dimensional, order-ppp tensor product elements on grids with 2n2^n2n degrees of freedom in each dimension, where nnn is the number of qubits representing the N=2nN=2^nN=2n discrete grid points. For problems with spatially varying coefficients, we perform numerical integration directly on the quantum computer to assemble global arrays and force vectors. Dirichlet boundary conditions are enforced via the method of Lagrange multipliers, eliminating the need to modify the block-encodings that emerge from the assembly procedure. This work presents a framework for extending the geometric flexibility of quantum PDE solvers while preserving the possibility of a quantum advantage.