Pith. sign in

REVIEW 19 cited by

Scalable tensor-network error mitigation for near-term quantum computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.11740 v2 pith:JQQBRHME submitted 2023-07-21 quant-ph

Scalable tensor-network error mitigation for near-term quantum computing

classification quant-ph
keywords noisecircuitserrorquantummitigationcompletecomputingdepth
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Until fault-tolerance becomes implementable at scale, quantum computing will heavily rely on noise mitigation techniques. While methods such as zero noise extrapolation with probabilistic error amplification (ZNE-PEA) and probabilistic error cancellation (PEC) have been successfully tested on hardware recently, their scalability to larger circuits may be limited. Here, we introduce the tensor-network error mitigation (TEM) algorithm, which acts in post-processing to correct the noise-induced errors in estimations of physical observables. The method consists of the construction of a tensor network representing the inverse of the global noise channel affecting the state of the quantum processor, and the consequent application of the map to informationally complete measurement outcomes obtained from the noisy state. TEM does therefore not require additional quantum operations other than the implementation of informationally complete POVMs, which can be achieved through randomised local measurements. The key advantage of TEM is that the measurement overhead is quadratically smaller than in PEC. We test TEM extensively in numerical simulations in different regimes. We find that TEM can be applied to circuits of twice the depth compared to what is achievable with PEC under realistic conditions with sparse Pauli-Lindblad noise, such as those in [E. van den Berg et al., Nat. Phys. (2023)]. By using Clifford circuits, we explore the capabilities of the method in wider and deeper circuits with lower noise levels. We find that in the case of 100 qubits and depth 100, both PEC and ZNE fail to produce accurate results by using $\sim 10^5$ shots, while TEM succeeds.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 19 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems

    quant-ph 2026-04 unverdicted novelty 8.0

    Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlin...

  2. Symmetries of Pauli Noise from Lindbladian Dynamics

    quant-ph 2026-07 unverdicted novelty 7.0

    Lindbladian perturbation theory reveals approximate symmetries on Pauli fidelities for Clifford gates, with only restricted off-diagonal dissipative errors breaking them at first order, enabling gauge fixing for SPAM ...

  3. Characterization of Unlearnable Noise with Mid-Circuit-Measurement-Based Cycle Benchmarking

    quant-ph 2026-06 unverdicted novelty 7.0

    Mid-circuit-measurement-based generalized cycle benchmarking resolves unlearnable Pauli fidelities in Clifford gates by reversing Pauli cycles and revealing a learnability condition.

  4. Characterization of Unlearnable Noise with Mid-Circuit-Measurement-Based Cycle Benchmarking

    quant-ph 2026-06 unverdicted novelty 7.0

    Mid-circuit measurements enable reversal of Pauli cycles in Clifford gates, making previously unidentifiable noise components learnable under a new generalized cycle benchmarking protocol.

  5. Pure and mixed Dicke state ansatz for equality and inequality constraints in variational quantum eigensolver

    quant-ph 2026-06 unverdicted novelty 7.0

    A mixed Dicke state ansatz is introduced that encodes Hamming weight equality and inequality constraints directly into the VQE circuit to preserve feasibility without penalty terms.

  6. Better Pauli Channel Learning with Maximum Likelihood Estimation

    quant-ph 2026-06 unverdicted novelty 6.0

    MLE for 1D-local sparse Pauli-Lindblad channels reduces to an efficient Bayesian network computation, yielding improved tomography.

  7. Efficient Quantum Error Mitigation for Unitary k-Designs

    quant-ph 2026-06 unverdicted novelty 6.0

    Circuit balancing estimates circuit-wide depolarization in unitary k-designs and Pauli twirling mitigates it to reduce average infidelity without two-qubit gate overhead.

  8. Combining non-parametric quantum states and MERA tensor networks for ground-state optimization

    quant-ph 2026-05 unverdicted novelty 6.0

    A hybrid method uses fixed quantum annealing states as boundary resources for classical MERA tensor networks to improve ground-state approximations without deeper quantum circuits.

  9. Syndrome aware mitigation of logical errors

    quant-ph 2025-12 conditional novelty 6.0

    Conditioning logical error mitigation on the measured error-correcting syndromes cuts sampling overhead exponentially and can make error correction useful above its standard pseudo-threshold.

  10. ExtraFerm: An Extended Matchgate Simulator

    quant-ph 2025-11 conditional novelty 6.0

    An open-source simulator computes Born-rule probabilities for matchgate-plus-controlled-phase chemistry circuits and uses them to improve sample-based quantum diagonalization.

  11. RandomMeas.jl: A Julia Package for Randomized Measurements in Quantum Devices

    quant-ph 2025-09 conditional novelty 6.0

    RandomMeas.jl is a modular Julia package implementing randomized measurement protocols and classical shadow estimators for quantum computing applications.

  12. Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz

    quant-ph 2025-08 unverdicted novelty 6.0

    VQE with Dicke state ansatz encodes diversification constraints for multiclass portfolio optimization and outperforms other optimizers when paired with CMA-ES on convergence and approximation metrics.

  13. Reliable high-accuracy error mitigation for utility-scale quantum circuits

    quant-ph 2025-08 conditional novelty 6.0

    QESEM is a characterization-based error mitigation technique that achieves unbiased estimates with substantially reduced runtime cost compared to probabilistic error cancellation while outperforming zero-noise extrapo...

  14. Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation

    quant-ph 2025-03 unverdicted novelty 6.0

    SNT merges SV and PEC for subspace-tailored error mitigation in Trotterized FHM simulations, mapping out optimal combinations by hardware quality and shot budget while quantifying when noisy devices could surpass clas...

  15. Systematic Experiment Tracking in Quantum Software: A Case Study of Reservoir Computing with Error Mitigation

    quant-ph 2026-07 conditional novelty 5.5

    MLflow-style experiment tracking, extended with quantum provenance, supports reproducible multi-stage quantum software pipelines, shown on error-mitigated quantum reservoir computing for chaotic time-series prediction.

  16. Classically Augmented Zero-Noise Extrapolation

    quant-ph 2026-07 conditional novelty 5.0

    Classically Augmented Zero-Noise Extrapolation replaces high-noise Richardson nodes with classically simulated estimates, yielding exponential sampling-variance reduction for linear node spacings at fixed cutoff.

  17. Computing noise-canceling observables via Pauli propagation

    quant-ph 2026-06 unverdicted novelty 5.0

    Hybrid framework combines Pauli propagation with noise-canceling channels to compute observables more accurately on quantum hardware with lower classical and quantum resource costs.

  18. The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute

    quant-ph 2025-08 unverdicted novelty 2.0

    A synthesis of expert insights from the ADAC Quantum Computing Working Group and member survey on the complementary roles of quantum and classical high-performance computing in future hybrid infrastructures.

  19. Exactly solvable many-body dynamics from space-time duality

    cond-mat.stat-mech 2025-05 unverdicted novelty 2.0

    Review summarizing how dual-unitary circuits provide exact solvability for quantum many-body dynamics through space-time duality.