WorksPhysics and Astronomy
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Abstract
Resource analyses for quantum programs commonly provide safe upper bounds on qubits, gates, or non-Clifford operations. We study a single-qubit dyadic fragment in which the deepest exact resource layer can instead be inferred exactly. Starting from the normalized-midpoint misty-state syntax, we define dyadic program states and the real cyclotomic tower . For the projective single-qubit Clifford-cyclotomic tower , we prove the relative intersection law for . Combining this descent theorem with an arithmetic-closure invariant for adaptive stabilizer processing yields : the smallest real cyclotomic field containing the Bloch matrix of an exactly synthesizable channel, the shallowest dyadic gate alphabet realizing it up to global phase, and the shallowest dyadic program-state layer sufficient for exact stabilizer-assisted implementation coincide. At that common minimum, known fixed-alphabet synthesis gives minimum primitive-rotation count. We package the result as an exact static resource effect and outline a certificate-producing compiler.
Introduction
Fault-tolerant quantum programming uses two descriptions of non-Clifford computation that are usually studied separately. In one description a program is a circuit over a gate alphabet, such as Clifford+ or a finer Clifford-cyclotomic alphabet. In the other, non-Clifford gates are supplied by consumable quantum states and measurement-based injection. The first viewpoint leads naturally to exact synthesis; the second to magic-state resource theories. A programming language that exposes both views should ideally assign a resource effect that is simultaneously a static property of source syntax, a lower bound on physical resources, and an exact predictor of the smallest gate alphabet required by the compiled program.
Projective convention. All compilation and resource claims in this paper concern quantum channels, so global phase is physically irrelevant. Accordingly, gate-alphabet depth is defined through the Bloch image in (equivalently in ), not through literal membership of a particular phase representative in . This convention is essential in the relative-descent argument below and matches the phase-insensitive cost convention of exact single-qubit synthesis.
The starting point here is the mist-state rewriting formalism developed in [1, 2]. Its certified version separates raw amplitude collection from normalization, gives a canonical amplitude normal form, and proves that nested equal-weight normalized mists generate dyadic geodesic barycenters [2]. In particular, the nested state at angle is the positive Hadamard eigenstate. Rather than treating this state as an isolated fixed point, we use the dyadic-geodesic theorem as a source language for program states.
The paper then leaves the pedagogical setting. The target is the exact single-qubit dyadic Clifford-cyclotomic union. Forest, Gosset, Kliuchnikov and McKinnon proved a unique canonical form and an optimal exact synthesis algorithm for every fixed Clifford-cyclotomic alphabet [3]. Their denominator-exponent theorem contains enough arithmetic information to answer a different question: given a unitary known to lie somewhere in the nested dyadic tower, what is the smallest alphabet in which it can live? We prove that this minimum is determined exactly by the smallest real cyclotomic field containing the Bloch matrix.
The second ingredient is operational. Beverland, Campbell, Howard and Kliuchnikov established powerful non-Clifford lower bounds using stabilizer nullity and a dyadic monotone, including adaptive stabilizer computations [6]. We use a complementary invariant: not a scalar amount of magic, but the number field generated by Pauli expectation values. Stabilizer processing is arithmetically closed over that field. This produces an exact field-reachability obstruction that is insensitive to how many shallower resource states are supplied.
Main result. For let
with and with unitaries identified up to global phase through their Bloch representations. For a non-Clifford channel with , define
and let be the minimum possible maximum depth of dyadic program states in any finite adaptive stabilizer protocol implementing exactly. We prove
This equality remains meaningful for programs outside every finite level of the Clifford hierarchy: gate-hierarchy membership is not compositional above the Clifford group, whereas the arithmetic resource depth remains finite and exact.
At the common minimum , the canonical synthesis of [3] minimizes the number of primitive rotations. Hence
is a lexicographically optimal resource signature: first it minimizes the deepest dyadic resource layer, then it minimizes primitive-rotation count within that layer.

Figure 1. The proof architecture. The source language supplies dyadic program states; arithmetic closure gives an operational lower bound; relative cyclotomic descent identifies that lower bound with the smallest exact gate alphabet.
Relation to prior work. Magic-state injection and small-angle resource states are established tools [4, 5]. Complete one-qubit Clifford-hierarchy structure is now known [7], and dyadic quantum fragments have complete rewriting systems in other formalisms [8]. Quantum type systems already reason about Clifford structure, gates and selected injection circuits [9], while resource-aware languages infer quantitative upper bounds such as circuit width [10]. The contribution here is narrower: an exact equality between arithmetic field depth, minimum dyadic gate-alphabet depth and minimum dyadic program-state depth, together with an exact static resource effect that remains meaningful beyond the finite Clifford hierarchy. Earlier rotation-group structure goes back to Radin–Sadun, and later arithmetic-group work studies the ambient Clifford-cyclotomic groups; recent multiqubit synthesis results show that ancillas can change ambient ring-synthesis questions. Our theorem is instead a relative single-qubit descent statement inside the nested dyadic tower.
Dyadic mist states as program states
We first isolate the fragment of mist-state semantics needed later. Let
For equal-norm real states on the shorter arc, normalized addition is the geodesic midpoint [2]:
Definition 2.1 (Normalized-midpoint depth). A normalized-midpoint term is generated from endpoint leaves and the binary constructor . Its denotation is the dyadic coordinate obtained from by repeated averaging. The minimum depth of any term denoting is denoted .
Theorem 2.2 (Exact dyadic depth). Let be in lowest dyadic form, so is odd. Then
Proof. By induction, every midpoint tree of maximum depth evaluates to a rational whose reduced denominator divides . Hence cannot occur below depth . Conversely, use a complete binary tree with leaves, label exactly leaves by 1 and the remainder by 0, and average level by level. The root evaluates to .
The relevant source state is therefore
For this is the positive Hadamard eigenstate highlighted in [1, 2].
Uniform state–gate conversion
Define the standard phase-program state
A single fixed Clifford relates the two encodings.
Lemma 2.3 (Uniform Clifford equivalence). For every real ,
In particular, with , is Clifford-equivalent to .
Proof. Expand and use and . The phase gate removes the factor from the second component.
The standard one-bit injection circuit then makes the program-state interpretation operational. For , use the data qubit as control of a CNOT whose target is , then measure the ancilla in the computational basis. The two unnormalized data branches are
Thus the second branch is corrected by . This doubled-angle feed-forward is the familiar small-angle magic-state cascade [4].
For the primitive dyadic phase , doubling removes the first binary digit:
Since is Clifford,
Hence a failed injection consumes one bit of the canonical dyadic source word while emitting only a free Pauli correction. The worst-case number of non-Clifford injection stages is , whereas the expected number is
We use this axial compiler later only for the upper-bound direction of the resource theorem; the main arithmetic result applies to arbitrary multiaxis words in the dyadic Clifford-cyclotomic group.
Arithmetic closure of stabilizer protocols
We next give the operational lower-bound mechanism. The invariant is field-valued rather than a scalar magic monotone.
For an -qubit state and Pauli , write
For a finite resource family define
Theorem 3.1 (Stabilizer arithmetic closure). Consider any finite adaptive protocol generated by Clifford unitaries, stabilizer ancillas, Pauli measurements, deterministic classical feed-forward and discarding, with nonfree input resources . No external operation carrying additional real or algebraic parameters is supplied for free. For every measurement history , every Pauli coordinate of the unnormalized branch lies in . If , then every Pauli coordinate of the normalized branch lies in .
Proof. The claim is preserved by each primitive operation. Clifford conjugation sends a Pauli to another Pauli and therefore only permutes and signs coordinates. Stabilizer ancillas have Pauli expectations in . Tensor products multiply Pauli coordinates. If is the measured Pauli and , then for any Pauli ,
up to the harmless Pauli sign in the commuting product. Thus branch coordinates are dyadic-rational linear combinations of previous coordinates. Partial trace selects the coordinates with identity on the discarded subsystem. Induction over a branch proves the ring statement. Normalization divides all coordinates by , itself a branch coordinate in , and therefore stays in the fraction field. □
The same statement applies to exact channels.
Corollary 3.2 (Channel field obstruction). Let an adaptive stabilizer protocol with resources implement a deterministic channel . Every entry of the Pauli transfer matrix of lies in . For a heralded exact implementation whose nonzero success probability is independent of the input, the normalized success channel has Pauli transfer entries in .
Proof. Apply the protocol to one half of the normalized maximally entangled stabilizer state . By Theorem 3.1, the Choi state has Pauli coordinates in the stated ring or field. With ,
so each Pauli-transfer entry is itself one of these Pauli coordinates up to the conventional Pauli transpose sign. □
This result is complementary to scalar resource monotones such as stabilizer extent, nullity and the dyadic monotone of [6]. It does not count copies. Instead, it states that a finite stabilizer protocol cannot adjoin a number absent from the field generated by its supplied resources.
The dyadic Clifford-cyclotomic tower
Let be the single-qubit Clifford group. Following [3], define

Figure 2. The nested gate and field towers. The relative intersection theorem proved below says that, inside the dyadic synthesizable union, descending the arithmetic field is exactly the same as descending the gate alphabet.
Since is Clifford, . Modulo global phase, the Bloch representation maps these groups into ; we write for the image. The projective groups form a strict tower
with strictness following, for example, from the fixed-axis rotation characterization in the canonical synthesis theory.
The associated real cyclotomic fields are
with . They form a quadratic tower
with
The ring of integers of is ; this is the standard maximal-real-subfield description for power-of-two cyclotomic fields [16].
Imported fixed-alphabet structure
For , Forest et al. [3] give a unique canonical form for every and an optimal synthesis algorithm [3]. In the Bloch representation a non-Clifford element has a canonical decomposition
where , adjacent axes differ, , and is Clifford. Let
This is the specialization of Eq. (23) in [3] to .
If , their denominator-exponent theorem states that the largest -denominator exponent appearing in is , while the unique exceptional row has largest exponent . Their Corollary 4.2 proves uniqueness of the canonical form and minimum primitive-rotation cost at the fixed alphabet. We use these results as imported ingredients; the new step is relative descent between consecutive dyadic alphabets.
Cyclotomic parity and relative descent
The key arithmetic observation is that an element of the shallower field cannot have an odd reduced denominator exponent in the deeper generator. We use the standard facts that , that is quadratic, and that its nontrivial automorphism sends .
Lemma 5.1 (Even-denominator lemma). Let . Suppose can be written
where is not divisible by . Then is even.
Proof. The nontrivial element satisfies . Since is fixed by ,
If were odd, then . Let and write the unique integral power-basis expression
Applying and comparing coefficients shows that all even-power coefficients vanish. Hence for some , contradicting the reduced-denominator assumption.
Remark 5.2. The lemma also has a valuation proof. The unique prime above is totally ramified along the power-of-two real cyclotomic tower; the valuation of an element from doubles upon extension to . The Galois proof above is shorter and keeps the argument self-contained once the integral power basis is fixed.
Theorem 5.3 (One-step relative intersection). For every ,
Proof. The inclusion is immediate. For the reverse inclusion, let have all entries in and take its Forest canonical form (12). If is Clifford there is nothing to prove. Otherwise let . By the denominator-exponent theorem of [3], some entry has reduced -denominator exponent , and an entry in the exceptional row has reduced exponent . Both entries lie in , so Theorem 5.1 forces both exponents to be even. Therefore is even.
Write with odd. By (13), . Since , , and is even if and only if . Thus is even. The first syllable is therefore already a shallower rotation:
Multiply its inverse into . Because the removed factor itself has entries in , the remaining suffix still has entries in ; because the original Forest word was canonical, that suffix is again a canonical word at level . Induction on the number of non-Clifford syllables therefore forces every to be even. Hence every non-Clifford syllable belongs to , as does the final Clifford, so .
The statement is deliberately relative. Forest et al. show that for most even , the Clifford-cyclotomic group is strictly smaller than the ambient group of all ring-valued unitaries [3]. We do not assert that field membership alone characterizes arbitrary matrices. Rather, Theorem 5.4 states that within the already-synthesizable dyadic union, a fall in field depth is exactly a fall in gate-alphabet depth.
Field depth, alphabet depth and resource depth
We can now state the principal theorem precisely.
Definition 6.1 (Field and alphabet depth). For a projective unitary with , define
Both quantities depend only on the channel .
Theorem 6.2 (Arithmetic alphabet theorem). For every ,
Proof. Every generator of has entries in , so . Let and . If , then . By Theorem 5.4, , contradicting the minimality of the projective alphabet depth .
Dyadic program-state resource depth
For , let denote the set of one-qubit dyadic program states of (2) with odd, together with their Clifford images. Their Pauli coordinates generate exactly : indeed
and for odd these values are Galois conjugates of the primitive real cyclotomic generators.
Definition 6.3 (Dyadic program-state resource depth). For a non-Clifford channel with , let be the least for which there exists a finite adaptive stabilizer protocol that implements exactly using an arbitrary finite number of resource states from . Stabilizer ancillas, adaptive Pauli measurement, classical feed-forward, discarding, and catalytic use of states from the same declared resource family are allowed.
Theorem 6.4 (Exact resource-depth theorem). For every non-Clifford channel with ,
Proof. Set by Theorem 6.2. For the lower bound, suppose had an exact stabilizer implementation whose every dyadic resource state had depth at most . All resource Pauli coordinates would then lie in , and because the fields are nested, the field generated by any finite collection of them is still contained in . By Theorem 3.2, every Pauli-transfer entry of the implemented channel would lie in . The Pauli transfer matrix of a unitary channel is its Bloch rotation, contradicting the definition of . Thus .
For the upper bound, has a finite exact decomposition, up to global phase, into Clifford gates and primitive rotations. By Theorem 2.3 each primitive rotation has a Clifford-equivalent dyadic program state of depth . The injection rule (3)–(4) implements the rotation exactly; every failed branch requests only a doubled-angle correction, hence a strictly shallower dyadic layer until the correction is Clifford. Therefore depth resources suffice, and .
This theorem should not be confused with a statement that resource count equals arithmetic depth. The count is a separate optimization problem. The theorem identifies the deepest algebraic layer that must appear somewhere in an exact implementation.
Exact resource effects and optimal compilation
At a fixed alphabet , Forest et al. define as the minimum number of primitive gates required to implement up to global phase and prove that their canonical decomposition attains this minimum [3]. Combining their fixed-level theorem with Theorem 6.4 yields a two-component exact resource signature. We call it a resource effect rather than a full type system: the present paper does not supply general typing rules for an arbitrary higher-order quantum language.
Definition 7.1 (Exact dyadic resource effect). For non-Clifford , let
and define
Theorem 7.2 (Lexicographic optimality). Order exact dyadic gate implementations first by alphabet depth and then by primitive-rotation count . The pair is the unique lexicographic optimum: no exact implementation exists with depth , and among depth- implementations none uses fewer than primitive rotations.
Proof. The first claim is the definition of Adepth together with Theorem 6.4. The second is the fixed-alphabet optimality theorem of [3] applied at .
The result gives a static effect analysis familiar from resource-aware programming languages, but with a stronger guarantee than an upper bound: the first component is an exact operational minimum, not merely a conservative estimate. This complements quantum type systems that track stabilizer structure, gates and injection patterns [9], and resource type-and-effect systems that infer quantitative circuit bounds [10].
Exact field-depth analysis
Suppose a source circuit gives an a priori alphabet bound , so its exact Bloch matrix lies in . Field depth can then be computed by fixed-field descent rather than by searching gate alphabets. Starting from , apply the nontrivial involution with entrywise. If every Bloch entry is fixed, then the matrix lies in and one decrements ; otherwise the current is the field depth. Because the source supplies a finite upper bound and exact algebraic representations, this process terminates. By Theorems 6.2 and 6.4, its output is simultaneously the minimum projective gate alphabet and the minimum dyadic program-state layer.
Compilation pipeline
An exact compiler for the dyadic single-qubit language can therefore be organized as follows.
Stage 1. Compute the Bloch matrix exactly from the source program.
Stage 2. Starting from the source-level upper bound, descend the cyclotomic tower by the fixed-field test above. The first non-fixed level is the exact field depth; by Theorems 6.2 and 6.4, it is also the minimum projective gate alphabet and minimum dyadic program-state resource depth.
Stage 3. Run the fixed-alphabet canonical synthesis of [3] once at to obtain minimum primitive-rotation count.
Stage 4. Replace primitive rotations, if a measurement-based backend is requested, by the depth- program states of § 2 and their adaptive correction cascades.
Stage 5. Verify the emitted program by exact algebraic channel semantics, for example through an exact Choi representation. No search through all shallower gate alphabets is required once field depth has been identified.
Faithful axial embedding and a universal separating test
The main theorem concerns the entire dyadic Clifford-cyclotomic union. The original mist syntax gives a particularly simple source-to-target semantics on the axial fragment. Let source terms be normalized-midpoint expressions with denotation , and compile
By Theorem 2.3, the source state is a free-Clifford transform of the phase-program state that injects .
Theorem 8.1 (Semantic faithfulness on the axial fragment). For dyadic ,
Moreover, one fixed stabilizer observation separates every inequivalent pair: prepare , apply the compiled channel, and measure X.
Proof. The parametrization is injective on , and and define the same channel on that interval only when . For the separating experiment, the probability of the outcome after applying to is
which is strictly decreasing on .
This theorem is intentionally stated as faithfulness rather than as a general full-abstraction result: the midpoint source fragment used here has no independently developed contextual operational semantics. Fully abstract quantum models are established prior art [11]; the present point is the exact, experimentally separable embedding of this particular source notation into channel semantics.
Examples and structural consequences
The Hadamard magic state
For , Theorem 2.2 gives source depth and
The corresponding phase gate is , i.e. the T gate up to the conventional choice of global phase. Thus the nested Hadamard eigenstate from [1, 2] is the first primitive non-Clifford dyadic program state in this hierarchy.
Unlimited shallower states cannot cross an exact field boundary
Let . Any finite collection of program states of depths at most has Pauli coordinates in . By Theorem 3.1, an adaptive stabilizer protocol using any finite number of such states still produces only channels with Pauli-transfer entries in . Therefore it cannot exactly implement a target with . This is an exact-arithmetic obstruction, not a statement about approximate synthesis: approximation can of course approach finer rotations using a fixed universal alphabet.
Resource depth survives Clifford-hierarchy escape
The Clifford hierarchy is not closed under multiplication above its second level. For example, products of noncommuting dyadic axial rotations may leave every finite hierarchy level even though they remain exactly synthesizable in a finite Clifford-cyclotomic alphabet. The complete one-qubit hierarchy classification in [7] makes the distinction explicit. Our type remains finite because it is defined by exact arithmetic/gate-alphabet reachability rather than finite-hierarchy membership. Thus “Clifford level” and “resource depth” agree on primitive axial rotations but are different invariants for compositional programs.
Scope, claim boundary and related work
The paper deliberately separates imported results from new deductions.
Imported ingredients. The mist-state language and its fixed-point examples originate in [1]; the certified semantics, explicit normalization discipline, CANF and dyadic-geodesic closure are from [2]. Magic-state injection and small-angle rotation resources are established technology [4]; the recent general magic-gate-teleportation framework of Zheng, Zang and Kubica gives a broad structural account of useful resource states and feed-forward [5]. Forest et al. supply the fixed-alphabet canonical form, denominator-exponent pattern and rotation-count optimality [3], building on earlier structure theory for discrete rotation groups such as Radin–Sadun [12]. Arithmetic-group work studies the ambient Clifford-cyclotomic groups and their indices [13], while recent multiqubit work characterizes power-of-two ring synthesis with ancillas [14, 15]. Number-theoretic resource lower bounds for stabilizer computation, including a dyadic monotone, are established in [6]. Dyadic rewriting/completeness is also known in sum-over-paths form [8]. None of those results is re-claimed here.
Contribution isolated here. The mathematical step specific to this paper is the relative descent theorem Theorems 5.3 and 5.4, obtained by combining the fixed-alphabet denominator pattern with the even-denominator lemma for the power-of-two real cyclotomic tower. Its principal consequence is the equality between field depth and minimum gate-alphabet depth, Theorem 6.2. Combining that equality with the stabilizer arithmetic-closure theorem yields the program-state resource equality Theorem 6.4. Finally, fixed-alphabet optimality converts the common depth into the lexicographically optimal resource effect of Theorem 7.2.
Limitations. The resource equality is an exact, single-qubit, dyadic statement in a declared stabilizer-plus-dyadic-program-state model. It does not claim that field depth measures the amount of magic, that it determines approximate synthesis cost, or that the same equality holds for arbitrary multiqubit magic resources. It also does not replace existing complete rewriting calculi or general type systems, and QEff should not be read as a principal type theorem for a higher-order language. The result instead identifies an exact arithmetic layer that controls reachability and a certifiable static resource effect in one nested single-qubit resource family.
Conclusion
A simple dyadic source syntax leads to a stronger invariant than its educational origin suggests. Normalized midpoint depth identifies a canonical hierarchy of one-qubit program states; those states inject exact dyadic phase rotations; and their Pauli expectations generate the same real cyclotomic tower that appears in Clifford-cyclotomic synthesis. The stabilizer arithmetic-closure theorem turns this field tower into an operational obstruction. The relative intersection theorem then supplies the missing converse: within the exactly synthesizable dyadic union, descending the arithmetic field is precisely descending the gate alphabet.
The resulting identity
provides an exact resource effect for non-Clifford single-qubit dyadic programs in the declared program-state model. It remains meaningful after composition leaves the finite Clifford hierarchy, and when paired with fixed-alphabet optimal synthesis it yields a lexicographically optimal compiler objective. The next natural question is whether an analogous relative-descent theorem survives in selected multiqubit Clifford-cyclotomic or commuting-Pauli fragments, where field composita, stabilizer codes and nontrivial gate-teleportation structure interact.
Exact channel normal form for adaptive branches
For completeness we record a representation suitable for an independent verifier. Let a finite adaptive program have externally visible classical outcome and internal measurement history , with branch Kraus operator . Define
The family is the Choi representation of the externally visible quantum instrument after internal transcripts have been hidden. Equality of these Choi operators is equivalent to equality of the induced completely positive maps. In the dyadic fragment all entries lie in an explicitly generated cyclotomic number field, so equivalence is an exact algebraic decision rather than a floating-point comparison.
For the injection circuit of § 2, each terminal branch is proportional to the same target unitary after the prescribed feed-forward. Summing branch Choi matrices therefore gives the Choi matrix of the target unitary channel exactly. This supplies a convenient backend certificate for the compiler pipeline of § 7.
A second proof of the parity lemma
The Galois proof of Theorem 5.1 can be replaced by a valuation argument. Let be the unique prime of over 2. In the power-of-two cyclotomic tower the extension is quadratic and is totally ramified, so for ,
The principal ideal generated by is supported at ; hence the reduced -denominator exponent of an element from the base field is even. This proves Theorem 5.1 independently of coefficient parity. Standard facts about cyclotomic ramification may be found in [16]; related denominator arithmetic is developed in the appendices of [3].
Dependency map
The proof dependencies are deliberately short:
This organization also marks the prior-art boundary: only the implications stated in the present paper depend on the new relative-descent argument; the fixed-alphabet synthesis theorem itself is imported from [3].
References
- [1]D.-A. German, A term-rewriting semantics for pure quantum states, arXiv:2607.06584, 2026.arxiv.org/abs/2607.06584
- [2]T. Newton and D.-A. German, Certified misty-state rewriting: A question-and-answer guide, arXiv:2608.10024, 2026.arxiv.org/abs/2608.10024
- [3]S. Forest, D. Gosset, V. Kliuchnikov, and D. McKinnon, Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets, Journal of Mathematical Physics 56, 082201 (2015), doi:10.1063/1.4927100; arXiv:1501.04944.DOI
- [4]E. T. Campbell and J. O’Gorman, An efficient magic state approach to small angle rotations, Quantum Science and Technology 1, 015007 (2016), arXiv:1603.04230.DOI
- [5]Y. Zheng, A. Zang, and A. Kubica, Magic gate teleportation: Structure, useful resource states, and simpler feedforward, arXiv:2607.08508, 2026.arxiv.org/abs/2607.08508
- [6]M. Beverland, E. Campbell, M. Howard, and V. Kliuchnikov, Lower bounds on the non-Clifford resources for quantum computations, Quantum Science and Technology 5, 035009 (2020), arXiv:1904.01124.DOI
- [7]N. de Silva and O. Lautsch, The Clifford hierarchy for one qubit or qudit, Proceedings of the Royal Society A 481, 20250035 (2025), arXiv:2501.07939.arxiv.org/abs/2501.07939
- [8]R. Vilmart, Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing, Logical Methods in Computer Science 20(1):20 (2024), arXiv:2307.14223.DOI
- [9]A. Sundaram, R. Rand, K. Singhal, and B. Lackey, A rich type system for quantum programs, arXiv:2101.08939, version 3, 2022.
- [10]A. Colledan, U. Dal Lago, and N. Vazou, Circuit width estimation via effect typing and linear dependency, ACM Transactions on Programming Languages and Systems 47(3), 2025, doi:10.1145/3737282.DOI
- [11]P. Selinger and B. Valiron, On a fully abstract model for a quantum linear functional language, Electronic Notes in Theoretical Computer Science 210, 123–137 (2008), doi:10.1016/j.entcs.2008.04.022.DOI
- [12]C. Radin and L. Sadun, Subgroups of SO(3) associated with tilings, Journal of Algebra 202, 611–633 (1998), arXiv:math/9601202.arxiv.org/abs/math/9601202
- [13]C. J. Ingalls, B. W. Jordan, A. Keeton, A. Logan, and Y. Zaytman, The Clifford-cyclotomic group and Euler–Poincaré characteristics, arXiv:1903.09497, 2019.arxiv.org/abs/1903.09497
- [14]M. Amy, A. N. Glaudell, S. Kelso, W. Maxwell, S. S. Mendelson, and N. J. Ross, Exact synthesis of multiqubit Clifford-cyclotomic circuits, arXiv:2311.07741, revised 2024.arxiv.org/abs/2311.07741
- [15]L. Dinh and N. J. Ross, Contributions to the theory of Clifford-cyclotomic circuits, Electronic Proceedings in Theoretical Computer Science 426, 231–246 (2025), arXiv:2508.14674.DOI
- [16]L. C. Washington, Introduction to Cyclotomic Fields, 2nd ed., Springer, 1997.