Inverse-free quantum state estimation with Heisenberg scaling

• URL: http://arxiv.org/abs/2510.25750v1
• Date: Wed, 29 Oct 2025 17:48:46 GMT
• Title: Inverse-free quantum state estimation with Heisenberg scaling
• Authors: Kean Chen,
• Abstract summary: We present an inverse-free pure quantum state estimation protocol that achieves Heisenberg scaling.<n>Our result implies a query upper bound $O(mind3/2/varepsilon,1/varepsilon2)$ for inverse-free amplitude estimation.
• Score: 4.191671741497842
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we present an inverse-free pure quantum state estimation protocol that achieves Heisenberg scaling. Specifically, let $\mathcal{H}\cong \mathbb{C}^d$ be a $d$-dimensional Hilbert space with an orthonormal basis $\{|1\rangle,\ldots,|d\rangle\}$ and $U$ be an unknown unitary on $\mathcal{H}$. Our protocol estimates $U|d\rangle$ to within trace distance error $\varepsilon$ using $O(\min\{d^{3/2}/\varepsilon,d/\varepsilon^2\})$ forward queries to $U$. This complements the previous result $O(d\log(d)/\varepsilon)$ by van Apeldoorn, Cornelissen, Gily\'en, and Nannicini (SODA 2023), which requires both forward and inverse queries. Moreover, our result implies a query upper bound $O(\min\{d^{3/2}/\varepsilon,1/\varepsilon^2\})$ for inverse-free amplitude estimation, improving the previous best upper bound $O(\min\{d^{2}/\varepsilon,1/\varepsilon^2\})$ based on optimal unitary estimation by Haah, Kothari, O'Donnell, and Tang (FOCS 2023), and disproving a conjecture posed in Tang and Wright (2025).

Related papers

• Quantum channel tomography and estimation by local test [32.904052887092284]
  Heisenberg scaling $O(1/varepsilon)$ can be achieved, even if $mathcalE$ is not a unitary channel.<n>We show that for parallel (possibly coherent) testers, access to dilations does not help.
  arXiv  Detail & Related papers  (2025-12-15T18:07:42Z)
• Efficiently learning depth-3 circuits via quantum agnostic boosting [41.9957758385623]
  We study the study of quantum agnostic learning of phase states with respect to a function class $mathsfC$.<n>Our main technical contribution is a quantum boosting protocol which converts a weak learner.<n>Using quantum agnostic boosting, we obtain a $nO(log log n cdot log(1/varepsilon))$-time algorithm for learning $textsfpoly(n)$-sized depth-$3$ circuits.
  arXiv  Detail & Related papers  (2025-09-17T22:28:29Z)
• Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
  Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
  arXiv  Detail & Related papers  (2025-09-15T14:26:11Z)
• Improved Sample Upper and Lower Bounds for Trace Estimation of Quantum State Powers [9.136389487369117]
  We significantly improve the sample complexity of estimating $operatornametr(rhoq)$ in both the upper and lower bounds.<n>Our upper bounds are obtained by (non-plug-in) quantum estimators based on weak Schur sampling.
  arXiv  Detail & Related papers  (2025-05-14T17:06:33Z)
• Optimal bounds for $\ell_p$ sensitivity sampling via $\ell_2$ augmentation [56.403488578703865]
  We show that by augmenting the $ell_p$ sensitivities by $ell$ sensitivities, we obtain better bounds on optimal linear $tilde O(varepsilon-2mu2 d)$ sampling complexity. We also obtain an $tilde O(varepsilon-2mu2 d)$ sensitivity sampling bound for logistic regression.
  arXiv  Detail & Related papers  (2024-06-01T07:03:40Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Query-optimal estimation of unitary channels in diamond distance [3.087385668501741]
  We consider process tomography for unitary quantum channels. We output a classical description of a unitary that is $varepsilon$-close to the unknown unitary in diamond norm.
  arXiv  Detail & Related papers  (2023-02-27T19:00:00Z)
• Low-degree learning and the metric entropy of polynomials [44.99833362998488]
  We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
  arXiv  Detail & Related papers  (2022-03-17T23:52:08Z)
• Learning low-degree functions from a logarithmic number of random queries [77.34726150561087]
  We prove that for any integer $ninmathbbN$, $din1,ldots,n$ and any $varepsilon,deltain(0,1)$, a bounded function $f:-1,1nto[-1,1]$ of degree at most $d$ can be learned.
  arXiv  Detail & Related papers  (2021-09-21T13:19:04Z)
• Approximate Maximum Halfspace Discrepancy [6.35821487778241]
  We consider the range space $(X, mathcalH_d)$ where $X subset mathbbRd$ and $mathcalH_d$ is the set of ranges defined by $d$ halfspaces. For each halfspace $h in mathcalH_d$ define a function $Phi(h)$ that measures the "difference" between the fraction of red and fraction of blue points which fall in the range $h$.
  arXiv  Detail & Related papers  (2021-06-25T19:14:45Z)
• The Price of Tolerance in Distribution Testing [31.10049510641336]
  We show the sample complexity to be [fracsqrtnvarepsilon2 + fracnlog n cdotmaxleftfracvarepsilon2, providing a smooth tradeoff between the two previously known cases. We also provide a similar characterization for the problem of tolerant equivalence testing, where both $p$ and $q$ are unknown.
  arXiv  Detail & Related papers  (2021-06-25T03:59:42Z)
• Private Stochastic Convex Optimization: Optimal Rates in $\ell_1$ Geometry [69.24618367447101]
  Up to logarithmic factors the optimal excess population loss of any $(varepsilon,delta)$-differently private is $sqrtlog(d)/n + sqrtd/varepsilon n.$ We show that when the loss functions satisfy additional smoothness assumptions, the excess loss is upper bounded (up to logarithmic factors) by $sqrtlog(d)/n + (log(d)/varepsilon n)2/3.
  arXiv  Detail & Related papers  (2021-03-02T06:53:44Z)
• An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
  We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
  arXiv  Detail & Related papers  (2020-08-24T06:50:57Z)

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.