Tensor network characterization and mitigation of readout errors
- URL: http://arxiv.org/abs/2606.25974v1
- Date: Wed, 24 Jun 2026 15:45:47 GMT
- Title: Tensor network characterization and mitigation of readout errors
- Abstract summary: Readout errors are a major bottleneck to extracting reliable information from near-term quantum processors.<n>We present a unified tensor-network framework that models the readout process as a matrix product operator (MPO)<n>Experiments on a superconducting processor and numerical simulations up to 20 qubits show that the MPO model captures correlated readout errors that uncorrelated models miss.
- Score: 16.364682124857485
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Readout errors are a major bottleneck to extracting reliable information from near-term quantum processors, especially when spatial correlations are non-negligible. We present a unified tensor-network framework that models the readout process as a matrix product operator (MPO), enabling efficient characterization and mitigation beyond uncorrelated approximations. The MPO model is trained via likelihood optimization on calibration data and applies to multiple tasks, including nonlocal observable estimation, random circuit sampling, and random-measurement protocols, such as classical shadows and learning-based tomography. Experiments on a superconducting processor and numerical simulations up to 20 qubits show that the MPO model captures correlated readout errors that uncorrelated models miss, with a sample cost that grows only near-linearly with system size. When extended to two-dimensional systems, the framework can also be integrated with tensor-network quantum error-correction decoders by performing joint inference over data and readout errors. These results establish tensor-network readout error mitigation as a scalable and versatile approach for noise-aware quantum data processing.
Related papers
- PAC-Bayesian Bounds for Learning Partially Observed Stochastic Linear Time-Invariant State-Space Systems with Inputs and Sub-Gaussian Noise [1.551190544492585]
We derive a PAC-Bayesian error bound for partially observed linear time-invariant (LTI) dynamical systems in state-space form with inputs and sub-Gaussian noise.<n>Such bounds are widespread in machine learning, and they are useful for characterizing the predictive power of models learned from finitely many data points.
arXiv Detail & Related papers (2026-09-08T13:32:20Z) - Limitations of Error Model Approximations in Quantum Network Simulation [0.13999481573773073]
We show how simple error models, such as Pauli twirling or reset channels, can lead to severe discrepancies in protocol performance predictions.<n>Results show that rigorous validation of complete noise architectures is indispensable for accurately predicting operational thresholds in future quantum technologies.
arXiv Detail & Related papers (2026-07-01T14:35:26Z) - Scalable linearized gate set tomography [1.954453462818087]
Linearized gate set tomography relies on sparse error models, a linear approximation to enable efficient data fitting, and data from shallow circuits.<n>We demonstrate the accuracy of our technique using simulations of a tenqubit system with coherent errors including coherent crosstalk.
arXiv Detail & Related papers (2026-05-11T19:06:10Z) - Large-scale Lindblad learning from time-series data [0.1749935196721634]
We develop a protocol for learning a time-independent Lindblad model for operations that can be applied repeatedly on a quantum computer.<n>We demonstrate the approach by learning the Lindbladian for a full layer of gates on a 156-qubit superconducting quantum processor.
arXiv Detail & Related papers (2025-12-09T01:50:14Z) - Mitigation of correlated readout errors without randomized measurements [0.0]
We present a readout error-mitigation protocol that uses only single-qubit Pauli measurements.<n>The proposed approach captures a very broad class of correlated noise models.<n>It is based on a complete and efficient characterization of few-qubit correlated positive operator-valued measures.
arXiv Detail & Related papers (2025-03-31T16:21:45Z) - Error-quantified Conformal Inference for Time Series [55.11926160774831]
Uncertainty quantification in time series prediction is challenging due to the temporal dependence and distribution shift on sequential data.<n>We propose itError-quantified Conformal Inference (ECI) by smoothing the quantile loss function.<n>ECI can achieve valid miscoverage control and output tighter prediction sets than other baselines.
arXiv Detail & Related papers (2025-02-02T15:02:36Z) - QGait: Toward Accurate Quantization for Gait Recognition with Binarized Input [17.017127559393398]
We propose a differentiable soft quantizer, which better simulates the gradient of the round function during backpropagation.
This enables the network to learn from subtle input perturbations.
We further refine the training strategy to ensure convergence while simulating quantization errors.
arXiv Detail & Related papers (2024-05-22T17:34:18Z) - Graph Spatiotemporal Process for Multivariate Time Series Anomaly
Detection with Missing Values [67.76168547245237]
We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies.
Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
arXiv Detail & Related papers (2024-01-11T10:10:16Z) - Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation [63.180725016463974]
Cross-modal retrieval relies on well-matched large-scale datasets that are laborious in practice.
We introduce a novel noisy correspondence learning framework, namely textbfSelf-textbfReinforcing textbfErrors textbfMitigation (SREM)
arXiv Detail & Related papers (2023-12-27T09:03:43Z) - Correlation-aware Spatial-Temporal Graph Learning for Multivariate
Time-series Anomaly Detection [67.60791405198063]
We propose a correlation-aware spatial-temporal graph learning (termed CST-GL) for time series anomaly detection.
CST-GL explicitly captures the pairwise correlations via a multivariate time series correlation learning module.
A novel anomaly scoring component is further integrated into CST-GL to estimate the degree of an anomaly in a purely unsupervised manner.
arXiv Detail & Related papers (2023-07-17T11:04:27Z) - Witnessing entanglement in trapped-ion quantum error correction under
realistic noise [41.94295877935867]
Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits.
We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms.
We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
arXiv Detail & Related papers (2022-12-14T20:00:36Z) - ClusterQ: Semantic Feature Distribution Alignment for Data-Free
Quantization [111.12063632743013]
We propose a new and effective data-free quantization method termed ClusterQ.
To obtain high inter-class separability of semantic features, we cluster and align the feature distribution statistics.
We also incorporate the intra-class variance to solve class-wise mode collapse.
arXiv Detail & Related papers (2022-04-30T06:58:56Z) - SignalNet: A Low Resolution Sinusoid Decomposition and Estimation
Network [79.04274563889548]
We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples.
We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions.
In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
arXiv Detail & Related papers (2021-06-10T04:21:20Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.