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

The Arity–Resonance Ceiling: Why Pauli Contextuality Stops at $H^3$

Zhou-Li Chen

Published Jun 1, 2026• 0 citations
Publisher
DOI
10.5281/zenodo.20685777

Related papers

Pauli Gadget Synthesis for Gatesets with Arbitrary Even Arity Clifford Gates

Leo Becker, Arianne Meijer-van de Griend

We propose an algorithm that can synthesize circuits to gate sets consisting of a 2n-arity Clifford gate and arbitrary single qubit rotations.To do this, we represent the circuit as a sequence of Pauli gadgets and jointly synthesize them by placing the multi-qubit Clifford in the synthesized circuit and pushing its adjoint through the remaining gadgets such that some qubits are disconnected from some gadgets.The pushed gadgets are collected in a Clifford tableau, which is decomposed afterwards.With the help of our algorithm we run experiments where we synthesize circuits to varying sizes of target multi-qubit gates.These experiments indicate that increases in gate size can lead to smaller output circuits, and that different connectivity constraints have meaningful differences in how higher arity gates effect the circuit sized.

arXiv:2611.06139•Electronic Proceedings in Theoretical Computer Science•Nov 2, 2026•0 citations

On the Possibility of Pauli Principle Violation in Atoms

Lev B. Okun

ZhPmR•Jan 1, 1987•90 citations

Unitarity of pauli transformations

Ludwig Streit

Nuovo cimento della Società italiana di fisica. A, Nuclei, particles and fields•Sep 1, 1968•0 citations

The n/ Program: Forced Quantization, Bohrification, and the Contextuality Ceiling

Zhou-Li Chen

•Jun 1, 2026•0 citations

A repair price for contextuality, and its identity with Min-Rep

Seth Douglas

The repair price of a contextuality scenario is the minimum number of elementary outcome merges whose simultaneous application restores a global section. On binary scenarios it is an affine reparametrisation of the optimum of Min-Rep / LABEL-COVER_min: pi(e) = MinRep(e) - |Q| for Q the site set. The minimisation is therefore twenty-five years old and is not claimed as new; the contribution is the transfer and what it buys in both directions - an additive hardness of approximation for the repair price, and for the hardness-of-approximation quantity a reading as a physical repair cost that vanishes exactly on the non-contextual scenarios. The identity does not survive past binary arity: at arity three the two quantities can separate (pi = 3 against MinRep_gen - |Q| = 1 on an explicit witness), while equality persists on others including Mermin and GHZ, so strictness is exhibited and not generic. Also given: a monotone integer ledger along scenario growth, an incidence law at the price floor stated as a bounded exhaustion with its converse killed by a shipped witness, a measured separation from contextuality degree (flat where the repair price grades, and undefined on scenarios where the repair price is still defined), a complement to Arkhipov's arrangement theorem in the regime his theorem leaves open (stated as a conjecture), and an exact statement of the domain on which the repair price is identically zero. Two stdlib-only verification engines reproduce every recomputable number on three cross-asserted routes, and the complete pre-release review record - two blind refutation-first referee rounds, the repair log, and the residual confirmation - ships with the paper.

•Aug 10, 2026•0 citations

An axiomatic deduction of the pauli spinor theory

H. M. Schwartz

International Journal of Theoretical Physics•Apr 1, 1977•2 citations
The Arity–Resonance Ceiling: Why Pauli Contextuality Stops at H3H^3H3
We propose an algorithm that can synthesize circuits to gate sets consisting of a 2n-arity Clifford gate and arbitrary single qubit rotations.To do this, we represent the circuit as a sequence of Pauli gadgets and jointly synthesize them by placing the multi-qubit Clifford in the synthesized circuit and pushing its adjoint through the remaining gadgets such that some qubits are disconnected from some gadgets.The pushed gadgets are collected in a Clifford tableau, which is decomposed afterwards.With the help of our algorithm we run experiments where we synthesize circuits to varying sizes of target multi-qubit gates.These experiments indicate that increases in gate size can lead to smaller output circuits, and that different connectivity constraints have meaningful differences in how higher arity gates effect the circuit sized.
The repair price of a contextuality scenario is the minimum number of elementary outcome merges whose simultaneous application restores a global section. On binary scenarios it is an affine reparametrisation of the optimum of Min-Rep / LABEL-COVER_min: pi(e) = MinRep(e) - |Q| for Q the site set. The minimisation is therefore twenty-five years old and is not claimed as new; the contribution is the transfer and what it buys in both directions - an additive hardness of approximation for the repair price, and for the hardness-of-approximation quantity a reading as a physical repair cost that vanishes exactly on the non-contextual scenarios. The identity does not survive past binary arity: at arity three the two quantities can separate (pi = 3 against MinRep_gen - |Q| = 1 on an explicit witness), while equality persists on others including Mermin and GHZ, so strictness is exhibited and not generic. Also given: a monotone integer ledger along scenario growth, an incidence law at the price floor stated as a bounded exhaustion with its converse killed by a shipped witness, a measured separation from contextuality degree (flat where the repair price grades, and undefined on scenarios where the repair price is still defined), a complement to Arkhipov's arrangement theorem in the regime his theorem leaves open (stated as a conjecture), and an exact statement of the domain on which the repair price is identically zero. Two stdlib-only verification engines reproduce every recomputable number on three cross-asserted routes, and the complete pre-release review record - two blind refutation-first referee rounds, the repair log, and the residual confirmation - ships with the paper.