Locally Gentle State Certification for High Dimensional Quantum Systems

• URL: http://arxiv.org/abs/2602.04550v1
• Date: Wed, 04 Feb 2026 13:41:11 GMT
• Title: Locally Gentle State Certification for High Dimensional Quantum Systems
• Authors: Cristina Butucea, Jan Johannes, Henning Stein,
• Abstract summary: Standard approaches to quantum statistical inference rely on measurements that induce a collapse of the wave function.<n>We investigate the limits of emphlocally-gentle quantum state certification, where the learning algorithm is constrained to perturb the state by at most $$ in trace norm.<n>Our results clarify the trade-off between information extraction and state disturbance, and highlight deep connections between physical measurement constraints and privacy mechanisms in quantum learning.
• Score: 1.1470070927586014
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Standard approaches to quantum statistical inference rely on measurements that induce a collapse of the wave function, effectively consuming the quantum state to extract information. In this work, we investigate the fundamental limits of \emph{locally-gentle} quantum state certification, where the learning algorithm is constrained to perturb the state by at most $α$ in trace norm, thereby allowing for the reuse of samples. We analyze the hypothesis testing problem of distinguishing whether an unknown state $ρ$ is equal to a reference $ρ_0$ or $ε$-far from it. We derive the minimax sample complexity for this problem, quantifying the information-theoretic price of non-destructive measurements. Specifically, by constructing explicit measurement operators, we show that the constraint of $α$-gentleness imposes a sample size penalty of $\frac{d}{α^2}$, yielding a total sample complexity of $n = Θ(\frac{d^3}{ε^2 α^2})$. Our results clarify the trade-off between information extraction and state disturbance, and highlight deep connections between physical measurement constraints and privacy mechanisms in quantum learning. Crucially, we find that the sample size penalty incurred by enforcing $α$-gentleness scales linearly with the Hilbert-space dimension $d$ rather than the number of parameters $d^2-1$ typical for high-dimensional private estimation.

Related papers

• Quantitative wave-particle duality in uniform multipath interferometers with symmetric which-path detector states [1.0896567381206717]
  A quantum system (quanton) traverses an interferometer with $N$ equally probable paths and interacts with another quantum system (detector) that stores path information in a set of correlations states.<n>We present entropic wave-particle duality relations between quantum coherence, characterized by the relative entropy of coherence of the quanton state, and which-path knowledge, quantified by the mutual information obtained through detector-state discrimination.
  arXiv  Detail & Related papers  (2026-01-19T14:19:06Z)
• Sample Complexity Bounds for Scalar Parameter Estimation Under Quantum Differential Privacy [9.244521717083696]
  This paper presents tight upper and lower bounds for minimum number of samples required to attain a prescribed accuracy.<n>The best-case (optimal) scenario is considered by minimizing the sample complexity over all differentially-private channels.
  arXiv  Detail & Related papers  (2025-01-24T02:23:51Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.<n>Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.<n>We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis [39.889087719322184]
  We study the generalization properties of quantum classifiers adversarially trained against bounded-norm white-box attacks. We derive novel information-theoretic upper bounds on the generalization error of adversarially trained quantum classifiers.
  arXiv  Detail & Related papers  (2024-01-31T21:07:43Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Exponentially improved efficient machine learning for quantum many-body states with provable guarantees [0.0]
  We provide theoretical guarantees for efficient learning of quantum many-body states and their properties, with model-independent applications. Our results provide theoretical guarantees for efficient learning of quantum many-body states and their properties, with model-independent applications.
  arXiv  Detail & Related papers  (2023-04-10T02:22:36Z)
• Understanding the Under-Coverage Bias in Uncertainty Estimation [58.03725169462616]
  quantile regression tends to emphunder-cover than the desired coverage level in reality. We prove that quantile regression suffers from an inherent under-coverage bias. Our theory reveals that this under-coverage bias stems from a certain high-dimensional parameter estimation error.
  arXiv  Detail & Related papers  (2021-06-10T06:11:55Z)
• Quantum data hiding with continuous variable systems [8.37609145576126]
  We investigate data hiding in the context of continuous variable quantum systems. We look at the case where $mathcalM=mathrmLOCC$, the set of measurements implementable with local operations and classical communication. We perform a rigorous quantitative analysis of the error introduced by the non-ideal Braunstein-Kimble quantum teleportation protocol.
  arXiv  Detail & Related papers  (2021-02-01T19:00:14Z)
• Efficient Verification of Anticoncentrated Quantum States [0.38073142980733]
  I present a novel method for estimating the fidelity $F(mu,tau)$ between a preparable quantum state $mu$ and a classically specified target state $tau$. I also present a more sophisticated version of the method, which uses any efficiently preparable and well-characterized quantum state as an importance sampler.
  arXiv  Detail & Related papers  (2020-12-15T18:01:11Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.