The Parity-Entanglement Bound (PEB) and its Zn / non-abelian extensions fix the clock-system mutual information I(C;S) of a symmetry-constrained pure state to an absolute, calculable value: 2.000 bits for a uniform Z2 constraint, 2 log2(n) for Zn, and representation-dependent values (e.g., 3.84 bits for S3). These invariants are independent of qubit number, clock size, clock position, and physical platform. Here we convert these mathematical results into a platform-agnostic, rank-agnostic benchmarking protocol for quantum processors. A single experimental run provides three-axis error diagnosis - passive decoherence, active gate noise, and logical survivability - all referenced to the absolute invariant, without any external baseline or classical simulation. The same protocol also enables lightweight entanglement certification in quantum networks (single-qubit, two-basis measurement). The method is demonstrated on IBM Kingston hardware for N = 2-5 qubits; all measured values lie within 0.15 sigma of the target, and a Schmidt-balance sweep follows the theoretical curve with R^2 = 0.998. The PEB thus supplies a universal ruler for calibration, error diagnosis, and cross-platform comparison - a tool that assists quantum computation without being a fault-tolerance code.
The Parity-Entanglement Bound (PEB) and its Zn / non-abelian extensions fix the clock-system mutual information I(C;S) of a symmetry-constrained pure state to an absolute, calculable value: 2.000 bits for a uniform Z2 constraint, 2 log2(n) for Zn, and representation-dependent values (e.g., 3.84 bits for S3). These invariants are independent of qubit number, clock size, clock position, and physical platform. Here we convert these mathematical results into a platform-agnostic, rank-agnostic benchmarking protocol for quantum processors. A single experimental run provides three-axis error diagnosis - passive decoherence, active gate noise, and logical survivability - all referenced to the absolute invariant, without any external baseline or classical simulation. The same protocol also enables lightweight entanglement certification in quantum networks (single-qubit, two-basis measurement). The method is demonstrated on IBM Kingston hardware for N = 2-5 qubits; all measured values lie within 0.15 sigma of the target, and a Schmidt-balance sweep follows the theoretical curve with R^2 = 0.998. The PEB thus supplies a universal ruler for calibration, error diagnosis, and cross-platform comparison - a tool that assists quantum computation without being a fault-tolerance code.
We prove that any bipartite pure state satisfying a Z2 parity constraint (PC ⊗PS)|Ψ⟩ = +|Ψ⟩ with both sectors populated carries mutual information I(C; S) ≤ 2 bits, with equality if and only if the two Schmidt coefficients are equal (Parity-Entanglement Bound, PEB). Within the Page–Wootters relational-time framework, the PEB implies that the clock–system mutual information is at most 2 bits, achieving exactly 2 bits for the maximum-entropy ground state, independently of system size N and bipartition choice (clock-independence). We further prove that among the uniform ground states of cyclic Zn constraints, Z2 uniquely minimises I(C; S) subject to I(C; S) > 0. N-independence andbclock-independence are verified on IBM Kingston quantum hardware for N = 2, 3, 4, 5 qubits and all clock-qubit positions at N = 4, with all deviations below 0.15σ from the predicted 2 bits. The PEB answers why Moreva et al.’s photon experiment [2] measured I ≈ 2 bits: this is not a feature of their setup but a consequence of the underlying Z2 constraint.
The Parity–Entanglement Bound (PEB) fixes a ceiling: any ℤ₂-constrained bipartite pure state with both sectors populated carries I(C;S) ≤ 2 bits. Whether the 2-bit value is also a floor — a genuine quantum of information — has remained implicit in the program's language. Here we settle it, by proof and by hardware, in both directions at once. There is no unconditional floor: I takes every value in (0,2] on the constrained family, and we measure states down to I = 0.394 bits. There are, however, exactly two conditional floors, each activated by a different operational requirement. Floor I (locality): every local k=1 autoencoder of the balanced state has reconstruction fidelity exactly 1/4 — a flat floor, proved in three lines and measured flat at 0.250 ± 0.009 across five distinct local encoders on ibm_fez, while a single cut-crossing gate restores the device ceiling (0.973 vs. the k=2 control's 0.975: global compression is free). Floor II (clock function): the rank-2 rigidity bound I ≥ 2 − 2log₂(1+ε), with ε the tick overlap, holds at every point of a measured Schmidt sweep (8/8, forbidden region empty), with the two independently measured curves I = 2h(b) and ε = |2b−1| tracking theory to ≤ 0.03 bits and ≤ 0.007 respectively. The two floors meet the PEB ceiling at a single point: ε = 0 ⇔ b = 1/2 ⇔ I = 2. The 2-bit quantum is therefore not the floor of the constraint but the pinch of the unconditional ceiling with the conditional floors — information below 2 bits is always paid for, exactly, in tick overlap, and the shared bits can be globally compressed for free but locally not at all. Statements are labelled [P] proved, [K] known, [N] measured.
The Parity–Entanglement Bound (PEB) established that a Z2 parity constraint in the Page–Wootters framework forces the clock–system mutual information to I(C; S) = 2 bits. We extendthat result. Placing the PEB in the stabilizer formalism and examining the Schmidt structuredirectly, we show that the 2-bit value rests on a rank-2 (uniform) condition, not on the constraintalone, and that it is invariant under in-plane extension and under Z2 concatenation across scales.We prove a Zn bound, I(C; S) ≤ 2 log2 n, saturated by the uniform ground state independentlyof the system size, the clock size, and the clock position; and we compute the non-abelian value,finding for S3 a relational information of ≈ 3.84 bits, strictly below the abelian value 2 log2 6. Werecover the Z2 topological entanglement entropy γ = log2 2 from the minimal toric code. The resultsform a discrete-symmetry analogue—distinct from Noether’s theorem—in which a symmetry fixesa definite relational information. This work extends, and does not supersede, the original Z2 PEB.
The parity–entanglement bound (PEB) fixes the relational information of a Zₙ-constrained uniform state at I(A:B) = 2 log₂ n bits for every bipartition and every system size. The topological entanglement entropy of a Zₙ gauge theory is γ = log n, likewise independent of the size and shape of the region. We show that these are one constant: I_PEB = 2γ, exactly, for every n, and that the agreement is not numerology but the same superselection structure read twice — the cut crosses n charge sectors, and both quantities are the logarithm of that count. Extending to a finite group G, the programme's decomposition gives I = 2 log₂|G| − ΔI_NC with ΔI_NC = 2 Σ_ρ P_ρ log₂ d_ρ, so the non-abelian censorship of the programme is exactly the shortfall of the bound below 2γ, and it vanishes precisely on the abelian groups. Both statements are verified exactly, by singular values for n = 2–5 at every cut and size and by representation theory for nine groups [N]. Both sides are then measured on IBM Heron processors, with nothing fitted [N]. Abelian: nine independent cuts across three sizes give a weighted mean of 1.999 bits with a spread of 0.004 bits, encoded Z₃ and Z₄ registers give 3.199 and 3.978 bits against 3.170 and 4.000, and the reading is unchanged at 27 qubits and depth 107. Non-abelian: on the S₃-constrained state the two informations are read from one tomography and differ by 1.329 ± 0.016 bits against the predicted ΔI_NC = 1.3333, a 0.3σ agreement and 83σ from zero, while the same analysis on an abelian control returns −0.008 ± 0.004; the censored value agrees with the one prepared by a different route on a third processor in earlier work. The practical content is that the programme's two-bit constant is a quantity other fields have already realised, without reference to this programme, as topological order on three platforms and as a dense-coding capacity on a fourth [K]; what is new is that one constant, read three ways across seven platforms, agrees throughout, and that the censorship term acquires a standard identity as the edge-mode contribution. Statements are labelled [P] proved, [K] known, [N] numerical or measured.
Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs. Many teams are pursuing distinct and difficult-to-compare routes to this goal, using different qubit technologies and logical architectures. Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems and enable fair comparison across disparate platforms. Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them. We apply this quantum universal operation performance system (QUOPS) experimentally to leading processors from Quantinuum, Google, and IBM, computing directly on physical qubits. Translating state-of-the-art resource requirements for recognized challenge problems that represent useful quantum computation into effective QUOPS circuit sizes shows that computational capability must grow by 5 orders of magnitude, motivating fault-tolerant approaches. We use the same benchmark to assess the performance of a simple fault-tolerant logical-qubit processor implemented on up to eight [[7,1,3]]-encoded logical qubits using Quantinuum Helios-1, and project the growth of capability across successive generations of fault-tolerant quantum computers to show how QUOPS can track progress toward quantum scientific utility.
In the Page–Wootters relational-time framework a ℤ₂ parity constraint (P_C ⊗ P_S)|Ψ⟩ = +|Ψ⟩ ties a clock C to a system S. We show that the constraint controls one specific term of the entanglement entropy — the sector (charge) entropy — which obeys H({p_e, p_o}) ≤ 1 bit with equality iff the two parity sectors are equally weighted, for every system size N, every clock size k, and every state in the constrained subspace. The familiar value I(C;S) = 2 bits is recovered exactly when the complementary configurational term vanishes, i.e. on the rank-2 family, to which the uniform ℤ₂ ground state belongs; there I = 2 bits independently of N, of k and of which qubits form the clock. We further prove an exact complementarity V² + P² = 1 between the clock–system fringe visibility and the sector predictability. On IBM quantum hardware we measure the quantity the theory actually predicts: the weight of the reduced clock state inside the rank-2 subspace. For an 8-dimensional (k = 3) clock register at N = 5 we find 0.920, against 0.250 expected if the register carried the naive 2k = 6 bits; the two surviving eigenvalues are 0.445 and 0.475. A depolarisation parameter calibrated from an independent stabilizer fidelity witness returns I = 1.998, 1.999, 1.997 bits for k = 1, 2, 3. A separable control state is included: a single-basis clock-marginal estimator returns 1.9991 bits on it, while the tomographic estimator used here returns 0.835 bits and V² + P² = 0.0005, so the protocol separates the constrained state from a classical mixture.