Exponential speedup in measurement property learning with post-measurement states

• URL: http://arxiv.org/abs/2602.22126v1
• Date: Wed, 25 Feb 2026 17:15:24 GMT
• Title: Exponential speedup in measurement property learning with post-measurement states
• Authors: Zhenhuan Liu, Qi Ye, Zhenyu Cai, Jens Eisert,
• Abstract summary: Post-measurement quantum states are a qualitatively new and decisive resource for measurement learning.<n>Our results suggest potential implications for the design of practical quantum certification protocols.
• Score: 14.816524549511092
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Learning properties of quantum states and channels is known to benefit from resources such as entangled operations, auxiliary qubits, and adaptivity, whereas the resource structure of measurement learning, namely, learning properties of quantum measurement operators, remains poorly understood. In this work, we identify a measurement learning task for which access limited to classical measurement outcomes leads to an exponential lower bound on the query complexity, established via a distinguishing task between a genuine quantum projective measurement and a purely classical random number generator. Remarkably, this hardness persists even when arbitrary entangled operations, auxiliary systems, and fully adaptive strategies are allowed, indicating that conventional resources for state and channel learning are ineffective in this task. In contrast, when access to the post-measurement quantum state is available, the same task can be solved with constant query complexity using a simple measuring-twice protocol, without requiring resources that are useful for state and channel learning. Our results reveal post-measurement states as a qualitatively new and decisive resource for measurement learning, suggesting potential implications for the design of practical quantum certification protocols.

Related papers

• Certifying Quantum States with Uniform Measurements [14.157898052067532]
  Qubit-resolved operations and measurements are required for most current quantum information processing schemes.<n>A more resource-efficient alternative is uniform measurement, where a site-independent rotation of qubits is performed before measuring.<n>We show that uniform measurements can certify certain graph states, a family of highly entangled and broadly useful quantum states.
  arXiv  Detail & Related papers  (2025-08-12T18:00:58Z)
• Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood [9.179660060516916]
  In this work, we establish a general connection between state designs and low-degree hardness.<n>We use this to obtain the first information-computation gaps for learning Gibbs states of random, sparse, non-local Hamiltonians.<n>We also obtain a low-degree hardness result for quantum error mitigation against strategies with single-qubit measurements.
  arXiv  Detail & Related papers  (2025-05-28T18:04:10Z)
• Exponential advantage in continuous-variable quantum state learning [0.0]
  We consider the task of learning quantum states in bosonic continuous-variable (CV) systems.<n>We present a experimentally feasible protocol that utilizes entangled measurements and reflected states.<n>We establish a rigorous exponential advantage from entangled measurements and access to reflected states in learning CV quantum states.
  arXiv  Detail & Related papers  (2025-01-29T13:10:37Z)
• Harnessing quantum back-action for time-series processing [0.0]
  We demonstrate that incorporating indirect measurements into a quantum machine-learning protocol provides advantages in both execution time scaling and overall performance.<n>Our results reveal that carefully optimizing both the reservoir Hamiltonian parameters and the measurement strength can significantly improve the quantum reservoir computing algorithm performance.
  arXiv  Detail & Related papers  (2024-11-06T15:15:04Z)
• Limitations of measure-first protocols in quantum machine learning [2.209921757303168]
  We study a natural supervised learning setting where quantum states constitute data points, and the labels stem from an unknown measurement. We show that there exist problems that can be efficiently learned by fully-quantum protocols but which require exponential resources for measure-first protocols. Our result underscores the role of quantum data processing in machine learning and highlights scenarios where quantum advantages appear.
  arXiv  Detail & Related papers  (2023-11-21T14:03:29Z)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• 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)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Learning quantum systems via out-of-time-order correlators [0.27961972519572437]
  We show that out-of-time-order correlators can substantially improve the learnability of strongly-interacting systems. We numerically characterize these advantages across a variety of learning problems, and find that they are robust to both read-out error and decoherence.
  arXiv  Detail & Related papers  (2022-08-03T18:00:00Z)
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding [58.720142291102135]
  We define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. Our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation.
  arXiv  Detail & Related papers  (2021-09-27T12:56:01Z)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

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.