arXiv:2610.06984
Simultaneous Circuit Tests for Finite Reversible Models of Quantum Control
Josef Bruzzese
Abstract
A finite reversible model can approximate individual quantum gates while retaining freedom in its transition tables and preparation contexts. We formulate the simultaneous certification problem in which one stationary controller and one preparation law must reproduce an entire collection of circuit probabilities. For a specified frame catalogue, accuracy graph and calibration constraints, we give an exact shared-table feasibility formulation and distinguish certificates for a fixed table from certificates for the complete model class. A four-frame qubit example exhibits a strict separation between fitting two circuits individually and fitting them jointly. A larger exact benchmark uses 464 frames and a phase symmetry that removes preparation-prior dependence. We independently reconstruct its admissible graph and certify a sharp repeated-circuit horizon: one controller stays within probability error 1/3 through 192 blocks, whereas every allowed controller violates that threshold by block 193. A separate controller reproduces all 8,190 nonempty Hadamard-phase words of length at most twelve within the same tolerance. We also derive a finite-window spectral obstruction and finite-shot confidence tests, illustrated by a reproducible sampling experiment. The conclusions concern the stated finite reversible model classes; they do not establish a universal memory bound or a discrepancy for physical quantum hardware.
AI Summary
The paper asks whether one stationary finite reversible controller and one circuit-independent preparation law can simultaneously reproduce quantum probabilities across a circuit collection. The models use finite unitary-frame catalogues, permutation-valued gate tables constrained by accuracy graphs and calibration, compensated preparations, and fixed terminal readout. It defines the simultaneous circuit radius, the minimum worst-case probability error over allowed controllers and preparation priors, and gives an exact mixed-integer feasibility formulation. A four-frame qubit example separates individual from joint fitting: two circuits each admit error $(2-\sqrt2)/4$, but any shared controller has worst-case error $\sqrt2/4$. Randomising tables between runs changes the model class and lowers this radius. For a specified 464-frame catalogue with exact phase gates, Hadamard tolerance $13/50$, calibration anchors, and right-phase equivariance, exact algebraic graph reconstruction and exhaustive matching-constrained search certify a sharp repeated-circuit horizon at probability tolerance $1/3$: one controller succeeds through 192 repetitions of $(T,H)$, while every allowed controller fails by repetition 193. A separate controller fits all 8,190 nonempty $H,T$ words of length at most twelve, with maximum error approximately $0.30178$. The paper also derives a general finite-window spectral obstruction for stationary permutation models and Hoeffding-based finite-shot tests, illustrated using synthetic data. The numerical exclusions depend on the specified catalogue and restrictions; removing symmetry or allowing stochastic or time-dependent dynamics changes their scope. These results do not establish universal memory bounds or discrepancies for physical hardware. The label count excludes table storage, probability precision, and other resources.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- v2: Revised presentation and LaTeX layout, including improved figure placement and caption formatting. Results and conclusions unchanged, 15 pages, 3 figures, includes exact computational certificates and a reproducible finite-shot simulation study