Readout Dependent Parameter Identifiability of Quantum Kernels
Abstract
A circuit parameter can change measured features without changing their projected Gaussian kernel. We characterize this lost dependence and distinguish recovery by metric design from nonlinear feature expansion. With analytic feature coefficients, a fixed finite data basis affinely independent on the input domain, a fixed positive definite metric, and fixed bandwidth, the coefficient Gram matrix determines all-input kernel equivalence, global coordinate inactivity, and generic differential rank. An exact four-qubit family exhibits a sharp boundary: diagonal metrics give rank two, dense metrics reach but cannot exceed three, and no fixed affine expansion crosses this ceiling. One appended nonlinear scalar coordinate suffices for rank four and is minimal when the original features are retained. A single pairwise product achieves this with an explicit nondiagonal metric; a scalar sum of two products achieves it with a diagonal metric. Both use existing ideal local means. Exact certificates establish ranks in 54 selected circuit/readout settings. Matched finite-shot comparisons show that minimal representation size need not give the best sensitivity among the tested designs. Under a factorized measurement distribution, conditional product estimation cannot increase variance at a fixed design. Execution audits further separate kernel identifiability from compiled cost.
Related
- Parameter-Efficient Multilinear Readout for Quantum Reservoir Computing
- Parameter-Dependent Noise Resilience in the Quantum Approximate Optimization Algorithm
- Multi-Threshold Sampling: Local and Global Parameter Identifiability
- Identifiability and Conditioning of Flux-Parameter Inversion for the Buckley–Leverett Equation
- Learning Memory Operators with Physics-Informed Neural Networks: State Recovery, Kernel Reconstruction, and Parameter Identifiability
BibTeX
@misc{park2026readout,
title = {{Readout Dependent Parameter Identifiability of Quantum Kernels}},
author = {Hyong Keun Park and Jahoon Jeong and Joonkyo Shim and Hyunsoo Yoon},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.29186},
eprint = {2610.29186},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.29186},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Readout Dependent Parameter Identifiability of Quantum Kernels
AU - Hyong Keun Park
AU - Jahoon Jeong
AU - Joonkyo Shim
AU - Hyunsoo Yoon
PY - 2026
DA - 2026/10/21
PB - arXiv
DO - 10.48550/arxiv.2610.29186
UR - https://arxiv.org/abs/2610.29186
AB - A circuit parameter can change measured features without changing their projected Gaussian kernel. We characterize this lost dependence and distinguish recovery by metric design from nonlinear feature expansion. With analytic feature coefficients, a fixed finite data basis affinely independent on the input domain, a fixed positive definite metric, and fixed bandwidth, the coefficient Gram matrix determines all-input kernel equivalence, global coordinate inactivity, and generic differential rank. An exact four-qubit family exhibits a sharp boundary: diagonal metrics give rank two, dense metrics reach but cannot exceed three, and no fixed affine expansion crosses this ceiling. One appended nonlinear scalar coordinate suffices for rank four and is minimal when the original features are retained. A single pairwise product achieves this with an explicit nondiagonal metric; a scalar sum of two products achieves it with a diagonal metric. Both use existing ideal local means. Exact certificates establish ranks in 54 selected circuit/readout settings. Matched finite-shot comparisons show that minimal representation size need not give the best sensitivity among the tested designs. Under a factorized measurement distribution, conditional product estimation cannot increase variance at a fixed design. Execution audits further separate kernel identifiability from compiled cost.
ER -