Scalable protocol to coherence estimation from scarce data: Theory and experiment

• URL: http://arxiv.org/abs/2510.21138v1
• Date: Fri, 24 Oct 2025 04:06:57 GMT
• Title: Scalable protocol to coherence estimation from scarce data: Theory and experiment
• Authors: Qi-Ming Ding, Ting Zhang, Hui Li, Da-Jian Zhang,
• Abstract summary: Coherence is the fundamental resources enabling quantum advantages.<n>We propose a scalable protocol for estimating coherence from scarce data.<n>This work opens a novel route toward estimating coherence of large-scale quantum systems under data-scarce conditions.
• Score: 4.035237100024747
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Key quantum features like coherence are the fundamental resources enabling quantum advantages and ascertaining their presence in quantum systems is crucial for developing quantum technologies. This task, however, faces severe challenges in the noisy intermediate-scale quantum era. On one hand, experimental data are typically scarce, rendering full state reconstruction infeasible. On the other hand, these features are usually quantified by highly nonlinear functionals that elude efficient estimations via existing methods. In this work, we propose a scalable protocol for estimating coherence from scarce data and further experimentally demonstrate its practical utility. The key innovation here is to relax the potentially NP-hard coherence estimation problem into a computationally efficient optimization. This renders the computational cost in our protocol insensitive to the system size, in sharp contrast to the exponential growth in traditional methods. This work opens a novel route toward estimating coherence of large-scale quantum systems under data-scarce conditions.

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)
• Feedback-driven recurrent quantum neural network universality [6.206127662604578]
  We present a recurrent quantum neural network architecture that extends a class of existing feedforward models to a dynamic, feedback-driven reservoir setting.<n>We provide theoretical guarantees for variational recurrent quantum neural networks, including approximation bounds and universality results.
  arXiv  Detail & Related papers  (2025-06-19T14:07:38Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• 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)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• Retrieving non-linear features from noisy quantum states [11.289924445850328]
  In this paper, we analyze the feasibility and efficiency of extracting high-order moments from noisy states. We first show that there exists a quantum protocol capable of accomplishing this task if and only if the underlying noise channel is invertible. Our work contributes to a deeper understanding of how quantum noise could affect high-order information extraction and provides guidance on how to tackle it.
  arXiv  Detail & Related papers  (2023-09-20T15:28:18Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Bounds on an effective thermalization beyond the Zeno limit [0.0]
  The quantum Zeno effect has emerged as a widely utilized technique to safeguard classical information stored in quantum systems. We derive effective Zeno dynamics for any time interval between operations. These findings enhance our understanding of the practical applicability of the quantum Zeno effect in preserving classical information stored in quantum systems.
  arXiv  Detail & Related papers  (2023-04-12T13:18:11Z)
• Deep reinforcement learning for quantum multiparameter estimation [0.0]
  We introduce a model-free and deep learning-based approach to implement realistic Bayesian quantum metrology tasks. We prove experimentally the achievement of higher estimation performances than standard methods.
  arXiv  Detail & Related papers  (2022-09-01T18:01:56Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Dispersive qubit readout with machine learning [0.08399688944263842]
  Open quantum systems can undergo dissipative phase transitions, and their critical behavior can be exploited in sensing applications. A recently introduced measurement protocol uses the parametric (two-photon driven) Kerr resonator's driven-dissipative phase transition to reach single-qubit detection fidelity of 99.9%. We use machine learning-based classification algorithms to extract information from this critical dynamics.
  arXiv  Detail & Related papers  (2021-12-10T04:25:43Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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.