Quantum hardware noise learning via differentiable Kraus representation on tensor networks

• URL: http://arxiv.org/abs/2604.20804v1
• Date: Wed, 22 Apr 2026 17:35:01 GMT
• Title: Quantum hardware noise learning via differentiable Kraus representation on tensor networks
• Abstract summary: We present a method for learning quantum hardware noise from a measurement distribution of a single device experiment.<n>Independent channels are attached to each native gate type, to each nearest-neighbor crosstalk interaction, and to state preparation and measurement.<n>On ibm_fez, training on a ripple-carry adder circuit reproduces the device output distribution, and the same learned parameters, applied without retraining, also track the device distribution of an unrelated multiplier circuit.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a method for learning quantum hardware noise from a measurement distribution of a single device experiment. Each noise channel is represented by automatically differentiable Kraus operators obtained from a Stinespring-based parameterization that is completely positive and trace preserving by construction, and circuits are simulated with a matrix product density operator forward model. Independent channels are attached to each native gate type, to each nearest-neighbor crosstalk interaction, and to state preparation and measurement, and all channels are optimized end-to-end against a distance between the simulated and observed measurement distributions. On ibm_fez, a Heron-generation superconducting processor, training on a ripple-carry adder circuit reproduces the device output distribution, and the same learned parameters, applied without retraining, also track the device distribution of an unrelated multiplier circuit, indicating that the method captures intrinsic device characteristics rather than overfitting to the training circuit. A systematic evaluation across a range of benchmark circuits confirms that this generalization is consistent. We further use the learned model to perform an offline feasibility assessment of the quantum approximate optimization algorithm with an error detection scheme, demonstrating the kind of noise-aware prediction the framework is designed to enable.

Related papers

• Hybrid Gaussian-exponential zero-noise extrapolation for periodic circuits [2.932287734903261]
  We introduce a hybrid Gaussian-exponential extrapolation scheme tailored for quantum circuits with periodic structure.<n>For moderate to large circuit depths, the hybrid model yields measurable reductions in bias relative to previous extrapolation variants.
  arXiv  Detail & Related papers  (2026-05-28T02:01:03Z)
• Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformer [65.38883376379812]
  We propose the Discrete Transformer, an architecture engineered to bridge the gap between continuous representations and discrete symbolic logic.<n> Empirically, the Discrete Transformer not only achieves performance comparable to RNN-based baselines but crucially extends interpretability to continuous variable domains.
  arXiv  Detail & Related papers  (2026-01-09T12:49:41Z)
• Design and Optimization of Adaptive Diversity Schemes in Quantum MIMO Channels [45.812053169933705]
  We study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver.<n>Results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions.<n>This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.
  arXiv  Detail & Related papers  (2025-11-19T15:58:10Z)
• Fast simulations of continuous-variable circuits using the coherent state decomposition [0.0]
  We present ttexttlcg_plus, an open-source Python library for the simulation of continuous-variable quantum circuits.<n>Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states.<n>We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer.
  arXiv  Detail & Related papers  (2025-08-08T09:44:58Z)
• Quantum Benchmarking via Random Dynamical Quantum Maps [3.5297361401370044]
  We present a benchmarking protocol for universal quantum computers. This protocol provides a holistic assessment of system-wide error rates. We implement the protocol on state-of-the-art transmon qubits provided by IBM Quantum.
  arXiv  Detail & Related papers  (2024-04-29T16:37:11Z)
• Learning to rank quantum circuits for hardware-optimized performance enhancement [0.0]
  We introduce and experimentally test a machine-learning-based method for ranking logically equivalent quantum circuits. We compare our method to two common approaches: random layout selection and a publicly available baseline called Mapomatic. Our best model leads to a $1.8times$ reduction in selection error when compared to the baseline approach and a $3.2times$ reduction when compared to random selection.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Characterizing the Reproducibility of Noisy Quantum Circuits [0.40611352512781856]
  We show that device characterization offers an analytic bound on the observed variability of a quantum circuit. We validate the method using an ensemble of single qubit test circuits executed on a superconducting transmon processor with well-characterized readout and gate error rates.
  arXiv  Detail & Related papers  (2022-04-01T05:23:50Z)
• Learning from Heterogeneous EEG Signals with Differentiable Channel Reordering [51.633889765162685]
  CHARM is a method for training a single neural network across inconsistent input channels. We perform experiments on four EEG classification datasets and demonstrate the efficacy of CHARM.
  arXiv  Detail & Related papers  (2020-10-21T12:32:34Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Decentralised Learning with Random Features and Distributed Gradient Descent [39.00450514924611]
  We investigate the generalisation performance of Distributed Gradient Descent with Implicit Regularisation and Random Features in a homogenous setting. We establish high probability bounds on the predictive performance for each agent as a function of the step size, number of iterations, inverse spectral gap of the communication matrix and number of Random Features. We present simulations that show how the number of Random Features, iterations and samples impact predictive performance.
  arXiv  Detail & Related papers  (2020-07-01T09:55:09Z)

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.