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

Exact Bounds on Exponential Concentration for Block-Product Quantum Fidelity Kernels

Mezbah Uddin Rafi

Published Aug 18, 2026• 0 citations
Publisher

Abstract

Abstract We characterize the achievable second-moment concentration exponent for block-product fidelity quantum kernels whose per-block ensembles have a maximally mixed first moment. For n = mb qubits partitioned into m independent b-qubit blocks, with no entangling gate crossing a block boundary, the exponent c, defined by E[κ²] = 2⁻ᶜⁿ, satisfies c ∈ [1, c(b)] for every finite b, where c(b) = [(b−1) + log₂(2ᵇ+1)]/b increases monotonically from log₂ 3 ≈ 1.585 at b=1 to 2 as b→∞. The lower endpoint is attained exactly by digitizing (basis-encoding) block ensembles, proved here; the upper endpoint follows from the optimal second frame potential of state 2-designs (Nakata et al.) [8], which we apply rather than re-derive. We validate the resulting scaling against idealized Haar-random blocks and finite-depth parameterized circuits, with propagated standard errors, obtaining relative error from −2.9% to +0.14% for block sizes b=2 through 6, tightening as b grows. We identify a structural limitation of single-qubit (b=1) blocks: a continuous data parameter spans only a one-dimensional subset of the Bloch sphere, which has zero measure with respect to the Haar measure, so no purely data-driven single-qubit encoding can realize an exact 2-design; a depth study shows the corresponding purity converging non-monotonically, consistent with this limitation. We further distinguish two notions of practical resolvability — the shot-noise threshold implied by the variance exponent, and the finite-shot consequence for pairwise similarity ranking — report each together with its associated agreement criterion, and calibrate the relationship between them on finite-depth circuits across a shot-budget-by-qubit-count grid (180 points, median heuristic error 0.017). Finally, we relate this result to adjacent constructions that also avoid concentration through different mechanisms — covariant kernels, permutation-equivariant barren-plateau-free kernels, and a Rydberg-blockade many-body kernel — each of which lies outside the hypothesis class considered here.

DOI
10.21203/rs.3.rs-10726261/v1

Related papers

A Computable Fidelity Floor for Noisy Quantum Circuits from Light-Cone–Resolved Pauli Weight Bounds

Mitchell Smith

Abstract: Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone–resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in O(Gn) time for a circuit with Ggates on nqubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than 103 circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit T1/T2 rates, up to n= 8, depth 40), the envelope bound achieves 100% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately 2.6× at depth 20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime n≤ 8, depth ≤ 20, and γT ≲ 0.3. These results establish a circuit-structure–based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.

•Mar 12, 2026•0 citations

Finite-classical-record quantum state reconstruction: one-shot bounds and acquisition limits

Wahyu Rahmaniar

Abstract We study the one-shot reconstruction of a quantum state when a single copy of the source is measured, the outcome is stored in a classical record of fixed finite dimension, and a state is prepared at the destination from the record. This acquisition-limited problem is distinguished from a visible benchmark in which the source label is available to the encoder. For a finite ensemble we derive finite-record bounds on the visible distortion in terms of the cumulative prior mass covered by the record and the optimal discrimination probability, identify the regimes in which they are exact, and solve the two-state visible problem at every record dimension. For pure-state ensembles, exact acquisition-limited reconstruction is possible if and only if the states are perfectly distinguishable, so nonorthogonal targets retain a positive error at every record dimension. For two equiprobable nonorthogonal pure states we derive the optimal trace-distance distortion within the reflection-symmetric two-outcome class in closed variational form and find that unrestricted numerical optimization with up to six outcomes attains the same value; the resulting symmetric value lies strictly below the guess-and-prepare, unambiguous-discrimination, fidelity-optimal, and Haar-random strategies and is realized by one classical bit and one feed-forward rotation. Every classical-record reconstruction is shown to be entanglement breaking, with a quantitative bound on the loss of entanglement with an inaccessible reference, and the record dimension is related to the spectral rank of an energy-constrained memory. These results quantify the separation between a finite classical description and the information obtainable from a single quantum system. MSC Classification: 81P15 , 81P17 , 81P45 , 81P47

•Sep 24, 2026•0 citations

A Computable Fidelity Floor for Noisy Quantum Circuits from Light-Cone–Resolved Pauli Weight Bounds

M. L. Smith

Abstract Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone--resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in $O(Gn)$ time for a circuit with $G$ gates on $n$ qubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than $10^3$ circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit $T_1/T_2$ rates, up to $n=8$, depth~40), the envelope bound achieves 100\% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately $2.6\times$ at depth~20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime $n \le 8$, depth~$\le 20$, and $\gamma T \lesssim 0.3$. These results establish a circuit-structure--based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.

•May 19, 2026•0 citations

Information-Geometric Quantum Control: Convergence Limits, Brachistochrone Speed Limits, and Shot-Noise Concentration in Quantum Natural Gradient Optimization

Ahmed Hala

We formalize the exact optimization boundaries, physical time evolution minimums, and finite-resource measurement constraints that govern the performance of the Quantum Natural Gradient (QNG) update rule on parameterized variational manifolds. First, we state and prove Theorem 4.1 to characterize the exact convergence properties of QNG updates under bounded Riemannian metrics. Crucially, we isolate the causal mechanism linking ansatz expressivity to geometric degradation, proving that the pulled-back Fubini–Study metric elements inherit the exponential O(2−N ) variance collapse dictated by Haar measure integration over random unitary circuit layouts. This scaling is shown to drive an exponential inflation of the metric condition number, establishing a clear geometric origin for the numerical tracking instabilities that stall optimization vectors in large-scale parameter spaces. Second, we formalize the Information-Geometric Quantum Brachistochrone (Theorem 4.2), proving that under instantaneous velocity limitations derived from the system’s energy variance, the absolute minimum time T required to map a state vector between two configurations is bounded strictly below by the integrated Riemannian geodesic distance Lgeodesic. This result demonstrates that flat Euclidean metrics severely underestimate physical time requirements near highly entangled boundaries where local manifold curvature dominates. Finally, we derive a sharp Shot-Noise Metric Concentration Bound (Theorem 4.3), resolving an exact cyclic trace simplification to prove that finite-shot perturbation errors concentrate according to a structural noise alignment factor κ(θ) = Tr(Σg−1)/∥∆θ∥2g . Multi-trial multinomial simulations validate this relation across all shot budgets (102 to 105), verifying that the empirical breach probability tracks safely below the analytical trace constraint line. This bound exposes a fundamental engineering trade-off: as an optimization path approaches ill conditioned regions where the minimum eigenvalue collapses (λmin → 0), the tracking framework requires a quadratic expansion of measurement resources to suppress shot noise and stabilize control loops.

•Jun 30, 2026•0 citations

Wavelet Variance Equipartition as a Threshold for World-Model Quality and Quantum Kernel TN-Simulability

Chon-Fai Kam, Xavier Cadet, Miloud Bessafi +1 more

While world models learn compact representations of complex environments, they lack a physics-grounded metric to assess the structural fidelity of their latent spaces. We identify the wavelet scaling exponent $α$ as a critical diagnostic, proposing optimal representations satisfy variance equipartition ($α\approx 1/2$) -- mirroring Kolmogorov's inertial range. We establish $α= 1/2$ as a sharp transition boundary for the classical simulability of amplitude-encoded quantum kernels. Using tensor-network theory, we prove latents with $α> 1/2$ reside in an area-law phase admitting efficient classical emulation, while $α< 1/2$ triggers a volume-law phase where the Matrix Product State bond dimension $χ$ grows exponentially with qubit count $n$. Analyzing pre-trained VideoMAE latents reveals a dichotomy: spatial tokens approach the equipartition limit ($α\approx 0.423$), but permutation-invariant feature channels exhibit unstructured disorder ($α\approx -0.123$). This forces real-world latents deep into the volume-law phase, providing a data-driven necessary condition for simulation hardness. Finally, we apply Weingarten calculus to derive the exact variance of the scrambled transition probability under a 2-design ensemble. We prove this variance scales strictly as $\Var[X] = Θ(d^{-2})$. We confirm this numerically with a log-log slope of $-1.881$ ($R^2 = 0.999$), identifying a formidable shot-noise wall demanding a measurement budget of $M = Ω(d^2)$ that constrains quantum machine learning scalability.

quant-pharXiv:2605.11557•May 13, 2026•0 citations

Exponential concentration in quantum kernel methods

Supanut Thanasilp, Samson Wang, Marco Cerezo +1 more

Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model's parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods.

arXiv:2208.11060•Nature Communications•Jun 18, 2024•324 citations
Abstract We characterize the achievable second-moment concentration exponent for block-product fidelity quantum kernels whose per-block ensembles have a maximally mixed first moment. For n = mb qubits partitioned into m independent b-qubit blocks, with no entangling gate crossing a block boundary, the exponent c, defined by E[κ²] = 2⁻ᶜⁿ, satisfies c ∈ [1, c(b)] for every finite b, where c(b) = [(b−1) + log₂(2ᵇ+1)]/b increases monotonically from log₂ 3 ≈ 1.585 at b=1 to 2 as b→∞. The lower endpoint is attained exactly by digitizing (basis-encoding) block ensembles, proved here; the upper endpoint follows from the optimal second frame potential of state 2-designs (Nakata et al.) [8], which we apply rather than re-derive. We validate the resulting scaling against idealized Haar-random blocks and finite-depth parameterized circuits, with propagated standard errors, obtaining relative error from −2.9% to +0.14% for block sizes b=2 through 6, tightening as b grows. We identify a structural limitation of single-qubit (b=1) blocks: a continuous data parameter spans only a one-dimensional subset of the Bloch sphere, which has zero measure with respect to the Haar measure, so no purely data-driven single-qubit encoding can realize an exact 2-design; a depth study shows the corresponding purity converging non-monotonically, consistent with this limitation. We further distinguish two notions of practical resolvability — the shot-noise threshold implied by the variance exponent, and the finite-shot consequence for pairwise similarity ranking — report each together with its associated agreement criterion, and calibrate the relationship between them on finite-depth circuits across a shot-budget-by-qubit-count grid (180 points, median heuristic error 0.017). Finally, we relate this result to adjacent constructions that also avoid concentration through different mechanisms — covariant kernels, permutation-equivariant barren-plateau-free kernels, and a Rydberg-blockade many-body kernel — each of which lies outside the hypothesis class considered here.
Abstract: Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone–resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in O(Gn) time for a circuit with Ggates on nqubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than 103 circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit T1/T2 rates, up to n= 8, depth 40), the envelope bound achieves 100% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately 2.6× at depth 20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime n≤ 8, depth ≤ 20, and γT ≲ 0.3. These results establish a circuit-structure–based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.
Abstract We study the one-shot reconstruction of a quantum state when a single copy of the source is measured, the outcome is stored in a classical record of fixed finite dimension, and a state is prepared at the destination from the record. This acquisition-limited problem is distinguished from a visible benchmark in which the source label is available to the encoder. For a finite ensemble we derive finite-record bounds on the visible distortion in terms of the cumulative prior mass covered by the record and the optimal discrimination probability, identify the regimes in which they are exact, and solve the two-state visible problem at every record dimension. For pure-state ensembles, exact acquisition-limited reconstruction is possible if and only if the states are perfectly distinguishable, so nonorthogonal targets retain a positive error at every record dimension. For two equiprobable nonorthogonal pure states we derive the optimal trace-distance distortion within the reflection-symmetric two-outcome class in closed variational form and find that unrestricted numerical optimization with up to six outcomes attains the same value; the resulting symmetric value lies strictly below the guess-and-prepare, unambiguous-discrimination, fidelity-optimal, and Haar-random strategies and is realized by one classical bit and one feed-forward rotation. Every classical-record reconstruction is shown to be entanglement breaking, with a quantitative bound on the loss of entanglement with an inaccessible reference, and the record dimension is related to the spectral rank of an energy-constrained memory. These results quantify the separation between a finite classical description and the information obtainable from a single quantum system. MSC Classification: 81P15 , 81P17 , 81P45 , 81P47
Abstract Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone--resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in O(Gn)O(Gn)O(Gn) time for a circuit with GGG gates on nnn qubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than 10310^3103 circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit T1/T2T_1/T_2T1​/T2​ rates, up to n=8n=8n=8, depth~40), the envelope bound achieves 100\% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately 2.6×2.6\times2.6× at depth~20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime n≤8n \le 8n≤8, depth~≤20\le 20≤20, and γT≲0.3\gamma T \lesssim 0.3γT≲0.3. These results establish a circuit-structure--based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.
We formalize the exact optimization boundaries, physical time evolution minimums, and finite-resource measurement constraints that govern the performance of the Quantum Natural Gradient (QNG) update rule on parameterized variational manifolds. First, we state and prove Theorem 4.1 to characterize the exact convergence properties of QNG updates under bounded Riemannian metrics. Crucially, we isolate the causal mechanism linking ansatz expressivity to geometric degradation, proving that the pulled-back Fubini–Study metric elements inherit the exponential O(2−N ) variance collapse dictated by Haar measure integration over random unitary circuit layouts. This scaling is shown to drive an exponential inflation of the metric condition number, establishing a clear geometric origin for the numerical tracking instabilities that stall optimization vectors in large-scale parameter spaces. Second, we formalize the Information-Geometric Quantum Brachistochrone (Theorem 4.2), proving that under instantaneous velocity limitations derived from the system’s energy variance, the absolute minimum time T required to map a state vector between two configurations is bounded strictly below by the integrated Riemannian geodesic distance Lgeodesic. This result demonstrates that flat Euclidean metrics severely underestimate physical time requirements near highly entangled boundaries where local manifold curvature dominates. Finally, we derive a sharp Shot-Noise Metric Concentration Bound (Theorem 4.3), resolving an exact cyclic trace simplification to prove that finite-shot perturbation errors concentrate according to a structural noise alignment factor κ(θ) = Tr(Σg−1)/∥∆θ∥2g . Multi-trial multinomial simulations validate this relation across all shot budgets (102 to 105), verifying that the empirical breach probability tracks safely below the analytical trace constraint line. This bound exposes a fundamental engineering trade-off: as an optimization path approaches ill conditioned regions where the minimum eigenvalue collapses (λmin → 0), the tracking framework requires a quadratic expansion of measurement resources to suppress shot noise and stabilize control loops.
While world models learn compact representations of complex environments, they lack a physics-grounded metric to assess the structural fidelity of their latent spaces. We identify the wavelet scaling exponent ααα as a critical diagnostic, proposing optimal representations satisfy variance equipartition (α≈1/2α\approx 1/2α≈1/2) -- mirroring Kolmogorov's inertial range. We establish α=1/2α= 1/2α=1/2 as a sharp transition boundary for the classical simulability of amplitude-encoded quantum kernels. Using tensor-network theory, we prove latents with α>1/2α> 1/2α>1/2 reside in an area-law phase admitting efficient classical emulation, while α<1/2α< 1/2α<1/2 triggers a volume-law phase where the Matrix Product State bond dimension χχχ grows exponentially with qubit count nnn. Analyzing pre-trained VideoMAE latents reveals a dichotomy: spatial tokens approach the equipartition limit (α≈0.423α\approx 0.423α≈0.423), but permutation-invariant feature channels exhibit unstructured disorder (α≈−0.123α\approx -0.123α≈−0.123). This forces real-world latents deep into the volume-law phase, providing a data-driven necessary condition for simulation hardness. Finally, we apply Weingarten calculus to derive the exact variance of the scrambled transition probability under a 2-design ensemble. We prove this variance scales strictly as $\Var[X] = Θ(d^{-2})$. We confirm this numerically with a log-log slope of −1.881-1.881−1.881 (R2=0.999R^2 = 0.999R2=0.999), identifying a formidable shot-noise wall demanding a measurement budget of M=Ω(d2)M = Ω(d^2)M=Ω(d2) that constrains quantum machine learning scalability.
Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model's parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods.