Machine Learning Framework for Efficient Prediction of Quantum Wasserstein Distance

• URL: http://arxiv.org/abs/2511.12443v1
• Date: Sun, 16 Nov 2025 04:07:13 GMT
• Title: Machine Learning Framework for Efficient Prediction of Quantum Wasserstein Distance
• Authors: Changchun Feng, Xinyu Qiu, Laifa Tao, Lin Chen,
• Abstract summary: We present a machine learning framework that efficiently predicts the quantum W-distance.<n>Our approach employs both classical neural networks and traditional machine learning models.<n>The results establish machine learning as a viable and scalable alternative to traditional numerical methods for W-distance computation.
• Score: 4.181752542660445
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The quantum Wasserstein distance (W-distance) is a fundamental metric for quantifying the distinguishability of quantum operations, with critical applications in quantum error correction. However, computing the W-distance remains computationally challenging for multiqubit systems due to exponential scaling. We present a machine learning framework that efficiently predicts the quantum W-distance by extracting physically meaningful features from quantum state pairs, including Pauli measurements, statistical moments, quantum fidelity, and entanglement measures. Our approach employs both classical neural networks and traditional machine learning models. On three-qubit systems, the best-performing Random Forest model achieves near-perfect accuracy ($R^2 = 0.9999$) with mean absolute errors on the order of $10^{-5}$. We further validate the framework's practical utility by successfully verifying two fundamental theoretical propositions in quantum information theory: the bound on measurement probability differences between unitary operations and the $W_1$ gate error rate bound. The results establish machine learning as a viable and scalable alternative to traditional numerical methods for W-distance computation, with particular promise for real-time quantum circuit assessment and error correction protocol design in NISQ devices.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Reinforcement Learning Control of Quantum Error Correction [108.70420561323692]
  Quantum computer learns to self-improve directly from its errors and never stops computing.<n>This work enables a new paradigm: a quantum computer that learns to self-improve directly from its errors and never stops computing.
  arXiv  Detail & Related papers  (2025-11-11T17:32:25Z)
• Asymptotic Error Bounds and Fractional-Bit Design for Fixed-Point Grover's Quantum Algorithm Emulation [2.812395851874055]
  We analyze truncation error propagation in fixed-point QC emulation, focusing on Grover's quantum search algorithm.<n>We quantify the overall error by scaling as $ell$ distance between ideal and emulated probability distributions.<n>We provide a closed-form formula to determine the minimal fractional-bit precision required to achieve a specified error threshold.
  arXiv  Detail & Related papers  (2025-04-02T07:33:36Z)
• An Accurate and Efficient Analytic Model of Fidelity Under Depolarizing Noise Oriented to Large Scale Quantum System Design [1.80755313284025]
  We present a comprehensive theoretical framework to predict the fidelity of quantum circuits under depolarizing noise.<n>We propose an efficient fidelity estimation algorithm based on device calibration data.<n>The proposed approach provides a scalable and practical tool for benchmarking quantum hardware.
  arXiv  Detail & Related papers  (2025-03-09T16:59:24Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Hardware-efficient variational quantum algorithm in trapped-ion quantum computer [0.0]
  We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the dependence on resource-intensive two-qubit gates in conventional gate-based methods.
  arXiv  Detail & Related papers  (2024-07-03T14:02:20Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Error estimation in current noisy quantum computers [0.0]
  We analyze the main sources of errors in current (IBM) quantum computers. We present a useful tool (TED-qc) designed to facilitate the total error probability expected for any quantum circuit.
  arXiv  Detail & Related papers  (2023-02-14T07:19:06Z)
• Entanglement Forging with generative neural network models [0.0]
  We show that a hybrid quantum-classical variational ans"atze can forge entanglement to lower quantum resource overhead. The method is efficient in terms of the number of measurements required to achieve fixed precision on expected values of observables.
  arXiv  Detail & Related papers  (2022-05-02T14:29:17Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)

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.