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:2610.08890

Quantum Readout Complexity for Normalized Linear Functionals

Roi Vence-Nogueira

quant-phSubmitted Oct 6, 2026• Announced Oct 7, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum numerical algorithms often encode a positive solution $q$ in the amplitudes of a quantum state, while the required scientific output is a normalized linear functional of $q$. Basis measurements produce probabilities determined by squared solution values, while the functional uses the solution values themselves. We study the complexity of this output-interface problem for $F_φ(q)=\intφq\,\mathrm dν/\int q\,\mathrm dν$ and identify a target-dependent susceptibility $χ_φ$ that governs the amount of copies of the solution state needed. For a fixed positive reference state and a neighborhood around it, the optimal number of unknown-state copies is $Θ\!\left(χ_0\varepsilon^{-2}\log(1/β)\right)$, where $\varepsilon$ is the absolute error tolerance and $β$ is the allowed failure probability. We show that two fixed single-copy measurements attain the same rate. We then analyze how this baseline changes when the interface retains classical information, uses adaptive allocation, supplies coherent access, or restricts the allowed solution family. Therefore $χ_φ$ quantifies a central cost of using a solution encoded in an $L^2$-normalized quantum state to estimate an $L^1$-normalized linear observable.

AI Summary

Quantum numerical algorithms may encode a positive solution $q$ in amplitudes proportional to $q$, while the desired output is $F_\phi(q)=\int\phi q\,d\nu/\int q\,d\nu$. Basis measurements instead sample squared amplitudes. This paper characterizes readout complexity when only independent solution-state copies, the measure, and the bounded observable $\phi$ are supplied. The central quantity is $\chi_\phi(q)=(\int q^2\,d\nu)/(\int q\,d\nu)^2\int(\phi-F_\phi(q))^2\,d\nu$. Around a fixed positive reference state, in a state-norm ball of radius $\kappa_0/4$, where $\kappa_0=\int q_0/\sqrt{\nu(\Omega)\int q_0^2}$, the minimax copy complexity is $\Theta(\chi_0\varepsilon^{-2}\log(1/\beta))$ for $\varepsilon\leq\kappa_0\sqrt{\chi_0}/12$ and $\beta\leq1/3$. Two fixed single-copy measurements attain this rate using a ratio estimator and median amplification. The converse constructs positive, target-separated states with fidelity divergence $O(\varepsilon^2/\chi_0)$ and applies quantum binary testing, covering biased estimators and collective measurements. A near-uniform example requires $\Omega(\sqrt D)$ basis samples at fixed accuracy, versus dimension-independent copies with these measurements. Extensions give coherent query complexity $\Theta(\sqrt{\chi_0}/\varepsilon)$ at constant confidence, adaptive allocation, and susceptibility reduction through retained classical moments. Consistent discretization preserves susceptibility; a transport pulse family exhibits inverse-width copy cost. The guarantees concern copy count, not measurement implementation or end-to-end solver cost. Lower bounds for restricted solution families require admissible hard pairs: large susceptibility alone is insufficient. Classical records or coherent preparation can change the cost. Finite measure is essential to the neighborhood guarantee, and the principal theorem is local with a restricted accuracy range.

Little sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
20 pages, 1 table

Related papers

Quantum Computing through Computational Imaging: Representations, Measurement, and Inference

George Kourousias, Sergio Carrato, Roberto Pugliese +2 more

An algebraic correspondence between an imaging model and a quantum state does not specify a computational method: input access, measurement and decoding determine what can be returned. This exposition develops four distinctions for computational-imaging and engineering readers. It separates amplitude encodings of input values from encodings of complete candidate labelings, explaining why amplitude storage does not provide full-array readout. Complex-field interference motivates unknown-phase inference: complementary measurements resolve ambiguities that local Fisher information alone does not detect. Reshaping joint amplitudes into a matrix connects singular-value decomposition to pure-state entanglement, while distinguishing Schmidt rank from conditions for efficient classical simulation. In a four-pixel segmentation, an objective becomes a cost operator and a sampling circuit. One layer of the quantum approximate optimization algorithm (QAOA) lowers mean energy from $1.675$ to $0.686$ relative to uniform sampling, yet makes a nonoptimal labeling more probable than the optimum 0.484 versus 0.365. Archived IBM and IQM measurements illustrate a separate six-variable local boundary decision. Low-rank state reconstruction and selected quantum algorithms connect these distinctions to an end-to-end resource account. The derivations and reproducible numerical references assume complex linear algebra and probability, without prior quantum mechanics. The accompanying Seeing Amplitudes browser laboratory supports interactive exploration; the article remains self-contained and connects each representation to the estimate or decision it permits and the resources that output requires.

quant-pharXiv:2610.40393•Oct 30, 2026•0 citations

Faster quantum linear system solver beyond the condition number

Alexander M. Dalzell, Jianqiang Li, Yuan Su

The spectral condition number is a widely adopted measure of worst-case cost for quantum linear system solvers. Yet it can significantly overestimate the actual runtime for a typical problem instance. We present two quantum algorithms that produce the normalized solution $|x\rangle$ of linear system $Ax=| b \rangle$ to accuracy $ε$ with complexity independent of the condition number $κ=\lVert A^{-1}\rVert$. We focus on the standard input model where $A$ is accessed through a block encoding and $| b \rangle$ is prepared by a unitary. But we also introduce an affine dilation model that encodes $A$ and $| b \rangle$ jointly, allowing further refinements of the query complexity. Our truncation-based solver makes an optimal number of queries to $| b \rangle$ and $\operatorname{\mathbf{O}}\left(κ_{\mathrm{eff}}\operatorname{polylog}\left(\frac{κ_{\mathrm{eff}}}ε\right)\right)$ queries to $A$. We prove a family of upper bounds on the effective condition number, including $κ_{\mathrm{eff}}\leq\frac{\lVert(A^\dagger A)^{-t/2}|x\rangle\rVert^{1/t}}{ε^{1/t}}$ for positive even integer $t$ and $κ_{\mathrm{eff}}\leq\frac{\lVert A^{-1\dagger}(A^\dagger A)^{-(t-1)/2}|x\rangle\rVert^{1/t}}{ε^{1/t}}$ for positive odd $t$, overcoming the $κ$-barrier. Our filtering-based solver is extremely simple with a favorable runtime prefactor. In particular, the solver has query complexity $3\frac{\lVert A^{-1\dagger}|x\rangle\rVert}ε$ to leading order when the solution norm is known. We then present a similarly simple solution norm estimator with the same asymptotic cost up to logarithmic factors. Our quantum linear system solvers thus substantially improve a recent algorithm of Li, enabling faster quantum linear system solving beyond the condition number.

quant-pharXiv:2607.07691•Jul 9, 2026•9 citations

No Free Compression in Quantum Relaxations for Optimization

Stuart Hadfield

Qubit-efficient quantum relaxations compress classical decision variables into expectation values on substantially fewer qubits. We ask what resource tradeoffs this compression entails for quantum optimization. For the complete quadratic-Majorana encoding of $m=Θ(n^2)$ binary variables on~$n$ qubits, we define the universal margin as the smallest correlator magnitude that can be guaranteed with prescribed signs for every target sign (bit) assignment. We show that it is exactly $Δ_{\rm Maj}(n)=\tan\!\left(\fracπ{4n}\right)=Θ(1/n)$, whereas uniformly random sign assignments retain $Θ(1/\sqrt n)$ target-specific margins. Arbitrary density operators and mixed fermionic Gaussian states generate the same quadratic-Majorana covariance body, so non-Gaussian state resources cannot enlarge this two-point relaxation. More generally, standard quantum random access code bounds provide general information-theoretic baselines. For any fixed family of $m$ designated binary observables on~$n$ qubits, the universal margin is at most $\sqrt{(2\ln2\,n/m)}$, and random access decoding from $N$ copies with constant success probability above $1/2$ requires $nN=Ω(m)$. For a fixed Pauli correlation encoding required to work uniformly over all targets, maintaining a fixed nonzero decoded magnitude under smooth sign decoding therefore requires a rescaling parameter that grows as the available margin shrinks. Thus, while providing substantial qubit savings, compression can shift cost into restricted expectation value geometry, smaller expectation value magnitudes, or more demanding information recovery rather than eliminate it.

quant-pharXiv:2608.25151•Aug 27, 2026•4 citations

Optimal copy complexity of quantum state cloning

Sangwoo Jeon, Vaughn Sohn, Changhun Oh

Quantum state cloning is the task of approximately producing additional copies of an unknown quantum state from a finite number of input copies. The optimal cloning fidelity is known exactly for pure states, but no comparable characterization is known for general mixed states. We determine the optimal asymptotic copy complexity for $d$-dimensional states of rank at most $r$: producing $M$ additional copies with worst-case fidelity at least $1-\varepsilon$ requires and is achievable with $N=Θ(Mrd/\varepsilon)$ input copies. Remarkably, the lower bound already holds for a family of states with a fixed flat spectrum, while the matching upper bound is achieved by random purification followed by optimal pure-state cloning. For $M=1$, we further show that high-fidelity tomography can be coherently converted into cloning with comparable error, revealing an operational origin of the matching cloning and tomography complexities.

quant-pharXiv:2608.24484•Aug 26, 2026•4 citations

An Optimal Quantum Linear Systems Algorithm

Carlos Bravo-Prieto, Aram W. Harrow, Robin Kothari

In the quantum linear systems problem (QLSP), we are given query access to a $d$-sparse $N\times N$ matrix $A$ with condition number $κ$, and the ability to prepare a quantum state proportional to a vector $\vec b$. The goal is to output an $ε$-approximation to the quantum state proportional to the solution $\vec x$ of $A\vec{x}=\vec{b}$. Following a long line of work, the best previously known quantum algorithms for the QLSP had query complexities $O(κd\log(1/ε))$ and $κ\sqrt d(κd/ε)^{o(1)}$, while the best known lower bounds were $Ω(κ\log(1/ε))$ and $Ω(κ\sqrt d)$. We improve these bounds and show that the complexity of the QLSP is $Θ(κ\sqrt d\log(1/ε))$. We also resolve an open problem of Berry and Childs by showing that any $N\times N$ unitary can be implemented with bounded error using $O(\sqrt N)$ queries to its matrix entries.

quant-pharXiv:2609.35660•Sep 29, 2026•9 citations

Exponential Reduction of Mesh Dependence in Quantum Estimation of Parabolic PDE Observables

Xiantao Li

Can a quantum PDE algorithm avoid the polynomial cost of resolving a fine spatial mesh? For standard fixed-order discretizations, direct classical methods require work polynomial in $h^{-1}$, or equivalently in the number of spatial degrees of freedom $N_h=Θ(h^{-d})$. Direct quantum implementations of a parabolic semigroup still have coherent complexity $\widetilde{\mathcal O}(\sqrt{T}/h)$, and gradient-dependent observables such as heat flux and dissipation introduce additional mesh dependence. Decay of the solution norm will further suppress the postselection probability for preparing a normalized final state. We develop a multilevel quantum algorithm that estimates linear and quadratic observables $directly$ and places the fine--coarse cancellation inside the circuit before measurement. A contour-based LCU reconstructs each target-time correction from a coherent family of shifted resolvent differences. Rather than block encoding the fine and coarse inverses separately, we encode their difference through a shifted Ritz--Schur factorization, exposing its $\mathcal O(h_\ell^2)$ two-grid normalization. For Fourier hierarchies, the corresponding SELECT oracle consists of a quantum Fourier or sine transform, a spectral-band selector, and reversible diagonal arithmetic. We also give a non-Fourier realization based on energy-orthogonal dyadic midpoint details in one dimension, together with structured tensor-product extensions under fixed-rank coefficient and access assumptions. For readouts with derivative order $0\leχ\le2$, optimized amplitude estimation removes $all$ polynomial dependence on the finest mesh size. Under the stated access assumptions, both linear and quadratic observables can be estimated with complexity $\widetilde{\mathcal O}(1+(Tε)^{-1})$, with only polylogarithmic dependence on $h^{-1}$.

quant-pharXiv:2607.18113•Jul 21, 2026•2 citations
Quantum numerical algorithms often encode a positive solution qqq in the amplitudes of a quantum state, while the required scientific output is a normalized linear functional of qqq. Basis measurements produce probabilities determined by squared solution values, while the functional uses the solution values themselves. We study the complexity of this output-interface problem for Fφ(q)=∫φq dν/∫q dνF_φ(q)=\intφq\,\mathrm dν/\int q\,\mathrm dνFφ​(q)=∫φqdν/∫qdν and identify a target-dependent susceptibility χφχ_φχφ​ that governs the amount of copies of the solution state needed. For a fixed positive reference state and a neighborhood around it, the optimal number of unknown-state copies is Θ ⁣(χ0ε−2log⁡(1/β))Θ\!\left(χ_0\varepsilon^{-2}\log(1/β)\right)Θ(χ0​ε−2log(1/β)), where ε\varepsilonε is the absolute error tolerance and βββ is the allowed failure probability. We show that two fixed single-copy measurements attain the same rate. We then analyze how this baseline changes when the interface retains classical information, uses adaptive allocation, supplies coherent access, or restricts the allowed solution family. Therefore χφχ_φχφ​ quantifies a central cost of using a solution encoded in an L2L^2L2-normalized quantum state to estimate an L1L^1L1-normalized linear observable.
Quantum numerical algorithms may encode a positive solution qqq in amplitudes proportional to qqq, while the desired output is Fϕ(q)=∫ϕq dν/∫q dνF_\phi(q)=\int\phi q\,d\nu/\int q\,d\nuFϕ​(q)=∫ϕqdν/∫qdν. Basis measurements instead sample squared amplitudes. This paper characterizes readout complexity when only independent solution-state copies, the measure, and the bounded observable ϕ\phiϕ are supplied.
The central quantity is χϕ(q)=(∫q2 dν)/(∫q dν)2∫(ϕ−Fϕ(q))2 dν\chi_\phi(q)=(\int q^2\,d\nu)/(\int q\,d\nu)^2\int(\phi-F_\phi(q))^2\,d\nuχϕ​(q)=(∫q2dν)/(∫qdν)2∫(ϕ−Fϕ​(q))2dν. Around a fixed positive reference state, in a state-norm ball of radius κ0/4\kappa_0/4κ0​/4, where κ0=∫q0/ν(Ω)∫q02\kappa_0=\int q_0/\sqrt{\nu(\Omega)\int q_0^2}κ0​=∫q0​/ν(Ω)∫q02​​, the minimax copy complexity is Θ(χ0ε−2log⁡(1/β))\Theta(\chi_0\varepsilon^{-2}\log(1/\beta))Θ(χ0​ε−2log(1/β)) for ε≤κ0χ0/12\varepsilon\leq\kappa_0\sqrt{\chi_0}/12ε≤κ0​χ0​​/12 and β≤1/3\beta\leq1/3β≤1/3. Two fixed single-copy measurements attain this rate using a ratio estimator and median amplification. The converse constructs positive, target-separated states with fidelity divergence O(ε2/χ0)O(\varepsilon^2/\chi_0)O(ε2/χ0​) and applies quantum binary testing, covering biased estimators and collective measurements. A near-uniform example requires Ω(D)\Omega(\sqrt D)Ω(D​) basis samples at fixed accuracy, versus dimension-independent copies with these measurements.
Extensions give coherent query complexity Θ(χ0/ε)\Theta(\sqrt{\chi_0}/\varepsilon)Θ(χ0​​/ε) at constant confidence, adaptive allocation, and susceptibility reduction through retained classical moments. Consistent discretization preserves susceptibility; a transport pulse family exhibits inverse-width copy cost.
The guarantees concern copy count, not measurement implementation or end-to-end solver cost. Lower bounds for restricted solution families require admissible hard pairs: large susceptibility alone is insufficient. Classical records or coherent preparation can change the cost. Finite measure is essential to the neighborhood guarantee, and the principal theorem is local with a restricted accuracy range.
An algebraic correspondence between an imaging model and a quantum state does not specify a computational method: input access, measurement and decoding determine what can be returned. This exposition develops four distinctions for computational-imaging and engineering readers. It separates amplitude encodings of input values from encodings of complete candidate labelings, explaining why amplitude storage does not provide full-array readout. Complex-field interference motivates unknown-phase inference: complementary measurements resolve ambiguities that local Fisher information alone does not detect. Reshaping joint amplitudes into a matrix connects singular-value decomposition to pure-state entanglement, while distinguishing Schmidt rank from conditions for efficient classical simulation. In a four-pixel segmentation, an objective becomes a cost operator and a sampling circuit. One layer of the quantum approximate optimization algorithm (QAOA) lowers mean energy from 1.6751.6751.675 to 0.6860.6860.686 relative to uniform sampling, yet makes a nonoptimal labeling more probable than the optimum 0.484 versus 0.365. Archived IBM and IQM measurements illustrate a separate six-variable local boundary decision. Low-rank state reconstruction and selected quantum algorithms connect these distinctions to an end-to-end resource account. The derivations and reproducible numerical references assume complex linear algebra and probability, without prior quantum mechanics. The accompanying Seeing Amplitudes browser laboratory supports interactive exploration; the article remains self-contained and connects each representation to the estimate or decision it permits and the resources that output requires.
The spectral condition number is a widely adopted measure of worst-case cost for quantum linear system solvers. Yet it can significantly overestimate the actual runtime for a typical problem instance. We present two quantum algorithms that produce the normalized solution ∣x⟩|x\rangle∣x⟩ of linear system Ax=∣b⟩Ax=| b \rangleAx=∣b⟩ to accuracy εεε with complexity independent of the condition number κ=∥A−1∥κ=\lVert A^{-1}\rVertκ=∥A−1∥. We focus on the standard input model where AAA is accessed through a block encoding and ∣b⟩| b \rangle∣b⟩ is prepared by a unitary. But we also introduce an affine dilation model that encodes AAA and ∣b⟩| b \rangle∣b⟩ jointly, allowing further refinements of the query complexity. Our truncation-based solver makes an optimal number of queries to ∣b⟩| b \rangle∣b⟩ and O⁡(κeffpolylog⁡(κeffε))\operatorname{\mathbf{O}}\left(κ_{\mathrm{eff}}\operatorname{polylog}\left(\frac{κ_{\mathrm{eff}}}ε\right)\right)O(κeff​polylog(εκeff​​)) queries to AAA. We prove a family of upper bounds on the effective condition number, including κeff≤∥(A†A)−t/2∣x⟩∥1/tε1/tκ_{\mathrm{eff}}\leq\frac{\lVert(A^\dagger A)^{-t/2}|x\rangle\rVert^{1/t}}{ε^{1/t}}κeff​≤ε1/t∥(A†A)−t/2∣x⟩∥1/t​ for positive even integer ttt and κeff≤∥A−1†(A†A)−(t−1)/2∣x⟩∥1/tε1/tκ_{\mathrm{eff}}\leq\frac{\lVert A^{-1\dagger}(A^\dagger A)^{-(t-1)/2}|x\rangle\rVert^{1/t}}{ε^{1/t}}κeff​≤ε1/t∥A−1†(A†A)−(t−1)/2∣x⟩∥1/t​ for positive odd ttt, overcoming the κκκ-barrier. Our filtering-based solver is extremely simple with a favorable runtime prefactor. In particular, the solver has query complexity 3∥A−1†∣x⟩∥ε3\frac{\lVert A^{-1\dagger}|x\rangle\rVert}ε3ε∥A−1†∣x⟩∥​ to leading order when the solution norm is known. We then present a similarly simple solution norm estimator with the same asymptotic cost up to logarithmic factors. Our quantum linear system solvers thus substantially improve a recent algorithm of Li, enabling faster quantum linear system solving beyond the condition number.
Qubit-efficient quantum relaxations compress classical decision variables into expectation values on substantially fewer qubits. We ask what resource tradeoffs this compression entails for quantum optimization. For the complete quadratic-Majorana encoding of m=Θ(n2)m=Θ(n^2)m=Θ(n2) binary variables on~nnn qubits, we define the universal margin as the smallest correlator magnitude that can be guaranteed with prescribed signs for every target sign (bit) assignment. We show that it is exactly ΔMaj(n)=tan⁡ ⁣(π4n)=Θ(1/n)Δ_{\rm Maj}(n)=\tan\!\left(\fracπ{4n}\right)=Θ(1/n)ΔMaj​(n)=tan(4nπ​)=Θ(1/n), whereas uniformly random sign assignments retain Θ(1/n)Θ(1/\sqrt n)Θ(1/n​) target-specific margins. Arbitrary density operators and mixed fermionic Gaussian states generate the same quadratic-Majorana covariance body, so non-Gaussian state resources cannot enlarge this two-point relaxation. More generally, standard quantum random access code bounds provide general information-theoretic baselines. For any fixed family of mmm designated binary observables on~nnn qubits, the universal margin is at most (2ln⁡2 n/m)\sqrt{(2\ln2\,n/m)}(2ln2n/m)​, and random access decoding from NNN copies with constant success probability above 1/21/21/2 requires nN=Ω(m)nN=Ω(m)nN=Ω(m). For a fixed Pauli correlation encoding required to work uniformly over all targets, maintaining a fixed nonzero decoded magnitude under smooth sign decoding therefore requires a rescaling parameter that grows as the available margin shrinks. Thus, while providing substantial qubit savings, compression can shift cost into restricted expectation value geometry, smaller expectation value magnitudes, or more demanding information recovery rather than eliminate it.
Quantum state cloning is the task of approximately producing additional copies of an unknown quantum state from a finite number of input copies. The optimal cloning fidelity is known exactly for pure states, but no comparable characterization is known for general mixed states. We determine the optimal asymptotic copy complexity for ddd-dimensional states of rank at most rrr: producing MMM additional copies with worst-case fidelity at least 1−ε1-\varepsilon1−ε requires and is achievable with N=Θ(Mrd/ε)N=Θ(Mrd/\varepsilon)N=Θ(Mrd/ε) input copies. Remarkably, the lower bound already holds for a family of states with a fixed flat spectrum, while the matching upper bound is achieved by random purification followed by optimal pure-state cloning. For M=1M=1M=1, we further show that high-fidelity tomography can be coherently converted into cloning with comparable error, revealing an operational origin of the matching cloning and tomography complexities.
In the quantum linear systems problem (QLSP), we are given query access to a ddd-sparse N×NN\times NN×N matrix AAA with condition number κκκ, and the ability to prepare a quantum state proportional to a vector b⃗\vec bb. The goal is to output an εεε-approximation to the quantum state proportional to the solution x⃗\vec xx of Ax⃗=b⃗A\vec{x}=\vec{b}Ax=b. Following a long line of work, the best previously known quantum algorithms for the QLSP had query complexities O(κdlog⁡(1/ε))O(κd\log(1/ε))O(κdlog(1/ε)) and κd(κd/ε)o(1)κ\sqrt d(κd/ε)^{o(1)}κd​(κd/ε)o(1), while the best known lower bounds were Ω(κlog⁡(1/ε))Ω(κ\log(1/ε))Ω(κlog(1/ε)) and Ω(κd)Ω(κ\sqrt d)Ω(κd​). We improve these bounds and show that the complexity of the QLSP is Θ(κdlog⁡(1/ε))Θ(κ\sqrt d\log(1/ε))Θ(κd​log(1/ε)). We also resolve an open problem of Berry and Childs by showing that any N×NN\times NN×N unitary can be implemented with bounded error using O(N)O(\sqrt N)O(N​) queries to its matrix entries.
Can a quantum PDE algorithm avoid the polynomial cost of resolving a fine spatial mesh? For standard fixed-order discretizations, direct classical methods require work polynomial in h−1h^{-1}h−1, or equivalently in the number of spatial degrees of freedom Nh=Θ(h−d)N_h=Θ(h^{-d})Nh​=Θ(h−d). Direct quantum implementations of a parabolic semigroup still have coherent complexity O~(T/h)\widetilde{\mathcal O}(\sqrt{T}/h)O(T​/h), and gradient-dependent observables such as heat flux and dissipation introduce additional mesh dependence. Decay of the solution norm will further suppress the postselection probability for preparing a normalized final state. We develop a multilevel quantum algorithm that estimates linear and quadratic observables directlydirectlydirectly and places the fine--coarse cancellation inside the circuit before measurement. A contour-based LCU reconstructs each target-time correction from a coherent family of shifted resolvent differences. Rather than block encoding the fine and coarse inverses separately, we encode their difference through a shifted Ritz--Schur factorization, exposing its O(hℓ2)\mathcal O(h_\ell^2)O(hℓ2​) two-grid normalization. For Fourier hierarchies, the corresponding SELECT oracle consists of a quantum Fourier or sine transform, a spectral-band selector, and reversible diagonal arithmetic. We also give a non-Fourier realization based on energy-orthogonal dyadic midpoint details in one dimension, together with structured tensor-product extensions under fixed-rank coefficient and access assumptions. For readouts with derivative order 0≤χ≤20\leχ\le20≤χ≤2, optimized amplitude estimation removes allallall polynomial dependence on the finest mesh size. Under the stated access assumptions, both linear and quadratic observables can be estimated with complexity O~(1+(Tε)−1)\widetilde{\mathcal O}(1+(Tε)^{-1})O(1+(Tε)−1), with only polylogarithmic dependence on h−1h^{-1}h−1.