WorksPhysics and Astronomy
Hidden selection rules and amplitude ceilings in quantum Fourier models
Abstract
Quantum models with Pauli data encodings compute trigonometric polynomials whatever channels, ancillas and outcome-averaged measurements follow, so their expressivity depends on the Fourier coefficients a circuit can reach. We identify two kinds of structure that settle this before training. An antiunitary time-reversal rule and a unitary reflection rule remove frequencies. For gate-level circuits, deciding whether such a rule exists reduces to a linear system over GF(2), solvable in polynomial time, and the time-reversal rule holds in 17.6% of 6,120 configurations of standard templates. Single-upload encodings cap the top coefficient at for every channel, and we compute the tight ceiling for every frequency and a depth-independent re-uploading bound. Frozen before training, these bounds were never violated on a non-linearity benchmark, and they predicted trained performance on real data. On IBM processors the rule held on a 65-qubit chain, and we switched rule-breaking relaxation noise on and off by design.
Introduction
A parameterised quantum circuit that encodes a scalar through gates computes a trigonometric polynomial whose frequencies are set by the eigenvalue differences of the generators [2]. Composing the encodings with arbitrary linear maps keeps the output a trigonometric polynomial with the same frequency bound (Lemma 1), and the main paper [1] shows that every finite-shot procedure, with any classical head, is bounded by the spectral range of its encodings. This leaves open which coefficients a given circuit can actually reach. We show that two kinds of structure decide this, and that both can be computed before training.
The first kind produces exact zeros. Hidden symmetries of a circuit remove frequencies from its output: we identify an antiunitary (time-reversal) selection rule and a unitary reflection rule, give a polynomial-time procedure that decides whether a circuit has one, and show that a single gate can switch the rule off. The second kind produces exact ceilings, which can make even an allowed frequency useless. For single-upload encodings the top coefficient is at most whatever channel follows, and we compute the tight ceiling for every frequency. Together the two turn a benchmark into a test of predictions. Every failure of the six ansätze of the QNLEP benchmark [3] is either structurally impossible or capped by the ceiling, and we froze these predictions before the training runs that test them.
Earlier work computes exact spectra and coefficients for Clifford-plus-rotation circuits [4, 5], bounds the largest frequency from the encoding [2, 6], and studies coefficient magnitudes for typical (Haar or 2-design) parameters [7, 8]. Wiedmann et al. report frequencies that vanish for reasons that “cannot be explained by the heuristics” [5], and symmetries of the kind we describe are one such reason. Group-invariant and equivariant QML imposes symmetries of the data by design [9, 10], whereas the symmetries studied here are unintended properties of a circuit that remove expressivity. Noise is usually described as contracting Fourier coefficients [11, 12]; we show that non-unital noise can also restore frequencies that the noiseless circuit provably cannot express. Re-uploading models are known to suppress high frequencies on average over Haar-random layers [8]; our ceilings hold in the worst case, over all parameters and all channels.
Results
Channels do not change the function class
Lemma 1 (Channel closure [1]). Let enter only through encoding gates whose generators have integer eigenvalue half-differences and spectral range . Interleave them with arbitrary -independent unitaries, CPTP maps and instruments, where measurement outcomes may control later operations, including whether later encodings are applied. Then the outcome-averaged model is a trigonometric polynomial with . For Pauli generators this is , the largest number of encodings on any outcome branch.
The proof and the numerical checks are in [1]. Within this class, the remaining question is which coefficients a given circuit can reach.
A time-reversal selection rule
Theorem 1 (Time-reversal selection rule). Let the encoded qubits be prepared once as and the rest of the register in . Let be any CPTP map and . If the antiunitary satisfies , for all , and with , then . Hence unless .
Spin time reversal commutes with every single-qubit rotation, so trainable single-qubit layers never break the rule; the entangling structure and the noise can. A CNOT from an encoded qubit into an ancilla on which acts as maps to , so a star of such CNOTs is covariant if and only if is even. This is why the ancilla-tracing ansatz of the QNLEP benchmark expresses only odd frequencies for every even and every depth, and why its rung collapsed at [3]. Depolarizing and dephasing channels are covariant and preserve the rule. Amplitude damping is not covariant, because maps relaxation toward onto relaxation toward . A non-unital channel can therefore add frequencies that the noiseless model cannot express, while staying inside the encoding spectrum.
Reflection rule. A unitary symmetry acts differently. Since , an -type frame on the encoded qubits that commutes with the rest of the circuit and anticommutes with gives . This forces and fixes the phases , but removes no other frequency. It explains the only circuit in our 144-circuit design census on which the Pauli-path bound (Methods) was not exact, a trainable- system with an ancilla whose support is with (verified to ).
Deciding the rule. For gate-level circuits the search for a frame reduces to a linear system over GF(2), so whether a rule exists can be decided in polynomial time; a circuit with 1,025 qubits and 31,744 gates takes 51 ms (validation in Methods, “The GF(2) frame checker and the census”). On a census of 6,120 configurations of standard templates and libraries the time-reversal rule holds in 17.6% of cases (44% of ancilla designs and 30% of template configurations), and a Pauli-path support bound (Methods) is exact on 203 of 204 benchmark circuits, the exception being the reflection rule. The rule is therefore not a curiosity of one ansatz.
An exact amplitude ceiling
Theorem 2 (Amplitude ceiling). Let qubits each carry one encoding on , followed by any CPTP map (with ancillas, noise and outcome-averaged measurements) and a readout with . Write . Then
and the maximum is attained. In particular .
Because is a product of identical qubit states, it lies in the symmetric subspace, and computing is an -dimensional eigenvalue problem (Table 1). Fitting with an amplitude of at most gives . With eight single-upload qubits the component exists but caps the fit at , while caps it at 0.87. Single-upload models thus carry high frequencies only with exponentially small weight, for every channel. The ceiling is the Fourier form of the separable limit: a single upload acts on a product state, the master bound of [1] bounds every coefficient by , and an entangled input reaches at . It is a deterministic, worst-case counterpart of the average-case results for Haar-random layers [8, 7]. The ceiling also explains plateaus that appear in training regardless of budget: 0.750, 0.437 and 0.234 are the ceilings for , 3 and 4, and a tenfold training budget does not move them.
| 1 | 2 | 3 | 4 | 5 | 6 | 8 | |
| 2 | 0.500 | 0.250 | |||||
| 3 | 0.573 | 0.433 | 0.125 | ||||
| 4 | 0.576 | 0.467 | 0.250 | 0.0625 | |||
| 6 | 0.599 | 0.506 | 0.395 | 0.215 | 0.077 | 0.0156 | |
| 8 | 0.610 | 0.540 | 0.446 | 0.321 | 0.175 | 0.073 | 0.0039 |
| 12 | 0.619 | 0.570 | 0.500 | 0.416 | 0.310 | 0.200 | 0.052 |
Table 1. Exact amplitude ceiling for an -qubit single upload. The diagonal is .
Re-uploading. For qubits re-uploaded times, with any channels in between,
independent of (Methods). At this is , so the frequencies at the top of a re-uploading spectrum stay exponentially small in the width of the first upload layer, however deep the model. The bound is tight at and loose below, and numerical maximisation for , found no violation (Figure 1c).
Figure 1. Amplitude ceilings. a, exact single-upload ceiling ; the top coefficient is . b, measured on ibm_fez for three qubits: the product readout (), an entangled circuit whose parameters maximise of (88% of ), and a random circuit; no arm exceeds the ceiling. c, re-uploading ceiling (lines) and the largest coefficients found by optimisation for , (dots).
Structure predicts the benchmark
Support and ceiling together bound every rung of the QNLEP non-linear-capacity benchmark [3] before training. We froze the bounds before training on 72 cells and on a held-out grid of five operating points with up to 8 qubits. No forbidden rung was fitted (0 of 965 and 0 of 183), and no trained value exceeded its bound (0 of 450). The bounds rank methods only partly (Kendall on the held-out grid, below the pre-registered 0.6). Structure decides what can be fitted and how well at best, and training decides the rest. Adding one on the ancilla per layer breaks the rule without new parameters and triples the benchmark score at (4, 4). On real two-feature data, a classical fit on each model’s Fourier support, frozen before training, predicted the trained model’s test within 0.026 on six datasets. In a fresh replication on 20 tasks it did so within 0.15 in all 60 cells; the predicted sign of the repair’s effect held in 19 of 19 cases, and no effect appeared in 20 of 20 cases where none was predicted (Figure 2; details in Methods).
Figure 2. Structure predicts trained performance. a, held-out grid: trained of every rung against the structural bound frozen before training (450 values, no violation). b, six real datasets: the gain from the one-gate repair against the gain predicted by a classical fit on the Fourier supports (Spearman 0.83). c, the same classical fit predicts the trained symmetric model within 0.03.
Hardware
Every run was pre-registered with thresholds and a same-day noise prediction before submission (Table 2; Methods describes the commit record), and we report the misses alongside the passes. The selection rule held on hardware wherever its symmetry did. Forbidden harmonics stayed at the shot-noise floor for a five-qubit ancilla circuit and for a heavy-hex ancilla chain at 33 and 65 qubits, where the even power per site was and , against 14 and 19 times more for a control (Figure 3a). They also stayed at the floor for the two-dimensional rule and its one-gate repair (Figure 3b,Figure 3c), and for a hidden rule in a one-layer StronglyEntanglingLayers template, whose forbidden half stayed at 1.2 to 3 times the floor while two-layer controls showed it 97 and 147 times higher. Rule-breaking noise could be switched on and off by design (Figure 4). Plain idles broke the rule through relaxation, an echo or a Pauli twirl restored it, running the idle in the bit-flipped frame reversed the offset, and the offset followed the relaxation law with the calibrated time constant; one device also revealed a coherent phase. A three-qubit circuit optimised for reached 88% of the ceiling , and no arm exceeded the ceiling, as the theorem requires for every channel, noise included (Figure 1b). Methods gives the details, including the misses.
Figure 3. The selection rule at scale and in two dimensions. a, even-harmonic power of every system-qubit readout of a heavy-hex ancilla chain on ibm_fez at 33 and 65 qubits, for the symmetric circuit and a control with one per ancilla (bars: means). b, c, 2-D Fourier power of the ancilla-tracing circuit and its one-gate repair on ibm_fez; outlined cells (even , even ) are forbidden by the rule.
Figure 4. Rule-breaking noise switched by design. a, constant term (forbidden by the rule) with idles left plain, echoed, Pauli-twirled, or run in the flipped frame, on three devices. b, the offset against idle time follows a relaxation law (lines: fits), and the frame flip reverses it at every dose (triangles; dotted: mirrored fits).
| Experiment | device | QPU s | test | outcome |
| 1. Rule, T1 dose, echo (5 qubits) | marrakesh | 95 | P1–P4 | pass |
| 2a. Non-unital noise re-creates harmonics | kingston | 94 | 3 criteria | pass |
| 3. Rule at 9–17 qubits | kingston | 88 | T1–T4 | fail (relaxation offset) |
| 3b. Decoupling vs offset, 9–17 qubits | kingston | 88 | D0–D3 | pass at 17; miss at 9, 13 |
| Q1. Replication of 1 | fez, kingston | 188 | P1–P4 | fail (ill-conditioned criterion) |
| Q3. Rule on a 33/65-qubit chain | fez | 68 | C1–C3 | pass |
| Q4. Offset vs idle time | fez, marrakesh | 356 | O1–O3 | pass |
| Q5. Idle noise switched by design | kingston, fez, marrakesh | 308 | Z0–S1 | pass on 2; miss 0.001 on 1 |
| Q6. Ceiling saturation, | fez | 55 | S1–S3 | pass |
| Q7+8. 2-D rule and one-gate repair | fez | 115 | P1–P3 | pass |
| Q10. Hidden rule, standard template | fez | 80 | R1–R3 | pass |
Table 2. Pre-registered hardware experiments on selection rules and ceilings (IBM Heron, second open-plan key unless noted). QPU seconds as charged. The other sixteen runs of the programme are in [1].
Discussion
The common picture of “sources of quantum non-linearity” mixes up the function class with its coefficients. Ancillas, partial traces, measurements averaged over outcomes, reservoirs and noise all produce the same class of functions, and differ in which frequencies they leave and how much weight those frequencies can carry. Both properties follow from the circuit structure and can be computed in polynomial time for gate-level circuits, so a benchmark can report them before any training, as a “stage zero”. How much non-linearity a model can buy at all, and at what price in encodings and shots, is the subject of the main paper [1].
On hardware the selection rule doubles as a noise witness. A non-covariant channel, such as relaxation or a coherent phase on an ancilla, shows up as forbidden harmonics or as an offset that the noiseless circuit cannot produce, and dressing the idle channel with an echo, a twirl or a frame flip tells the mechanisms apart. The design rule behind our 65-qubit test, that every ancilla collects an even number of system CNOTs per layer, gives hardware-native circuits with a certified zero at any size.
These results have limits. The selection rules are proven for single uploads of or encodings and for the frame class. The checker is sound and complete for that class, but other symmetries exist; the reflection rule is one we found by examining the single failure of the path bound. The ceilings are tight over all channels rather than over a given ansatz, so they are upper envelopes, not predictions of trained performance, and on real data they predict well only when the structure is the binding constraint. Four of the eleven experiments missed at least one pre-registered criterion: a replication with an ill-conditioned criterion, the 9–17-qubit run because of a relaxation offset, its decoupled repeat at two of three sizes by at most 0.002, and one zero-delay criterion by 0.001 on one of three devices. All runs used IBM Heron processors.
Methods
Proof of Theorem 1. , so . Then , using that is real.
Proof of Theorem 2
with a Hermitian contraction, because is unital and positive. For every phase, by Hölder, with equality for the sign of that matrix. Any Hermitian contraction is for the two-outcome POVM on a dilation, so the bound is attained. For , has trace norm and is already of the required form.
Proof of the re-uploading ceiling
Track, for each encoding , which branch a path takes. Dilate the intermediate channels (Stinespring) and add a counter register that each encoding increments on its branch, a controlled increment that keeps the evolution an isometry; the final state is , with orthogonal components labelled by the number of branches, and . Only the first upload acts on , where each branch has probability ; later uploads act on arbitrary states. A component whose path takes at least plus-branches must have at least of them in the first layer, so the components with have total weight at most . Their partners in have plus-branches, hence at most in the first layer, and by symmetry of the first-layer branches their total weight obeys the same bound. Cauchy–Schwarz over the two sets of components, with , then gives :
for qubits re-uploaded times with any channels in between. For this is , the single-upload top ceiling, independent of : the frequencies near the top of a re-uploading spectrum stay exponentially small in the width of the first upload layer, however deep the model. The bound is tight at for every (the product readout without entanglers gives , whose top coefficient is ) and loose below the top (for it exceeds the exact ). Maximising over the parameters of data re-uploading circuits with , gave no violation in 24 cases.
Pauli-path support bound
Propagating the readout backwards and counting, for each Pauli string, the number of encodings it branched on gives a sound bound: over strings in that survive to . It ignores cancellations, needs no coefficients and runs as a dynamic program over distinct Pauli strings, unlike the path-enumeration trees used for exact coefficients [4, 5]. On the 144-circuit design census and the QNLEP registry on a grid of , the bound is sound in 204 of 204 circuits and exact in 203. The remaining case is the reflection rule above, so the two together explain every support we measured. With one branch counter per input variable the bound extends to several inputs; it reproduces the exact 2-D supports of all three models of the breadth test (33, 6 and 25 frequency pairs, including the per-variable parity rule). Its cost is set by the readout’s light cone, not by the circuit size. For data re-uploading with a CNOT chain it stays at 239 Pauli strings for from 4 to 32 qubits, but for scrambling layouts it grows as (about strings at ). The path bound is therefore a small-to-medium- tool; the frame checker is the one that scales.
The GF(2) frame checker and the census
For gate-level circuits (encodings , trainable rotations , Clifford gates, Pauli-string readout) we search for a frame , a Pauli string, with , that is carried through the circuit so that . The initial frame is for an unknown . Every later frame bit is an affine function of : Clifford conjugation is linear on the symplectic vector and an encoding multiplies the frame by a fixed Pauli. Every gate condition (the frame must commute, or for real rotations under anticommute, with the rotation generator) is one affine equation. A frame exists if and only if the linear system is consistent, which Gaussian elimination decides in word operations for gates and qubits. The observable sign is , where counts anticommuting factors of with the final frame and counts factors of (). If the solution space admits both signs, .
The procedure is complete for the frame class and sound. It agrees with exhaustive frame enumeration on 20,000 of 20,000 random circuits. Against exact simulation of 3,000 random circuits with encodings and random Pauli readouts, all 1,208 claimed rules hold with error at most , and all 540 circuits with both signs admissible are identically zero. The reflection rule is the same linear system with every encoding condition flipped (the frame must map to ); on the same 3,000 circuits its 896 claims hold with error at most . The checker decides the ancilla-tracing family at 1,025 qubits and 31,744 gates in 51 ms, where enumeration of frames is impossible; every claim up to 17 qubits matches exact simulation to .
Census. We ran the checker on 6,120 configurations: the 19 circuits of Sim et al. [13], six standard templates, a QCNN and three ancilla designs, with –6, –3, , or encodings, single or repeated upload, and four readouts, each compared with its exact spectrum. The time-reversal rule holds in 1,080 configurations (17.6%), all confirmed and none violated; in 942 of them . It is common in ancilla designs (44%) and in the BasicEntangler, StronglyEntangling, EfficientSU2 and RealAmplitudes templates (30% of template configurations), rare in the Sim et al. library (9%, non-trivially only in circuits 1, 2 and 10), and more frequent for single uploads (22%) than for repeated ones (14%). Every parity-restricted spectrum in the census has an identified cause: the time-reversal rule (1,080), the path parity of the Pauli-path bound (480), a path-bound zero (178) or the reflection (48). The reflection, the same linear system without the frame update at encodings, explains 126 of the 176 remaining cases in which only vanishes; 50 cases in two CZ/Hadamard-based families stay unexplained and mark the limit of the frame class. All three rule types pass the random-circuit validation (1,208, 896 and 906 claims, no violation).
Statistics
Numbers after are standard errors (shot noise for hardware values) unless stated otherwise. Zero counts are reported with the exact one-sided 95% upper bound on the underlying rate, : no forbidden rung fitted in 965 trials (), no forbidden 2-D target in 141 (), no violation of the frozen bound in 450 () and no impossible real-data fit in 450 (). Rank correlations carry bootstrap 95% intervals over cells or datasets: held-out Kendall [0.15, 0.68] (30 cells); first-feature real-data [−0.06, 0.24]; repair-gain Spearman 0.83 [0.03, 1.0], wide because it rests on six datasets. Per-dataset repair gains and surrogate deviations are bootstrapped over seeds. Hardware errors are shot-noise standard errors from the estimator or bootstraps over sites (65-qubit chain: contrast 14 [7] [23] at 33 qubits, 19 [9] [37] at 65 qubits). The relaxation-law time constants are [?, ?] (fez) and 156 [?, ?] (marrakesh).
Structure predicts the benchmark (details)
The QNLEP non-linear capacity (NLC) fits for and integrates the fit quality over [3]. We pre-registered the predictions below before each training run, using the benchmark’s own training recipe.
Forbidden rungs. On a grid of , and all six ansätze (72 cells, 5 seeds), no rung outside the support was ever fitted: 0 of 965 forbidden cases reached , and 88% of allowed rungs did. In two dimensions (three models, 24 targets , three seeds) all 141 forbidden targets failed and all 75 allowed targets were fitted. The ancilla-tracing model obeys a per-variable parity rule that we derived before computing: odd , even .
Ceiling-based bounds. Combining support and ceiling gives an upper bound on every rung’s . On the 72-cell data it was never exceeded: 0 violations in 1,800 trained values (a post-hoc test). We then froze the bound on a held-out grid of five operating points with up to 8 qubits and 6 layers, , before training it with three seeds. The bound held in all 450 trained values (Figure 2a), no forbidden rung was fitted (0 of 183), and the method with the largest bound was the measured leader in 4 of 5 operating points. The sharpest prediction concerned allowed but capped rungs: at the rung lies inside the support of the strongly entangling, QCNN and reservoir models, yet the ceiling allows ; training reached 0.01.
Ranking. As a ranking predictor of NLC, the structural bound reaches Kendall on the original grid and (95% CI 0.15–0.68) on the held-out grid, below the pre-registered threshold of 0.6. The interval excludes zero, but the bound does not rank methods: the quantum reservoir, which trains only its readout, sits far below its structural bound. Structure decides whether a frequency can be fitted and how well at best; how close training gets is a separate question.
One-gate repair. Adding one on the ancilla per layer breaks the antiunitary covariance without adding parameters. At (4, 4) the support grows from to , the fit goes from to 0.80, and NLC triples from 0.125 to 0.382. The price is trainability: the plateau indicator BPPI rises from 0.094 to 0.218.
Real data. On six real two-feature datasets (circles, moons, iris, breast cancer, wine, diabetes), with on two qubits and on two others, the ancilla-tracing model has only three Fourier components (odd , even ), and the one-gate repair adds the even- ones. We fitted each model’s Fourier support classically (ridge regression on the training split) and froze the resulting predictions before training any quantum model. The classical fit predicted the trained symmetric model’s test within 0.026 on all six datasets. The repair helped where the data need the forbidden components (circles +0.12, moons +0.17) and did nothing where they do not (iris, breast cancer, diabetes: ), with Spearman 0.83 (95% CI 0.03–1.0, six datasets) between predicted and measured gains. A second test on 20 tasks gave Spearman 0.72 (95% CI 0.38–0.92) but failed one hypothesis, because its frozen rule put two tasks where the repair was predicted to hurt, and did, into a no-effect bin. A third, on 20 further tasks with three data splits each and a sign-aware rule fixed in advance, passed every hypothesis: the predicted sign held in 19 of 19 cells where an effect was predicted, no effect appeared in 20 of 20 where none was, Spearman 0.75 (95% CI 0.55–0.89), and the support fit predicted the trained model within 0.15 in all 60 cells; all four pre-registered hypotheses passed (Figure 2b,Figure 2c). An earlier pre-registered test that fed only the first feature to every model, with the benchmark’s short training budget, found the structural bounds sound (0 impossible fits in 450 runs) but not predictive of the ranking (Kendall ): there, training rather than structure was the binding constraint. Structure predicts real-data performance when the structure binds.
Selection-rule hardware (details)
Every run was pre-registered with thresholds and a same-day noise prediction before submission (IBM Heron: ibm_marrakesh, ibm_kingston, ibm_fez; eleven experiments, 1,535 QPU seconds in total). We report the failures alongside the passes.
Five-qubit ancilla circuit (runs 1, 2a and Q1). For ancilla tracing with the constant term was and the even harmonic power sat at the shot-noise floor, while the control without symmetry showed ten times more. Idle time produced a positive offset that grew with the delay ( at , at , within and of the calibrated prediction), and a two-pulse echo removed it (). A single delay re-created forbidden harmonics 31 times their zero-delay level, which the echo suppressed twentyfold: noise can add frequencies the noiseless model provably lacks. A replication of the first run on two more devices failed its pre-registered zero-delay criterion. The criterion divided floor-level even power by the odd power of a parameter draw that had almost no signal. The absolute even power was at the floor on all three devices, and the experiments below use absolute criteria.
Idle-noise contrast on three devices (Q4 and Q5). With the same idles we dressed the idle channel four ways (Figure 4a). Plain idles break the rule (offset , , on kingston, fez, marrakesh). An echo or a balanced Pauli twirl, which make the idle channel unital and covariant, restore it (). Running the idle in the bit-flipped frame, –delay–, reverses the offset at the same size (, , ; ratios 0.88, 0.94, 0.88), which identifies the non-unital part as relaxation. On fez all four arms match the calibrated amplitude-damping model within 4%. Kingston revealed a second, coherent breaking channel: even harmonics 15 times the floor that survive the frame flip but not the echo or the twirl, as the theory predicts for a coherent phase on the ancilla. All criteria passed on kingston and fez; on marrakesh one zero-delay criterion missed by 0.001. The offset follows the relaxation law from 0 to (Figure 4b) with and on fez and marrakesh (within 0.65–0.80 of the calibrated value), and the frame flip reverses it at every dose.
Scale from 9 to 65 qubits (runs 3, 3b and Q3). The star-shaped ancilla circuit kept the forbidden oscillating harmonics at the noise level up to 17 qubits and 202 two-qubit gates, with a constant relaxation offset that dynamical decoupling of the idle windows removed by 61–93%. The star does not route on heavy-hex at larger sizes (depth 2,380 at 65 qubits). The frame argument, however, needs only that each ancilla collects an even number of system CNOTs per layer. A chain in which every ancilla receives one CNOT from each neighbour has the same rule for every length, with nearest-neighbour gates only. On ibm_fez at 33 and 65 qubits (depth 31 and 36, 96 and 192 CNOTs, all system readouts measured jointly) the even power per site was and , at the shot-noise floor, while the control with an on each ancilla showed 14 and 19 times more (95% CI 7–23 and 9–37), at 74–77% of the exact ideal (Figure 3a). The odd signal kept 95–120% of its ideal power. The device at this size cannot be simulated, but the rule fixes the answer, and nothing in the symmetric chain grew from 33 to 65 qubits.
Two-dimensional rule and its repair (Q7 and Q8). For the 2-D ancilla-tracing circuit of the real-data test, the forbidden even- components measured (three times the floor); the one-gate repair raised them to (81% of the prediction), while the even- rule, which the repair does not touch, held in both (Figure 3b,Figure 3c).
Hidden rule in a standard template (Q10). The census predicts that a one-layer StronglyEntanglingLayers model with a single upload expresses only odd frequencies at four qubits and only even ones at five, and that a second layer removes the rule. Nothing in the template’s definition suggests this. On ibm_fez the forbidden half of the spectrum stayed at 1.2–3 times the shot-noise floor for the one-layer circuits, while the two-layer controls showed it 97 and 147 times higher, at 81–83% of the exact prediction (all criteria passed). Hidden selection rules are a property of ordinary circuits, and they survive hardware noise.
Ceiling saturation (Q6). A three-qubit entangled circuit whose parameters maximise of a single-qubit readout reached 0.110 ± 0.004 on ibm_fez, 88% of the ceiling ; the product readout gave 0.127 ± 0.004; no arm exceeded the ceiling beyond noise (Figure 1b).
Pre-registration and all hardware experiments
Each experiment was frozen in a dated note with thresholds, a pass rule and its interpretation fixed in advance, and committed with the same-day prediction from the device’s calibrated Aer noise model before submission. For runs 1, 2a and 3 (September 2026) the notes and prediction files were written before the jobs (the prediction files carry creation times minutes before each job) but entered version control only the following morning. From run 3b onward every pre-registration and prediction was committed before the job, and no criterion was changed after a job was submitted. Of the 11 runs, 7 passed every gating criterion (Table 2). Runs 1–3b used the first open-plan key.
Simulation. Statevector and density-matrix simulation in NumPy and PennyLane 0.44. Spectra from FFTs over equispaced points, averaged over random parameter draws; a frequency is in the support if its mean power exceeds .
Training. The training recipe of the QNLEP non-linear-capacity stage [3]: 36 training points on , Adam with learning rate 0.1, initialisation , 50 steps (100 for ancilla re-uploading, 120 for the reservoir), on 120 evaluation points; seeds as stated.
Hardware. EstimatorV2 with TREX, gate twirling and automatic dynamical decoupling off unless stated; 10 points so that is on the grid; even part . Thresholds, job identifiers, QPU seconds and raw data are in the repository. The 65-qubit chain was laid along a simple path of the coupling graph, so no routing was needed; its exact ideal follows from simulating the 17-qubit backward light cone of each readout. Parameters were pre-selected for signal by a rule fixed in advance (the first seeds whose ideal odd power exceeds a threshold).
Real data. Two features per dataset, min-max scaled to on the training split, targets standardised; 200 Adam steps (rate 0.05) with a trainable output scale, five seeds; the structural prediction is a ridge fit () on the model’s exact 2-D Fourier support.
Data availability
The pre-registrations, same-day predictions, raw hardware results with job identifiers, and all simulation and training outputs that support the findings of this study are available at https://drive.google.com/file/d/1neEtKzv4DIVoviXKuBWrHzt1PW4j-ham/view?usp=sharing.
Code availability
The code for every simulation, census, training run and hardware experiment is available at https://drive.google.com/file/d/1neEtKzv4DIVoviXKuBWrHzt1PW4j-ham/view?usp=sharing. A single command re-scores every hardware experiment reported here against its pre-registered criteria from the stored results, regenerates the figures and builds this manuscript; a full run also repeats the simulations and the training. The repository’s documentation describes both.
Acknowledgements
We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors, and do not reflect the official policy or position of IBM or the IBM Quantum team. This work was partially funded by the Institute of Computer Science at Zurich University of Applied Sciences through the project № 79838 “QML – Quantum Machine Learning” [14].
References
- [1]Sulimov, P. & Lehmann, C. Quantum models pay for non-linearity in data encodings. arXiv preprint (2026).DOI
- [2]Schuld, M., Sweke, R. & Meyer, J. J. Effect of data encoding on the expressive power of variational quantum-machine-learning models. Phys. Rev. A 103, 032430 (2021).DOI
- [3]Sulimov, P. & Lehmann, C. A reproducible evaluation protocol for quantum non-linearity in variational quantum models. In Advances in Neural Information Processing Systems 39 (NeurIPS, 2026).
- [4]Nemkov, N. A., Kiktenko, E. O. & Fedorov, A. K. Fourier expansion in variational quantum algorithms. Phys. Rev. A 108, 032406 (2023).DOI
- [5]Wiedmann, M., Periyasamy, M. & Scherer, D. D. Fourier analysis of variational quantum circuits for supervised learning. In Proc. IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, 2025); preprint at https://arxiv.org/abs/2411.03450.
- [6]Holzer, P. & Turkalj, I. Spectral invariance and maximality properties of the frequency spectrum of quantum neural networks. Quantum Mach. Intell. 8, 33 (2026).
- [7]Mhiri, H. et al. Constrained and vanishing expressivity of quantum Fourier models. Quantum 9, 1847 (2025).DOI
- [8]Barthe, A. & Pérez-Salinas, A. Gradients and frequency profiles of quantum re-uploading models. Quantum 8, 1523 (2024).DOI
- [9]Larocca, M. et al. Group-invariant quantum machine learning. PRX Quantum 3, 030341 (2022).DOI
- [10]Meyer, J. J. et al. Exploiting symmetry in variational quantum machine learning. PRX Quantum 4, 010328 (2023).DOI
- [11]Fontana, E., Runggner, I., Duncan, R. & Cîrsto̧iu, C. Spectral analysis for noise diagnostics and filter-based digital error mitigation. Preprint at https://arxiv.org/abs/2206.08811 (2022).
- [12]Franz, M. et al. Out of tune: demystifying noise-effects on quantum Fourier models. Preprint at https://arxiv.org/abs/2506.09527 (2025).
- [13]Sim, S., Johnson, P. D. & Aspuru-Guzik, A. Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms. Adv. Quantum Technol. 2, 1900070 (2019).DOI
- [14]Zurich University of Applied Sciences (ZHAW), Institute of Computer Science. QML – Quantum Machine Learning. Research project, https://www.zhaw.ch/en/research/project/79838 (2026).



