Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.17288

Sharp Uniform Fisher Information Bounds from Projective Designs

Anonymous, Bowen Xiao, Huangjun Zhu

Published Nov 12, 2026• 0 citations
arXivHTMLPDF

Abstract

Fixed measurements for multiparameter pure-state metrology must remain informative without knowing the input state. We quantify this requirement by the Fisher floor, the smallest fraction of the quantum Fisher information that a measurement retains over all pure states and tangent directions. We determine the Fisher guarantees, namely lower bounds on Fisher floors, implied by projective design order alone in every dimension $d\ge 2$. These guarantees are sharp at order $t=2$ and every odd order $t\ge 3$, and finite weighted designs attain them; at even orders, our bounds are nearly tight. As the order increases, the guarantees approach one half, the single-copy quantum limit. Sampling and spectral completion of any 3-design yield, with probability $1-O(1/d)$, a measurement with linearly many outcomes and a dimension-independent Fisher floor. Such a measurement separates all pure states in Hellinger distance, so pure-state maximum-likelihood estimation from $N$ copies attains mean infidelity $O(d/N)$ uniformly over pure states, optimal up to a universal constant factor.

DOI
10.48550/arxiv.2611.17288

Related papers

The exact information cost of randomized measurements in quantum metrology

Wanqing Li, Jiaxin Liu

Randomized measurements provide state-independent readout for multiparameter quantum sensing. Although 3-designs retain a constant fraction of the quantum Fisher information (QFI) for every pure state, we show that 2-designs need not. In dimension \(d\), complete mutually unbiased bases (MUBs) retain exactly \(1/(d+1)\) of the QFI in the worst state and direction, attaining the universal lower bound for 2-designs built from orthonormal bases; symmetric informationally complete (SIC) measurements retain exactly \((1-1/\sqrt{d+1})/d\). The loss comes from aligned blind spots. Relative to a basis, pure-state changes split into population and phase parts of equal dimension, but probabilities respond only to the former. Mutual unbiasedness turns a population change for one basis into a phase change for every other. The worst case already occurs for a qubit encoded in two levels. Independent random bases instead scatter their blind spots. In sufficiently large dimensions, five Haar-random bases retain, with high probability, a dimension-independent QFI fraction for every pure state and direction. Random Clifford measurements on any number of qubits retain exactly one third. Thus blind-spot geometry, not second-order symmetry alone, controls worst-case metrological performance.

quant-pharXiv:2611.00599•Nov 3, 2026•0 citations

Near-Optimal Multiparameter Pure-State Metrology with a Constant Number of Bases

Bowen Xiao, Anonymous, Huangjun Zhu

Multiparameter pure-state metrology is limited by the incompatibility of measurements optimized for different parameters. We characterize uniform sensitivity by the Fisher floor, the smallest fraction of the quantum Fisher information (QFI) retained over all pure states and parameter directions. We prove that a constant number of fixed orthonormal bases suffices for a nearly optimal Fisher floor, independently of the Hilbert-space dimension $d$. With high probability, five independent Haar bases already achieve a positive, dimension-independent floor, and larger constant families achieve approximate universal Fisher symmetry: they retain nearly one half of the QFI in every direction, the largest uniform fraction permitted by measurement incompatibility. The required number of bases is optimal up to a logarithmic factor in inverse accuracy. In contrast, $d+1$ mutually unbiased bases, when they exist, can minimize mean Fisher anisotropy among families of $d+1$ bases yet have a Fisher floor of at most $1/(d+1)$, showing that optimal average balance does not ensure uniform sensitivity.

arXiv:2611.17281•Nov 12, 2026•0 citations

Deciding the Attainability of the Multiparameter Quantum Fisher Information is NP-Hard

Lorcan O. Conlon, Laura Shou, V Vijendran +7 more

The quantum Fisher information (QFI) sets a fundamental bound on the attainable precision when estimating multiple parameters simultaneously. Incompatibility among the individually optimal measurements can, in some cases, imply that the precision limit set by the QFI is not attainable. In certain special cases, including pure states and full-rank states, the exact conditions for when the precision limit set by the QFI can be saturated are known. However, general conditions for the attainability of the QFI with measurements on individual copies of the quantum state have long been sought. Indeed, this was recently stated as one of the five problems in quantum information theory highlighted by [P. Horodecki et al, PRX Quantum 3, 010101 (2022)]. In this work we prove that exact attainability with individual measurements is NP-hard to decide, even for a restricted set of real, constant-rank quantum models. The source problem for our proof is the NP-hard problem of deciding whether a given bipartite density matrix is separable or not. Our result shows that the longstanding difficulty in obtaining general conditions for QFI attainability reflects a fundamental computational obstruction, rather than merely a limitation of existing mathematical techniques: unless P=NP, no efficiently computable necessary-and-sufficient criterion can exist in general.

quant-pharXiv:2609.35975•Sep 30, 2026•0 citations

Uniformly Stable Minimal Weyl--Heisenberg Measurements Approaching the SIC Benchmark

Xiuwu Zhu, Yu Wang

Informational completeness (IC) guarantees that an inverse exists, not that it is statistically well conditioned. For minimal rank-one Weyl--Heisenberg (WH) measurements, covariance makes the nonidentity projector-Gram spectrum proportional to the fiducial's ambiguity intensities, with eigenvalues \(d|χ_φ(u)|^2\), turning stability into an explicit worst-direction design problem; write \(λ\) for its smallest nonidentity eigenvalue. Haar fiducials are IC almost surely while \(\mathbb E[λ^{-1}]=\infty\), and an explicit geometric family used to establish balanced informationally complete measurements in every dimension has a normalized spectral floor bounded above by an exponentially decaying envelope. We then construct a hierarchy of minimal measurements. A cyclic family with exactly \(d^2\) outcomes in every integer dimension has floors \(Θ(d^{-3})\) for odd \(d\) and \(Θ(d^{-5})\) for even \(d\); a finite-field family for \(q=2^m\) obeys the uniform bound \(λ\ge4/9\). Our main result treats every prime-power dimension of characteristic \(p\ge5\). A balanced one-coordinate perturbation repairs the zero ambiguity axis of a cubic Alltop state, gives an attained floor uniformly bounded below by a positive constant, and confines the entire nonidentity spectrum to \([L_q,U_q]\) with \(U_q/L_q\to1\). Its SIC-normalized minimum tends to one, and \(λ(φ_q)/Λ_q^\star\to1\) for the global finite-field WH max--min optimum \(Λ_q^\star\), without assuming SIC existence. The complete spectrum determines the exact finite-sample Hilbert--Schmidt error of canonical linear inversion at \(I/d\), while its lower edge controls local Fisher efficiency and canonical-shadow bounds.

quant-pharXiv:2608.11850•Aug 13, 2026•1 citation

Near-optimal pure state estimation with adaptive Fisher-symmetric measurements

Vargas, C., Luciano Pereira, A. Delgado

Quantum state estimation is important for various quantum information processes, including quantum communications, computation, and metrology, which require the characterization of quantum states for evaluation and optimization. We present a three-stage adaptive method for estimating arbitrary $d$-dimensional pure quantum states using locally informationally complete Fisher symmetric measurements (FSM) and a single-shot measurement basis. We derive finite-sample high-probability error bounds for the protocol and demonstrate that our approach scales as $O(d/N)$ for large sample sizes, thereby guaranteeing the advantage of adaptation. Moreover, numerical simulations indicate that the protocol achieves an average infidelity close to the optimal given by the Gill-Massar lower bound (GMB). The total number of measurement outcomes scales linearly with $7d-3$, avoiding the need for collective measurements on multiple copies of the unknown state. This work highlights the potential of adaptive estimation techniques in quantum state characterization while maintaining efficiency in the number of measurement outcomes.

arXiv:2412.04555•Dec 5, 2024•5 citations

Pure-State Quantum Tomography with Minimal Rank-One POVMs

Dan Edidin, Ivan Gonzalez, Itzhak Tamo

Quantum state tomography seeks to reconstruct an unknown state from measurement statistics. A finite measurement (POVM) is \emph{pure-state informationally complete} (PSI-Complete) if the outcome probabilities determine any pure state up to a global phase. We study \emph{rank-one} POVMs that are minimally sufficient for this task. We call such a POVM \emph{vital} if it is PSI-Complete but every proper subcollection is not PSI-Complete. We prove sharp upper bounds on the size of vital rank-one POVMs in dimension \(n\): the size is at most \(\binom{n+1}{2}\) over \(\mathbb{R}\) and at most \(n^{2}\) over \(\mathbb{C}\), and we give constructions that attain these bounds. In the real case, we further exhibit a connection to block designs: whenever \(w \mid n(n-1)\), an \((n,w,w-1)\) design produces a vital rank-one POVM with \(n + n(n-1)/w\) outcomes. We provide explicit constructions for \(w=2,n-1\), and \(n\).

quant-pharXiv:2511.09505•Nov 13, 2025•1 citation
Fixed measurements for multiparameter pure-state metrology must remain informative without knowing the input state. We quantify this requirement by the Fisher floor, the smallest fraction of the quantum Fisher information that a measurement retains over all pure states and tangent directions. We determine the Fisher guarantees, namely lower bounds on Fisher floors, implied by projective design order alone in every dimension d≥2d\ge 2d≥2. These guarantees are sharp at order t=2t=2t=2 and every odd order t≥3t\ge 3t≥3, and finite weighted designs attain them; at even orders, our bounds are nearly tight. As the order increases, the guarantees approach one half, the single-copy quantum limit. Sampling and spectral completion of any 3-design yield, with probability 1−O(1/d)1-O(1/d)1−O(1/d), a measurement with linearly many outcomes and a dimension-independent Fisher floor. Such a measurement separates all pure states in Hellinger distance, so pure-state maximum-likelihood estimation from NNN copies attains mean infidelity O(d/N)O(d/N)O(d/N) uniformly over pure states, optimal up to a universal constant factor.
Randomized measurements provide state-independent readout for multiparameter quantum sensing. Although 3-designs retain a constant fraction of the quantum Fisher information (QFI) for every pure state, we show that 2-designs need not. In dimension ddd, complete mutually unbiased bases (MUBs) retain exactly 1/(d+1)1/(d+1)1/(d+1) of the QFI in the worst state and direction, attaining the universal lower bound for 2-designs built from orthonormal bases; symmetric informationally complete (SIC) measurements retain exactly (1−1/d+1)/d(1-1/\sqrt{d+1})/d(1−1/d+1​)/d. The loss comes from aligned blind spots. Relative to a basis, pure-state changes split into population and phase parts of equal dimension, but probabilities respond only to the former. Mutual unbiasedness turns a population change for one basis into a phase change for every other. The worst case already occurs for a qubit encoded in two levels. Independent random bases instead scatter their blind spots. In sufficiently large dimensions, five Haar-random bases retain, with high probability, a dimension-independent QFI fraction for every pure state and direction. Random Clifford measurements on any number of qubits retain exactly one third. Thus blind-spot geometry, not second-order symmetry alone, controls worst-case metrological performance.
Multiparameter pure-state metrology is limited by the incompatibility of measurements optimized for different parameters. We characterize uniform sensitivity by the Fisher floor, the smallest fraction of the quantum Fisher information (QFI) retained over all pure states and parameter directions. We prove that a constant number of fixed orthonormal bases suffices for a nearly optimal Fisher floor, independently of the Hilbert-space dimension ddd. With high probability, five independent Haar bases already achieve a positive, dimension-independent floor, and larger constant families achieve approximate universal Fisher symmetry: they retain nearly one half of the QFI in every direction, the largest uniform fraction permitted by measurement incompatibility. The required number of bases is optimal up to a logarithmic factor in inverse accuracy. In contrast, d+1d+1d+1 mutually unbiased bases, when they exist, can minimize mean Fisher anisotropy among families of d+1d+1d+1 bases yet have a Fisher floor of at most 1/(d+1)1/(d+1)1/(d+1), showing that optimal average balance does not ensure uniform sensitivity.
The quantum Fisher information (QFI) sets a fundamental bound on the attainable precision when estimating multiple parameters simultaneously. Incompatibility among the individually optimal measurements can, in some cases, imply that the precision limit set by the QFI is not attainable. In certain special cases, including pure states and full-rank states, the exact conditions for when the precision limit set by the QFI can be saturated are known. However, general conditions for the attainability of the QFI with measurements on individual copies of the quantum state have long been sought. Indeed, this was recently stated as one of the five problems in quantum information theory highlighted by [P. Horodecki et al, PRX Quantum 3, 010101 (2022)]. In this work we prove that exact attainability with individual measurements is NP-hard to decide, even for a restricted set of real, constant-rank quantum models. The source problem for our proof is the NP-hard problem of deciding whether a given bipartite density matrix is separable or not. Our result shows that the longstanding difficulty in obtaining general conditions for QFI attainability reflects a fundamental computational obstruction, rather than merely a limitation of existing mathematical techniques: unless P=NP, no efficiently computable necessary-and-sufficient criterion can exist in general.
Informational completeness (IC) guarantees that an inverse exists, not that it is statistically well conditioned. For minimal rank-one Weyl--Heisenberg (WH) measurements, covariance makes the nonidentity projector-Gram spectrum proportional to the fiducial's ambiguity intensities, with eigenvalues d∣χφ(u)∣2d|χ_φ(u)|^2d∣χφ​(u)∣2, turning stability into an explicit worst-direction design problem; write λλλ for its smallest nonidentity eigenvalue. Haar fiducials are IC almost surely while E[λ−1]=∞\mathbb E[λ^{-1}]=\inftyE[λ−1]=∞, and an explicit geometric family used to establish balanced informationally complete measurements in every dimension has a normalized spectral floor bounded above by an exponentially decaying envelope. We then construct a hierarchy of minimal measurements. A cyclic family with exactly d2d^2d2 outcomes in every integer dimension has floors Θ(d−3)Θ(d^{-3})Θ(d−3) for odd ddd and Θ(d−5)Θ(d^{-5})Θ(d−5) for even ddd; a finite-field family for q=2mq=2^mq=2m obeys the uniform bound λ≥4/9λ\ge4/9λ≥4/9. Our main result treats every prime-power dimension of characteristic p≥5p\ge5p≥5. A balanced one-coordinate perturbation repairs the zero ambiguity axis of a cubic Alltop state, gives an attained floor uniformly bounded below by a positive constant, and confines the entire nonidentity spectrum to [Lq,Uq][L_q,U_q][Lq​,Uq​] with Uq/Lq→1U_q/L_q\to1Uq​/Lq​→1. Its SIC-normalized minimum tends to one, and λ(φq)/Λq⋆→1λ(φ_q)/Λ_q^\star\to1λ(φq​)/Λq⋆​→1 for the global finite-field WH max--min optimum Λq⋆Λ_q^\starΛq⋆​, without assuming SIC existence. The complete spectrum determines the exact finite-sample Hilbert--Schmidt error of canonical linear inversion at I/dI/dI/d, while its lower edge controls local Fisher efficiency and canonical-shadow bounds.
Quantum state estimation is important for various quantum information processes, including quantum communications, computation, and metrology, which require the characterization of quantum states for evaluation and optimization. We present a three-stage adaptive method for estimating arbitrary ddd-dimensional pure quantum states using locally informationally complete Fisher symmetric measurements (FSM) and a single-shot measurement basis. We derive finite-sample high-probability error bounds for the protocol and demonstrate that our approach scales as O(d/N)O(d/N)O(d/N) for large sample sizes, thereby guaranteeing the advantage of adaptation. Moreover, numerical simulations indicate that the protocol achieves an average infidelity close to the optimal given by the Gill-Massar lower bound (GMB). The total number of measurement outcomes scales linearly with 7d−37d-37d−3, avoiding the need for collective measurements on multiple copies of the unknown state. This work highlights the potential of adaptive estimation techniques in quantum state characterization while maintaining efficiency in the number of measurement outcomes.
Quantum state tomography seeks to reconstruct an unknown state from measurement statistics. A finite measurement (POVM) is \emph{pure-state informationally complete} (PSI-Complete) if the outcome probabilities determine any pure state up to a global phase. We study \emph{rank-one} POVMs that are minimally sufficient for this task. We call such a POVM \emph{vital} if it is PSI-Complete but every proper subcollection is not PSI-Complete. We prove sharp upper bounds on the size of vital rank-one POVMs in dimension nnn: the size is at most (n+12)\binom{n+1}{2}(2n+1​) over R\mathbb{R}R and at most n2n^{2}n2 over C\mathbb{C}C, and we give constructions that attain these bounds. In the real case, we further exhibit a connection to block designs: whenever w∣n(n−1)w \mid n(n-1)w∣n(n−1), an (n,w,w−1)(n,w,w-1)(n,w,w−1) design produces a vital rank-one POVM with n+n(n−1)/wn + n(n-1)/wn+n(n−1)/w outcomes. We provide explicit constructions for w=2,n−1w=2,n-1w=2,n−1, and nnn.