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

arXiv:2610.06984

Simultaneous Circuit Tests for Finite Reversible Models of Quantum Control

Josef Bruzzese

quant-phSubmitted Oct 4, 2026• Announced Oct 6, 2026• 0 citations• Revised Oct 13, 2026 (v2)
v1 · Oct 4, 2026v2 · Oct 13, 2026
arXivHTMLPDF

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.

Little sign of AI-generated textIncrementalStrong assumptions

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

Related papers

Sound and Efficient Certification of High-Quality Qubit Operations: Theory and Experiment

Nikolai Miklin, Jan Nöller, José Martínez +4 more

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 $^{40}\mathrm{Ca}^{+}$ trapped-ion processor and certify the $\sqrt{\mathrm{X}}$-gate rotation eigenvalue using $22\,000$ 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.

quant-pharXiv:2608.17005•Aug 19, 2026•0 citations

Sufficient quantum provenance: retained fields and certified recording precision

George Kourousias, Sergio Carrato, Roberto Pugliese +5 more

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.

quant-pharXiv:2610.09931•Oct 8, 2026•1 citation

Finite-Count Calibration of Ancilla-Orientation Safe Maps A Bell-Apparatus Bound and a Reference-Link Obstruction

Qingchun Zhang

An exact operational selector specifies which candidate maps are nonnegative on declared preparation and effect resources. This paper studies finite-count calibration of that resource-dependent question for a qubit apparatus with an inert qubit reference, an arbitrary complex physical preparation, and an arbitrary physical binary detector, relative to a trusted common calibration frame. Two preparation-stabilizer settings and six separable detector probes control the statistic of the affine family (1 − θ)id + θT, 0 ≤ θ ≤ 1, uniformly over all compatible state–effect pairs. The explicit radius is 3h + √(2s), where h is a simultaneous detector calibration width and s is a one-sided bound on Bell infidelity. It yields simultaneous inner and outer confidence sets for a one-parameter slice of the declared safe-map class. A fixed allocation of 200,000 trials per calibration setting, totaling 1,600,000 calibration trials, gives false-implication probability at most 0.005 and transpose-exclusion power at least 0.996 at the specified physical alternative. The calibration confidence budgets are 0.001 for preparation and 0.004 for the detector. This exclusion calculation uses no target stream; the acquired calibration circuits can use identity wiring. Coverage and prospective power remain separate statements. The acquisition contract uses fixed-length iid Bernoulli streams with their stated physical means and permits coupling between whole streams. The numerical example sets external-reference systematic errors to zero, and its trial budget excludes establishing reference trust and accuracy. If the preparation and detector references are not linked, the paper constructs two physical identity-wired apparatus worlds with identical complete record laws under the specified independent acquisition construction but different safety conclusions on the fixed target cone pair. A secondary nearest-center theorem supplies unconditional error control for the joint event of a wrong and nonabstaining candidate label under an additional finite-context target-law contract. Its nonidentity candidates are not completely positive maps, and their ideal probabilities lie below the nominal detector’s ordinary positive-output floor. That target law is an explicit model assumption; the label theorem is not a conditional-correctness or posterior statement. The results are analytic and prospective. The number of settings and trial allocations are sufficient constructions, with no empirical success-rate, minimality, optimal sample-complexity, or general certified count-to-feasibility implementation claim. The scope is one declared qubit apparatus, target preparation ray and binary effect cone, and affine map slice. The common complex operator description, trusted reference relationship and physical calibration probability law are assumptions. Exact finite checks and an assessed supporting Lean subset accompany the manuscript. That subset covers 326 audited named declarations: 240 theorems and 86 definition/type interfaces. Analytic binomial coverage, concentration and acquisition bridges, independent-product-law construction and normalization, and the complete noisy-power chain remain outside the accepted Lean subset. That subset does not establish a certified numerical feasibility evaluator, a complete physical two-sector implementation, or an ordinary-channel realization. AI assistance and the dated review/correction provenance are disclosed in the manuscript and companion records. No experimental dataset, external human peer review, or end-to-end formal verification is claimed.

•Nov 8, 2026•0 citations

Self-Testing of Quantum Circuits

Frédéric Magniez, Dominic Mayers, Michele Mosca +1 more

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.

arXiv:quant-ph/0512111•Dec 14, 2005•25 citations

Reversible Finite-Frame Dynamics for Rational Quantum Grids

Josef Bruzzese

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.

•May 2, 2026•1 citation

Stability and Physical Calibration of Outcome-Resolved Instrument Certification

Qingchun Zhang

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.

•Oct 22, 2026•0 citations
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.
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−2)/4(2-\sqrt2)/4(2−2​)/4, but any shared controller has worst-case error 2/4\sqrt2/42​/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/5013/5013/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/31/31/3: one controller succeeds through 192 repetitions of (T,H)(T,H)(T,H), while every allowed controller fails by repetition 193. A separate controller fits all 8,190 nonempty H,TH,TH,T words of length at most twelve, with maximum error approximately 0.301780.301780.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.
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+^{40}\mathrm{Ca}^{+}40Ca+ trapped-ion processor and certify the X\sqrt{\mathrm{X}}X​-gate rotation eigenvalue using 22 00022\,00022000 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)%99.94(3)\%99.94(3)% with 99%99\%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.
An exact operational selector specifies which candidate maps are nonnegative on declared preparation and effect resources. This paper studies finite-count calibration of that resource-dependent question for a qubit apparatus with an inert qubit reference, an arbitrary complex physical preparation, and an arbitrary physical binary detector, relative to a trusted common calibration frame. Two preparation-stabilizer settings and six separable detector probes control the statistic of the affine family (1 − θ)id + θT, 0 ≤ θ ≤ 1, uniformly over all compatible state–effect pairs. The explicit radius is 3h + √(2s), where h is a simultaneous detector calibration width and s is a one-sided bound on Bell infidelity. It yields simultaneous inner and outer confidence sets for a one-parameter slice of the declared safe-map class. A fixed allocation of 200,000 trials per calibration setting, totaling 1,600,000 calibration trials, gives false-implication probability at most 0.005 and transpose-exclusion power at least 0.996 at the specified physical alternative. The calibration confidence budgets are 0.001 for preparation and 0.004 for the detector. This exclusion calculation uses no target stream; the acquired calibration circuits can use identity wiring. Coverage and prospective power remain separate statements. The acquisition contract uses fixed-length iid Bernoulli streams with their stated physical means and permits coupling between whole streams. The numerical example sets external-reference systematic errors to zero, and its trial budget excludes establishing reference trust and accuracy. If the preparation and detector references are not linked, the paper constructs two physical identity-wired apparatus worlds with identical complete record laws under the specified independent acquisition construction but different safety conclusions on the fixed target cone pair. A secondary nearest-center theorem supplies unconditional error control for the joint event of a wrong and nonabstaining candidate label under an additional finite-context target-law contract. Its nonidentity candidates are not completely positive maps, and their ideal probabilities lie below the nominal detector’s ordinary positive-output floor. That target law is an explicit model assumption; the label theorem is not a conditional-correctness or posterior statement. The results are analytic and prospective. The number of settings and trial allocations are sufficient constructions, with no empirical success-rate, minimality, optimal sample-complexity, or general certified count-to-feasibility implementation claim. The scope is one declared qubit apparatus, target preparation ray and binary effect cone, and affine map slice. The common complex operator description, trusted reference relationship and physical calibration probability law are assumptions. Exact finite checks and an assessed supporting Lean subset accompany the manuscript. That subset covers 326 audited named declarations: 240 theorems and 86 definition/type interfaces. Analytic binomial coverage, concentration and acquisition bridges, independent-product-law construction and normalization, and the complete noisy-power chain remain outside the accepted Lean subset. That subset does not establish a certified numerical feasibility evaluator, a complete physical two-sector implementation, or an ordinary-channel realization. AI assistance and the dated review/correction provenance are disclosed in the manuscript and companion records. No experimental dataset, external human peer review, or end-to-end formal verification is claimed.
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.
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.
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.