AI & ML
Quantum Shock and Train-Time Constrained Quantization: A Geometric Study of Finite-Resolution Variational Quantum Circuits
arXiv cs.NI0 views
arXiv:2611.17817v1 Announce Type: new Abstract: Finite-resolution interfaces map Variational-Circuit angle to discrete codebook. Since Pauli rotations are periodic, so Euclidean rounding may produce wrong codeword near a chart boundary; error due to coordinates alone cannot measure how much the final state was changed. Herein we define a metric, Quantum Shock, for Pure State it is defined as the average of the square of the Fubini-Study distance (over all inputs) between the pre-deployment and deployed states. This value is limited by constant multipliers of the mean of infidelity and provides upper limits on displacement when observing bounded quantities and margin based predictive stability. Extensions to the analytical Bures-angle for mixed-states were derived, along with a finite shot stability bound. The proposed Train-Time Constrained Quantization allows a delay in applying a penalty for selecting a codeword aligned with periodicity until after task only optimizations. Three small binary tasks were evaluated on a four qubit, two layer classifier using ten matched seeds, K = 4, 8, 16 and exact expectation values from simulation under noiseless conditions and state vector simulations. On our primary evaluation, T-CQ exhibited smaller average local quantum shock compared to circular post-training quantization for each task and code-book size tested. The re-execution on the x86-64 platform using K=8 preserved the direction of the mean-shock comparison but had varying magnitudes.
Source:https://arxiv.org/abs/2611.17817PreviousResource Management and Trajectory Optimization for UAV-IRS Assisted Maritime Edge Computing NetworksNextSpace-based Zero-trust Architecture for Securing the Direct-to-Cell Paradigm
Related posts
Cross-Benchmark Transfer from RL on Agentic Coding Tasks
0arXiv cs.SE
Programmable Distributions of Semantics-Preserving Variants for Evaluating Code Agents
0arXiv cs.SE
Kusner's conjecture on equilateral sets is false
0arXiv cs.NA
Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback
0arXiv stat.ML
When Does On-Policy Interaction Help? Representational Tradeoffs in Value-Based Imitation Learning
0arXiv stat.ML
Disentangling Continuous-Time Latent Dynamics: Identifiability of Latent SDEs via Diffusion Shifts
0arXiv stat.ML