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.
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
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.
Reversible Finite-Frame Dynamics for Rational Quantum Grids: Preparation Laws and Matching-Dependent Statistical Predictions This paper develops a finite, reversible model of quantum control motivated by Tim Palmer’s rational quantum mechanics (RaQM). Rational restrictions on quantum states do not by themselves determine how nominal quantum gates should act when their exact outputs lie outside the admissible state set. The paper addresses this problem by constructing finite catalogues of quantum frames on which commands act as permutations, together with explicit preparation laws that assign statistical predictions to complete control sequences. The analysis distinguishes a conditional rational grid from its occupation-compatible subset, identifies their common projective monomial gate group, and proves an obstruction to uniformly accurate fixed-grid repair by local gates. Equal-measure partitions and perfect matchings are then used to construct reversible approximations of local and entangling controls on enlarged finite ray sets. A compensated preparation law yields a common random-unitary channel for each control word, while a finite consistency criterion determines whether a proposed preparation law works for all words. For fixed circuit depth, the resulting statistics converge uniformly to the nominal quantum predictions as the catalogue is refined. At sufficiently large depths, finite recurrence forces disagreement for a repeated entangling circuit. An explicit rematching of the CNOT control removes a seven-block discrepancy without increasing the catalogue size or the stated error bounds, showing that those coarse conditions alone do not determine the earliest observable deviation. The construction is therefore a mathematically explicit candidate completion of finite-state quantum kinematics, while leaving the physical selection of a particular matching, preparation law and reduction dynamics as additional assumptions. Exact Python and Wolfram Language checks accompany the finite examples.
Can a high-quality quantum gate be certified when uncharacterized state-preparation and measurement errors are dominant? Can this be achieved with low experimental overhead? Here, we introduce a sound black-box certification protocol for a single-qubit gate based on a small set of fixed, deterministic sequences. From the data, the protocol derives finite-sample bounds on the gate's rotation eigenvalue, a gauge-invariant property. Its phase reveals the accuracy of the rotation angle, while its modulus quantifies the loss of coherence under repeated gate applications. We implement the protocol on a 40Ca+ trapped-ion processor and certify the X-gate rotation eigenvalue using 22000 circuit executions, and demonstrate the robustness of certification to state-preparation and measurement errors by deliberately degrading the readout. Finally, we prove that these spectral constraints imply, up to a physically meaningful unitary change of basis, a rigorous average gate-fidelity lower bound for every time-independent qubit model compatible with the data. In both readout settings, the spectral bounds yield the same fidelity certificate of 99.94(3)% with 99% confidence. Our results establish a new standard for quantum-gate certification by combining soundness and experimental efficiency without requiring trusted reference operations, randomized circuits, or model fitting.
Quantum executions sharing a provenance record can produce different output distributions. We ask which execution details to retain, and at what precision, to guarantee agreement within a declared Hellinger tolerance. Under a specified channel model, we combine independent stochastic mechanisms and coherent rotation differences to certify recording precision without output simulation or explicit dependence on register dimension. For four-qubit quantum approximate optimization at depth one, a 13-bit comparison record suffices at tolerance 0.05 over a declared continuous noise range, uniformly in programmed angles for each fixed task. Pairwise separation constraints characterize sufficient field sets on finite context classes, exposing omissions that pass individually but fail jointly. Separately, six-qubit hardware measurements over six tested contexts certify minimum label counts of two for raw outputs and one after a fixed decoder, at tolerance 0.15 with 97\% simultaneous confidence under stationary independent shots. Execution records thereby carry checkable agreement guarantees.
We prove that a quantum circuit together with measurement apparatuses and EPR sources can be fully verified without any reference to some other trusted set of quantum devices. Our main assumption is that the physical system we are working with consists of several identifiable sub-systems, on which we can apply some given gates locally. To achieve our goal we define the notions of simulation and equivalence. The concept of simulation refers to producing the correct probabilities when measuring physical systems. To enable the efficient testing of the composition of quantum operations, we introduce the notion of equivalence. Unlike simulation, which refers to measured quantities (i.e., probabilities of outcomes), equivalence relates mathematical objects like states, subspaces or gates. Using these two concepts, we prove that if a system satisfies some simulation conditions, then it is equivalent to the one it is purposed to implement. In addition, with our formalism, we can show that these statements are robust, and the degree of robustness can be made explicit (unlike the robustness results of [DMMS00]). In particular, we also prove the robustness of the EPR Test [MY98]. Finally, we design a test for any quantum circuit whose complexity is linear in the number of gates and qubits, and polynomial in the required precision.
Exact identification of a target instrument need not imply a linear stability bound for nearby observations. We study fixed finite-dimensional complete instruments with rank-one target Choi blocks, all outcomes retained, a fixed diagnostic contamination path with strictly positive branch noise, and an all-device bound on Choi mass outside the target rays. Under these hypotheses, linear prescribed-target certification is equivalent to injectivity of the joint observation and completeness map on the physical target-tangent space. An invisible nonzero tangent yields an exactly feasible positive instrument pair with square-root separation; a separate target-ray condition distinguishes sharp square-root behavior from constant-order ambiguity. For two prescribed three-basis readouts on a four-dimensional incidence-record benchmark, we obtain linear and square-root compatible-instrument radii, respectively. We then distinguish arbitrary probability residuals from simultaneous physical preparation and readout errors. Positivity and normalization give a support-amplitude estimate under which both protocols have linear calibration-only sensitivity, although their responses to contamination and unrestricted probability error differ. A fixed-sample application uses additional exactly trusted references to acquire operator-error bounds and obtain a simultaneous full-instrument confidence statement. A separate named-source power calculation reaches the prescribed error threshold with a conservative sufficient allocation of approximately 6.12 × 10^21 trials. The results concern a fixed laboratory-frame target and supplied common-device and sampling assumptions; they establish neither practical efficiency nor device-independent calibration. Written proofs are supported by exact finite certificates and a returned kernel-checked Lean subset; the full argument is not formalized end to end.
How a finite real cycle acquires a complex structure and a rule for composition Quantum theory uses a common imaginary unit when individual systems become a composite. This framework constructs that compatibility from finite real source histories. On the complete contrast sector of a three-cycle, the forward and backward comparisons give J=3P−P2,J2=−I The complex structure appears after the real comparison is specified. At a qualified unmarked boundary, opposite reference shifts select QAB=2I−JA⊗JB The range is the balanced complex tensor product. Its many-source composition is associative. A finite controlled contact supplies a nonfactorizable complex-linear operation, and exact residual bounds quantify departure from the selected sector. A source model that produces the contact A reversible controller compares operation orders on 24 proper signed frames. Its ordered, arrow-insensitive axis detector produces the retained cyclic response. The contact algebra gives [[G,G],[G,G]][G,G]≅C3. The construction prints the controller, scratch cleanup, full contrast probes, admissible operations and refusal states. A triaxial real response tensor realizes the detector and provides an explicit map between material contrasts and event-count contrasts. A record must survive the test of future operations A present tensor can hide a material marker that a later operation reveals. The framework derives independent force-gradient calibration and a delayed odd-field release. With a nonzero release field, energy and vector torque reconstruct the entire marker change: DU=−Δp⋅E,Dτ=Δp×E.Δp=∣E∣2E×Dτ−DUE The test includes shared calibration errors, stray fields, finite release pulses, marker relaxation and a complete operation inventory. It distinguishes detection of a retained record from agreement with its frozen prediction and from discrimination between physical theories. From proved structure to existing experiments The paper adds a conditional probability-correspondence theorem for the balanced composite, examines independent-source quantum-network experiments, and reproduces all eight measured rows of a public torque dataset. These supply composition benchmarks and demonstrated apparatus capabilities. Their published significances are kept attached to the hypotheses they actually test. The calibrated material release law is also a conventional electrostatic prediction; it is not presented as a QTT-exclusive signal. One material coefficient, two readouts A new archival calculation transfers a published same-particle libration calibration to a separate precession measurement. In the qualified rotor regime, the cross-readout relation is Ξ=ωlib2EpωsΩElcosϕl=alibaprec. An unchanged dipole-to-inertia coefficient gives unity. The calculation yields a slope of 2.909 from the libration calibration, compared with the published precession slope of 2.950, a central difference of 1.4135%. This shared electrostatic consistency relation eliminates the separate dipole and inertia; unequal field gains, dynamical corrections and shared uncertainty remain explicit. Reversal and long-term dipole-stability observations identify complementary laboratory capabilities. The complete matched-tensor delayed-release test remains an experimental target. When do two descriptions differ in any future experiment? The finite-reference extension follows a controlled source contact through shared references, fresh references, inverse operations, intermediate measurements and feedback. Its complete order-three response is gn=∑k=02pkζkn,ζ=e2πi/3,g3=1,g2=g1. A finite observable-span algorithm tests two fully specified models across every permitted future word. It either certifies agreement or returns the preparation, operation sequence, terminal outcome and exact probability difference. In the populated compatible-instrument benchmark, the complete quantum representation gives the same records without an additional target fit. A source-selected physical coupling or preparation remains a distinct route to predictive value. The framework includes nine vector figures, the retained source proofs and countermodels, complete reference-history benchmarks, calibration and vector-reconstruction theorems, runnable exact and numerical checks, published-input receipts, a data assessment and an experimental packet specification. The introduction defines the QTT terms needed to follow the construction without prior familiarity with the corpus. The probability-interface theorem, finite-memory bounds and covariance-weighted witness specify which further laboratory comparisons can distinguish physical models. Source anchors QTT Main Book, especially pp. 56, 248-250, 352 and 827-829; Artian's Completed-Event Four-Capacity Theorem; Frame-cycle derivation map, completed-event lexicon, and Artian's Universe and laboratory readout. Stable citation: 10.5281/zenodo.22882084.