Pith. sign in

REVIEW 2 major objections 4 minor 61 references

Local Universality and Structural Certificates for Minimal Fixed-Depth Two-Qutrit Gate Decomposition

T0 review · 2 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Four fixed two-qutrit cores, interleaved with five adjustable local layers, are shown to be locally universal at the minimal parameter-saturating depth.

desk verdict Exact local-universality certificate at the parameter-counting-minimal four-core depth, with an honest separation of exact and numerical claims; the only load-bearing step that needs mechanization is the hand-checked 80-label finite-field partition. read the letter →

arxiv 2607.24129 v1 pith:4Y4XVCYU submitted 2026-07-27 quant-ph

Yurui Liu , Ruoting Dou , Peng Xu , Xinsheng Tan , Shengjun Wu , Yang Yu , Zeng-Bing Chen This is my paper · ORCID
classification quant-ph MSC 22E7081P6820G40
keywords two-qutritgateslocaluniversalityfixed-coreansatzCliffordgroupPauli-labelsplittingsymplecticoverF3differentialrankcertificatequantumgatesynthesis
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper asks how short a fixed-hardware circuit can be and still be universal for two-qutrit gates, where a qutrit is a three-level quantum system. It studies the tightest possible architecture: four copies of a fixed non-tunable two-qutrit core interleaved with five adjustable local layers, whose parameter count exactly balances the 80 real dimensions of the two-qutrit unitary group. The central claim is that this minimal depth is genuinely attainable: an explicit Clifford-word core makes the identity-point differential an exact isometry of rank 80, so the reachable set contains an open neighborhood of a Clifford gate. A companion theorem says that no complex-symmetric core can be certified at the identity point, since its rank there is at most 78, steering hardware designs toward asymmetric drives. A superconducting-motivated asymmetric core is then shown numerically to synthesize all tested random targets, with the exact Clifford certificate kept distinct from finite-precision evidence.

What carries the argument

The load-bearing object is the right-trivialized differential $A_K(L)(X_1,\ldots,X_5) = \sum_{i=1}^5 \mathrm{Ad}_{P_i(L)}(X_i)$ of the fixed-core map, which at the identity local point reduces to $\sum_{i=1}^5 \mathrm{Ad}_{K^{5-i}}(X_i)$. Full rank 80 of this linear map is equivalent, via the inverse function theorem, to local surjectivity of the four-core synthesis map. For Clifford cores, conjugation by the core acts as a symplectic linear map $S_K$ on the two-qutrit Pauli labels over $\mathbb{F}_3^4$; the Pauli-label splitting criterion asks that the five transported copies of the local label block partition the 80 nonzero labels, which forces the corresponding tangent subspaces to be mutually orthogonal and makes every singular value equal to one. The companion obstruction uses the transpose involution $\tau(Y) = Y^{\mathsf T}$ on $\mathfrak{su}(9)$, whose positive eigenspace has dimension 44 while the local subalgebra contributes only 10 dimensions, forcing the rank bound of 78 for complex-symmetric cores.

What would settle it

Independently enumerate $\Lambda_t = S_{K_{\rm Cl}}^t(\Lambda_{\rm loc})$ for $t=0,\dots,4$ using the displayed symplectic matrix and check that the 80 labels are pairwise disjoint and exhaustive; equivalently, compute all 80 singular values of the identity-point differential matrix $M_{K_{\rm Cl}}(I)$ and look for any value that is not exactly 1. A repeated or missing label, or any singular value deviating from one at machine precision, would falsify the exact local-universality certificate.

Watch

Extended reading notes

Core claim

In the paper's own terms, the discovery is Theorem 2 together with Proposition 6. For the Clifford-word core $K_{\rm Cl}$, the four-core map $\Phi_{K_{\rm Cl}}(L_1,\ldots,L_5) = L_5 K_{\rm Cl} L_4 K_{\rm Cl} L_3 K_{\rm Cl} L_2 K_{\rm Cl} L_1$ has full-rank differential at the identity local point: the five transported Pauli-label blocks $\Lambda_t = S_{K_{\rm Cl}}^t(\Lambda_{\rm loc})$ partition all 80 nonzero labels, so the five transported copies of the local Lie algebra span $\mathfrak{su}(9)$ in mutually orthogonal Hilbert–Schmidt subspaces. Consequently $\Phi_{K_{\rm Cl}}$ is locally surjective near the identity local point, and the differential there is an exact isometry with all 80 singular values equal to one. In contrast, every complex-symmetric core $K = K^{\mathsf T}$ has identity-point differential rank at most 78, so no such core admits an identity-point full-rank certificate; the bound also applies to any core locally conjugate to a complex-symmetric core. The paper further classifies exactly 2304 symplectic actions satisfying the same splitting criterion, shows they are all two-sided locally equivalent, and supplies a hardware-motivated asymmetric core that escapes the symmetric-core obstruction and passes the reported sampled numerical tests.

Load-bearing premise

The exact Clifford certificate rests on Lemma 1's assertion that the five explicitly listed label blocks partition all 80 nonzero labels, and the proof is a direct finite-field check of the displayed lists rather than a machine-verified computation, so an unnoticed duplicate or omission would break the rank-80 isometry claim.

Editorial extensions

If this is right

  • Four non-tunable two-qutrit cores are enough in principle: the image of the Clifford-core map contains an open neighborhood of the Clifford gate $K_{\rm Cl}^{-1}$, so the minimal depth allowed by parameter counting achieves local universality rather than merely being formally possible.
  • Identity-point regularity is generic: because one core has nonzero determinant for the differential matrix, Haar-almost every core has full rank at the identity local point, with only a measure-zero exceptional set of cores failing there.
  • Complex-symmetric cores, including every core generated by a constant real-symmetric Hamiltonian, cannot be certified at the identity point; breaking this symmetry, for example with a noncommuting time-dependent drive, is necessary for an identity-point certificate.
  • All 2304 good Clifford-word cores are equivalent up to multiplication by local gates before and after the core, so they define the same reachable set; the inversion symmetry additionally implies that every purely local two-qutrit gate is exactly reachable by the same four-core Clifford architecture.
  • A hardware-motivated asymmetric superconducting core escapes the symmetric-core obstruction and reaches average fidelity at least 0.999 for all 1000 Haar-random targets tested under the stated restart protocol, while structured exchange-like targets remain below the threshold under the same fixed budget.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A design heuristic follows from the paper: for dimension-saturating fixed-core synthesis, one could optimize the core's Hamiltonian against the smallest singular value of the identity-point differential rather than against a single-target fidelity; the paper makes the geometry computable, so this optimization loop is directly testable on hardware models.
  • If the numerical regular-pair findings survive interval verification, every observed fold-like critical value is covered by a regular preimage, and the paper's own closed-image plus regular-preimage criterion would point toward global surjectivity of the Clifford-core map, a result the paper leaves open.
  • The transpose-involution obstruction likely has an analogue in other qudit systems: an odd number of local blocks flanking a transpose-invariant core loses at least two tangent dimensions at the identity point, so symmetry-breaking should be a general design requirement for minimal-depth fixed-core synthesis rather than a special feature of two qutrits.
  • The exact identity-point isometry suggests the Clifford core provides a well-conditioned coordinate chart near that point; one could test whether the channel capacity of the ansatz across random targets correlates with the conditioning of $A_K(I)$ over the whole 2304-core family, whereas the paper fixes a single representative.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper studies the four-core fixed two-qutrit ansatz Φ_K(L1,...,L5) = L5 K L4 K L3 K L2 K L1, with K ∈ SU(9) fixed and five local layers in L = SU(3)⊗SU(3). Since 5 dim L = 80 = dim SU(9), this is the shortest fixed-core architecture not ruled out by parameter counting. The authors formulate a right-trivialized differential rank certificate for local universality, construct an explicit Clifford-word core K_Cl, and prove via an explicit five-block Pauli-label splitting that the identity-point differential has full rank 80 and is in fact an exact isometry. They classify 2304 symplectic actions realizing the splitting, prove that every complex-symmetric core has identity-point differential rank at most 78, and numerically study a superconducting asymmetric-drive core, reporting full-rank sampled Jacobians, 1000/1000 Haar-random target synthesis at F_avg ≥ 0.999 under a stated restart protocol, and additional robustness and structured-target diagnostics. The paper carefully separates exact statements from finite-precision numerical evidence and explicitly notes that global surjectivity remains open.

Significance. Assuming the finite certificate and a corrected proof of Proposition 6, this is a clean and nontrivial answer to a natural minimal-depth question: at exactly saturated parameter count, local universality can be certified for an explicit Clifford core, while a structurally important symmetric family is provably obstructed at the identity local point. The constructive Clifford certificate, the classification of good symplectic actions, the exact reachability of the local subgroup, and the clear separation of exact versus numerical claims are genuine strengths. The paper is also unusually explicit in the supporting appendices. The main weaknesses are that the central finite-field partition is not machine-verified and that the symmetric-core proof contains algebraic misstatements as printed; these are load-bearing but appear repairable.

major comments (2)
  1. [Appendix C, Proposition 6] The proof as printed contains two false algebraic statements. On su(9), the map τ(Y) := Y^T is not equal to −Y: for Y = iR with R real symmetric traceless, Y^T = Y, whereas for real antisymmetric Y, Y^T = −Y. In addition, a complex-symmetric unitary need not be Hermitian, so the sentence "If K = K^T, then K^† = K" is false. The subsequent identity τ(Ad_K X) = Ad_{K^{-1}}(τX) does follow from K = K^T alone, so the rank-78 bound appears salvageable, but the proof must be rewritten with τ defined as transpose and without the Hermiticity claim.
  2. [Appendix A, Lemma 1] The exact certificate in Theorem 2 is reduced entirely to the assertion that the five explicitly printed 16-label blocks (A1)–(A5) partition F_3^4 \ {0}, and the proof is a "direct finite-field check" with no accompanying code or machine-readable table. A single duplicated or missing label, or a transcription error in S_KCl in Eq. (18), would invalidate the rank-80 and isometry claims. I am not asserting that the lists are wrong; I am asserting that the load-bearing finite arithmetic should be independently verifiable. Please include a small verification script or an electronic version of the tables as ancillary material, and report the output of the check explicitly.
minor comments (4)
  1. [Data availability statement] Given that several numerical claims (the 1000/1000 synthesis benchmark, the regular-pair archive, and the robustness scans) are central to the experimental part of the paper, the statement that data are available "upon reasonable request" is too weak; an archival repository or DOI should be provided.
  2. [Appendix B, Lemma 2] The proof of Lemma 2 begins by assuming that every 16-element sign-closed block disjoint from B_0 has the form (W\{0}) ⊔ (W^⊥\{0}) for a nonsingular plane W; since "block" is not defined before this point, please clarify whether this is part of the definition of a block in this context and, if not, justify the structural claim.
  3. [Section III C and Appendix D] The phrase "numerical rank floor" is used without stating the singular-value tolerance; please state the threshold used when reporting that no sampled rank collapse is observed.
  4. [Appendix C] The remark on degree theory is useful, but the sentence "Φ_I has image contained in L and hence has degree zero" deserves a one-sentence explanation that L is a proper closed subgroup, so the map is not surjective on homology in degree 80.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Clifford rank-80 certificate is a constructive finite-field verification, and the numerical core study explicitly separates the fixed core from the optimized local layers.

full rationale

The paper's central derivation is self-contained. Theorem 2 and Corollary 1 reduce the full-rank claim for the Clifford core to an explicit finite-field partition of the 80 nonzero Pauli labels (Lemma 1, Appendix A); the five blocks are listed and verified by a direct finite-field check. This is a constructive existence certificate, not a fitted parameter renamed as a prediction. The surrounding Lie-theoretic statements (Proposition 1 and Theorem 1) follow from product differentiation and the inverse function theorem. The classification of 2304 good symplectic actions uses an external finite-geometry stabilizer theorem (Ref. [39]), not a self-citation, and the symmetric-core rank bound (Proposition 6) is an independent linear-algebra argument. For the superconducting core, the Hamiltonian parameters are chosen once and held fixed; only the five local layers are optimized, and the paper explicitly states that the 1000/1000 Haar-random result is a synthesis protocol outcome rather than a target-dependent pulse redesign. The only notable caveats are verification-related rather than circular: Lemma 1's finite-field check is asserted rather than machine-verified, and the numerical packages are available only upon request. These affect confidence in the correctness of the computation, not the independence of the derivation. The one self-citation in the references (Ref. [26], for experimental single-qutrit gates) is background context and is not load-bearing for any mathematical claim.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The exact Clifford certificate has no free parameters; the numerical K_sc study introduces hand-chosen Hamiltonian and optimizer parameters. No new physical entities are postulated. The main domain assumptions are the fixed-core architecture and the representative nature of the superconducting Hamiltonian model.

free parameters (2)
  • Superconducting Hamiltonian coefficients (Table I) = Δμ=8 MHz; Ω2=0, Ω3=Ω4=2 MHz; g2=4 MHz; T=0.07 μs; η=0.35
    Hand-chosen representative values that generate the fixed core K_sc. All numerical claims about K_sc (Jacobian rank, Haar-random synthesis, robustness) depend on these specific choices, though they are not fitted to the target results.
  • Optimization protocol hyperparameters = learning rate 0.05, up to 100 restarts, 5000 epochs, Favg threshold 0.999
    The 1000/1000 Haar-random success and the structured-target outcomes are conditioned on this specific optimizer configuration and restart budget. Different settings could alter the reported success rates.
assumptions (4)
  • standard math Inverse function theorem for equal-dimensional smooth maps
    Used in Theorem 1 to conclude local surjectivity from full-rank differential. Standard result.
  • domain assumption Local operation group is exactly L = SU(3)⊗SU(3) and the four cores are identical parameterless gates
    Defines the architecture under study. All certificates and numerical tests concern this precise ansatz.
  • standard math Stabilizer sequence for nonsingular-pair spreads in PSp(4,3) from Hoffman and Weintraub [39]
    Used to count the 2304 good symplectic actions. External reference, not self-cited.
  • domain assumption The time-dependent Hamiltonian model (Eq. 23) with the listed generators is a representative hardware-motivated model
    Used for the numerical K_sc case study. The paper explicitly notes this is not a full device-level simulation and that leakage, decoherence, and bandwidth are excluded.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Local Universality and Structural Certificates for Minimal Fixed-Depth Two-Qutrit Gate Decomposition." pith.science (2026). https://pith.science/paper/4Y4XVCYU

@misc{pith2026260724129,
  author       = {Pith},
  title        = {Pith review of: Local Universality and Structural Certificates for Minimal Fixed-Depth Two-Qutrit Gate Decomposition},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4Y4XVCYU}},
  note         = {Machine review of arXiv:2607.24129}
}
abstract

We study a dimension-saturating fixed-core ansatz in which four copies of a fixed, non-tunable two-qutrit core $K\in SU(9)$ are interleaved with five adjustable local layers from $L=SU(3)\otimes SU(3)$. Since $\dim SU(9)=80$ and $5\dim L=80$, this is the shortest fixed-core architecture not excluded by parameter counting. We formulate the smooth map $\Phi_K:L^5\to SU(9)$ and use its right-trivialized differential to give verifiable certificates for local universality. We construct an explicit Clifford-word core whose Pauli-label splitting makes the identity-point differential an exact isometry, and we classify all 2304 symplectic actions satisfying the same splitting criterion. We also prove a structural obstruction for an important symmetry class: every complex-symmetric core $K=K^{T}$, including every core generated by a time-independent real-symmetric Hamiltonian in the chosen computational basis, has identity-point differential rank at most 78; hence any full-rank certificate for such a core must occur away from that point. We then assess a hardware-motivated superconducting core generated by a noncommuting, temporally asymmetric drive. Direct calculation verifies $K_{\rm sc}\neq K_{\rm sc}^{\mathsf T}$, and the core achieves $F_{\rm avg}\ge 0.999$ for all 1000 Haar-random targets tested under the stated restart protocol. We also report favorable sampled Jacobian-rank, structured-target, and robustness diagnostics. These results establish local universality at the parameter-counting-minimal, dimension-saturating depth, with an exact Clifford certificate complemented by a hardware-motivated numerical case study. Throughout, we separate exact local certificates from numerical evidence for broader synthesis performance.

Figures

Figures reproduced from arXiv: 2607.24129 by the authors.

Figure 1
Figure 1. FIG. 1. Dimension-saturating four-core ansatz. Each local layer is [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. Compact Clifford-core diagnostics. Panel (a) shows the distribution of the sampled pointwise smallest singular value [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3. Hamiltonian-parameter robustness under shared static coefficient offsets. (a) Perturbed-core recompilation. The [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: FIG. 4. Pointwise differential diagnostics for the Clifford-word cores. Panel (a) shows the distribution of [PITH_FULL_IMAGE:figures/full_fig_p018_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5. Fold-like diagnostics for the Clifford-word core. Left, a representative singular-value spectrum of [PITH_FULL_IMAGE:figures/full_fig_p022_5.png]
Figure 6
Figure 6. Figure 6: FIG. 6. All-100 regular-pair verification. For all 100 [PITH_FULL_IMAGE:figures/full_fig_p024_6.png]
Figure 7
Figure 7. Figure 7: FIG. 7. Matrix representation of the representative asymmetric-drive superconducting core [PITH_FULL_IMAGE:figures/full_fig_p025_7.png]
Figure 8
Figure 8. Figure 8: FIG. 8. Pointwise Jacobian diagnostics for the representative asymmetric-drive superconducting core [PITH_FULL_IMAGE:figures/full_fig_p025_8.png]
Figure 9
Figure 9. Figure 9: FIG. 9. Empirical success rate as a function of restart [PITH_FULL_IMAGE:figures/full_fig_p027_9.png]
Figure 10
Figure 10. Figure 10: FIG. 10. Fixed-budget structured-target benchmarks for the representative superconducting core [PITH_FULL_IMAGE:figures/full_fig_p029_10.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

61 extracted references · 38 canonical work pages

  1. [1]

    ForA∈SL(2,F 3), define the graph plane Γ(A) :={(x,Ax) :x∈V A}⊂V A⊕VB

    Blocks disjoint from the local block We first classify the 16-element sign-closed blocks dis- joint fromB 0 = Λloc. ForA∈SL(2,F 3), define the graph plane Γ(A) :={(x,Ax) :x∈V A}⊂V A⊕VB. Since in dimension two SL(2,F 3) = Sp(2,F 3), one has Γ(A)⊥ = Γ(−A). Hence B[A] := Γ(A)\{0} ⊔ Γ(−A)\{0} is a 16-element block disjoint fromB 0. Here [A] denotes the class ...

    work page

  2. [2]

    Compatibility graph and the three five-block splittings We next determine when two nonlocal blocksB [A] and B[B] are disjoint. Lemma 3(Block-disjointness criterion).ForA,B∈ SL(2,F 3), the following are equivalent: B[A]∩B [B] =∅; A−BandA+Bare both invertible; [A]−1[B]∈PSL(2,F 3)is a nontrivial element of order two. Proof.By definition, B[A] = (Γ(A)\{0})⊔(Γ...

    work page

  3. [3]

    Let Stab(Σ) :={M∈Sp(4,F 3) :M(Σ) = Σ} be its setwise stabilizer

    Counting good symplectic matrices Fix one of the three five-block systems and write it as Σ ={Λ 0,Λ 1,Λ 2,Λ 3,Λ 4},Λ 0 =B 0. Let Stab(Σ) :={M∈Sp(4,F 3) :M(Σ) = Σ} be its setwise stabilizer. There is a natural permutation representation ρ: Stab(Σ)−→S 5. The finite-geometry input used here is the stabilizer the- orem for nonsingular-pair spreads in PSp(4,3)...

    work page

  4. [4]

    Let H0 loc := SL(VA)×SL(V B)⊂Sp(V) be the strict local symplectic subgroup preservingVA and VB separately

    Two-sided local equivalence of all good cores We now prove that the 2304 good symplectic matrices lie in a single two-sided local double coset. Let H0 loc := SL(VA)×SL(V B)⊂Sp(V) be the strict local symplectic subgroup preservingVA and VB separately. In gate language, this is the symplectic image of the local single-qutrit Clifford group Cliff1,3⊗Cliff 1,...

    work page

  5. [5]

    Hence the 2304 good elements split equally between order 5 and order 10

    work page

  6. [6]

    For a two-qutrit Clifford coreK, writeS K :=π(K), and define Kgood :={K∈Cliff 2,3 :S K∈S good}

    Clifford-level and ansatz-level consequences By the Clifford-group convention above, there is a nat- ural projectionπ: Cliff 2,3−→Sp(4,F 3) obtained from the action of Clifford unitaries on Pauli labels, after quo- tienting out Pauli displacements and central phases. For a two-qutrit Clifford coreK, writeS K :=π(K), and define Kgood :={K∈Cliff 2,3 :S K∈S ...

    work page

  7. [7]

    At the symplectic-label level, a direct finite-field computation gives a local reversing symmetry R∗∈Sp(V A)×Sp(V B) such that R∗SKClR−1 ∗ =S−1 KCl

    Inversion symmetry and the local subgroup We record one useful consequence of the finite Clifford symmetry: the inverse of the short Clifford core is locally equivalent to the core itself. At the symplectic-label level, a direct finite-field computation gives a local reversing symmetry R∗∈Sp(V A)×Sp(V B) such that R∗SKClR−1 ∗ =S−1 KCl. For example, in the...

    work page

  8. [8]

    IfK=K T , thenK † =K, and forX∈su(9) τ(AdKX) = (KXK−1)T = (KT )−1XTKT = AdK−1(τX)

    directions withR 3,R′ 3 real symmetric traceless. IfK=K T , thenK † =K, and forX∈su(9) τ(AdKX) = (KXK−1)T = (KT )−1XTKT = AdK−1(τX). Henceτ AdKt l = Ad K−t lfor allt. LetW:= imAK(I) = P4 t=0 AdKt(l). Since Ad K−2 is an isom- etry, dimW= dimW ′ withW ′ := Ad K−2W=P2 t=−2 AdKt(l), and by the displayed relationW ′ isτ- invariant. WriteP ± = (id±τ)/2. For any...

    work page

Show all 61 references
  1. [9]

    (11) and (12)

    Fold values and regular partners The critical set ΣK and critical value setC K were de- fined in Eqs. (11) and (12). A useful sharpening of the boundary inclusion ∂(Im ΦK)⊆C K is that boundary values must be critical along their entire fiber. Proposition 8(Boundary values are ...

  2. [10]

    Map conventions and validation order The manuscript uses the fixed-core map ΦKCl(L1,...,L 5) =L 5KClL4KClL3KClL2KClL1. The numerical validation was implemented in the oppo- site local-layer ordering h= (bL0,bL1,bL2,bL3,bL4)∈L 5, with the no-appended validation map Φval KCl(h) ...

  3. [11]

    One convention detail deserves an explicit statement

    Layer-block decomposition and step gaps Let MKCl(h)∈R 80×80 denote the right-trivialized differential matrix of Φ val KCl in orthonormal bases ofl 5 andsu(9). One convention detail deserves an explicit statement. The main text parame- terized layer velocities by left trivializ...

  4. [12]

    Each local layer is parameterized by a real 16-vector pi = (ai,bi)∈R 8⊕R 8 using the Gell–Mann basis: Li(pi) = exp i 8X α=1 ai,αλα ! ⊗exp i 8X α=1 bi,αλα !

    Search for fold-like critical candidates The all-100 fold-like critical candidates were generated by a structured middle-layer search rather than by a blind 80-dimensional all-layer random restart. Each local layer is parameterized by a real 16-vector pi = (ai,bi)∈R 8⊕R 8 usin...

  5. [13]

    We test this condition with a one- dimensional finite-difference scan in validation-order lo- cal coordinates

    Finite-difference fold diagnostic The singular-value and step-gap diagnostics identify corank-one candidates, but a simple fold also requires a second-order nondegeneracy condition in the null di- rection [41, 42]. We test this condition with a one- dimensional finite-differen...

  6. [14]

    It then searches for a second pointh (m) reg ∈L 5 satisfying Φval KCl(h(m) reg )≈U (m) bad and having full-rank differential

    Regular-partner search and strict recomputation For each fold-like critical candidateh (m) bad, the regular- partner search fixes the no-appended target U(m) bad := Φval KCl(h(m) bad). It then searches for a second pointh (m) reg ∈L 5 satisfying Φval KCl(h(m) reg )≈U (m) bad a...

  7. [15]

    The aggregate statistics are shown in Table III

    All-100 verification and figures All 100 observed fold-like critical candidates admit a numerically regular partner under strict recomputation: Φval KCl(h(m) reg )≈Φ val KCl(h(m) bad),rankM KCl(h(m) reg ) = 80. The aggregate statistics are shown in Table III. The resid- uals a...

  8. [16]

    The archive separates raw local-layer parameters, critical-candidate genera- tion records, strict verification outputs, aggregate sum- mary files, and figure-generation inputs

    Archived outputs and reproducibility The regular-pair computation is archived as a machine- readable numerical package. The archive separates raw local-layer parameters, critical-candidate genera- tion records, strict verification outputs, aggregate sum- mary files, and figure...

  9. [17]

    Entangling-power diagnostics forK Cl For a two-qutrit gateU, we use the standard linear- entropy entangling power ep(U) = Z dψdϕ 1−Tr(ρ 2 A) , whereρ A = TrB[U(|ψ⟩|ϕ⟩)(⟨ψ|⟨ϕ|)U †] and the average is over product inputs. Equivalently, ford×dsystems one may use the Zanardi formu...

  10. [18]

    Barenco, C

    A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Elementary gates for quantum computa- tion, Physical Review A52, 3457 (1995)

    1995

  11. [19]

    M. A. Nielsen and I. L. Chuang,Quantum Computation and Quantum Information, 10th ed. (Cambridge Univer- sity Press, Cambridge, 2010)

    2010

  12. [20]

    C. M. Dawson and M. A. Nielsen, The solovay–kitaev algorithm, Quantum Information & Computation6, 81 (2006), arXiv:quant-ph/0505030

    2006 arXiv

  13. [21]

    Khaneja, R

    N. Khaneja, R. Brockett, and S. J. Glaser, Time optimal control in spin systems, Physical Review A63, 032308 (2001)

    2001

  14. [22]

    Makhlin, Nonlocal properties of two-qubit gates and mixed states, and the optimization of quantum compu- tations, Quantum Information Processing1, 243 (2002)

    Y. Makhlin, Nonlocal properties of two-qubit gates and mixed states, and the optimization of quantum compu- tations, Quantum Information Processing1, 243 (2002)

    2002

  15. [23]

    Zhang, J

    J. Zhang, J. Vala, K. B. Whaley, and S. Sastry, Geometric theory of nonlocal two-qubit operations, Physical Review A67, 042313 (2003)

    2003

  16. [24]

    Vidal and C

    G. Vidal and C. M. Dawson, Universal quantum circuit for two-qubit transformations with three controlled-NOT gates, Physical Review A69, 010301 (2004)

    2004

  17. [25]

    Vatan and C

    F. Vatan and C. Williams, Optimal quantum circuits for general two-qubit gates, Physical Review A69, 032315 (2004)

    2004

  18. [26]

    M¨ ott¨ onen, J

    M. M¨ ott¨ onen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Quantum circuits for general multiqubit gates, Physical Review Letters93, 130502 (2004)

    2004

  19. [27]

    V. V. Shende, S. S. Bullock, and I. L. Markov, Syn- thesis of quantum-logic circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Sys- tems25, 1000 (2006)

    2006

  20. [28]

    Y. Wang, Z. Hu, B. C. Sanders, and S. Kais, Qudits and high-dimensional quantum computing, Frontiers in Physics8, 589504 (2020)

    2020

  21. [29]

    Brylinski and R

    J.-L. Brylinski and R. Brylinski, Universal quantum gates, inMathematics of Quantum Computation, edited by R. Brylinski and G. Chen (Chapman and Hall/CRC, Boca Raton, 2002) arXiv:quant-ph/0108062

    2002 arXiv

  22. [30]

    Muthukrishnan and C

    A. Muthukrishnan and C. R. Stroud, Multivalued logic gates for quantum computation, Physical Review A62, 052309 (2000)

    2000

  23. [31]

    S. S. Bullock, D. P. O’Leary, and G. K. Brennen, Asymp- totically optimal quantum circuits ford-level systems, Physical Review Letters94, 230502 (2005)

    2005

  24. [32]

    G. K. Brennen, S. S. Bullock, and D. P. O’Leary, Efficient circuits for exact-universal computations with qudits, Quantum Information & Computation6, 436 (2006), arXiv:quant-ph/0509161

    2006 arXiv

  25. [33]

    Di and H.-R

    Y.-M. Di and H.-R. Wei, Synthesis of multivalued quan- tum logic circuits by elementary gates, Physical Review A87, 012325 (2013)

    2013

  26. [34]

    A. S. Nikolaeva, E. O. Kiktenko, and A. K. Fedorov, Effi- cient realization of quantum algorithms with qudits, EPJ Quantum Technology11, 43 (2024)

    2024

  27. [35]

    E. O. Kiktenko, A. S. Nikolaeva, and A. K. Fedorov, Colloquium: Qudits for decomposing multiqubit gates and realizing quantum algorithms, Reviews of Modern Physics97, 021003 (2025)

    2025

  28. [36]

    Y.-M. Di, J. Zhang, and H.-R. Wei, Cartan decompo- sition of a two-qutrit gate, Science in China Series G: Physics, Mechanics and Astronomy51, 1668 (2008)

    2008

  29. [37]

    L. E. Fischer, A. Chiesa, F. Tacchino, D. J. Egger, S. Car- retta, and I. Tavernelli, Universal qudit gate synthesis for transmons, PRX Quantum4, 030327 (2023)

    2023

  30. [38]

    Jiang, W.-Q

    G.-L. Jiang, W.-Q. Liu, and H.-R. Wei, Optimal quantum circuits for general multi-qutrit quantum computation, Advanced Quantum Technologies7, 2400033 (2024), arXiv:2310.11996

    2024 arXiv

  31. [39]

    Krantz, M

    P. Krantz, M. Kjaergaard, F. Yan, T. P. Orlando, S. Gus- tavsson, and W. D. Oliver, A quantum engineer’s guide to superconducting qubits, Applied Physics Reviews6, 021318 (2019)

    2019

  32. [40]

    Kjaergaard, M

    M. Kjaergaard, M. E. Schwartz, J. Braumuller, P. Krantz, J. I.-J. Wang, S. Gustavsson, and W. D. Oliver, Superconducting qubits: Current state of play, Annual Review of Condensed Matter Physics11, 369 (2020)

    2020

  33. [41]

    Blais, A

    A. Blais, A. L. Grimsmo, S. M. Girvin, and A. Wall- raff, Circuit quantum electrodynamics, Reviews of Mod- ern Physics93, 025005 (2021)

    2021

  34. [42]

    J. Koch, T. M. Yu, J. Gambetta, A. A. Houck, D. I. Schuster, J. Majer, A. Blais, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf, Charge-insensitive qubit design de- rived from the cooper pair box, Physical Review A76, 042319 (2007)

    2007

  35. [43]

    X.-M. Yu, X. Deng, W. Zheng, W. Xin, T. Zhang, H. Che, K. Zhou, H. Zhou, Y. Ge, Z. Zhang, W. Huang, H. Cai, X. Li, J. Zhao, X. Tan, Y. Zhang, S.-X. Li, and Y. Yu, Efficient implementation of a single-qutrit gate set via coherent control, Physical Review Letters136, 230803 (202...

    2026

  36. [44]

    M. A. Yurtalan, J. Shi, M. Kononenko, A. Lupascu, and S. Ashhab, Implementation of a walsh-hadamard gate in a superconducting qutrit, Physical Review Letters125, 180504 (2020)

    2020

  37. [45]

    Morvan, V

    A. Morvan, V. V. Ramasesh, M. S. Blok, J. M. Kreike- baum, K. O’Brien, L. Chen, B. K. Mitchell, R. K. Naik, D. I. Santiago, and I. Siddiqi, Qutrit randomized bench- 31 marking, Physical Review Letters126, 210504 (2021)

    2021

  38. [46]

    N. Goss, A. Morvan, B. Marinelli, B. K. Mitchell, L. B. Nguyen, R. K. Naik, L. Chen, C. J¨ unger, J. M. Kreike- baum, D. I. Santiago, J. J. Wallman, and I. Siddiqi, High- fidelity qutrit entangling gates for superconducting cir- cuits, Nature Communications13, 7481 (2022)

    2022

  39. [47]

    K. Luo, W. Huang, Z. Tao, L. Zhang, Y. Zhou, J. Chu, W. Liu, B. Wang, J. Cui, S. Liu, F. Yan, M.-H. Yung, Y. Chen, T. Yan, and D. Yu, Experimental realization of two qutrits gate with tunable coupling in superconduct- ing circuits, Physical Review Letters130, 030603 (2023)

    2023

  40. [48]

    T. Roy, Z. Li, E. Kapit, and D. I. Schuster, Realization of two-qutrit quantum algorithms on a programmable su- perconducting processor, Physical Review Applied19, 064024 (2023)

    2023

  41. [49]

    N. Goss, S. Ferracin, A. Hashim, A. Carignan-Dugas, J. M. Kreikebaum, R. K. Naik, D. I. Santiago, and I. Sid- diqi, Extending the computational reach of a supercon- ducting qutrit processor, npj Quantum Information10, 101 (2024)

    2024

  42. [50]

    Subramanian and A

    M. Subramanian and A. Lupascu, Efficient two-qutrit gates in superconducting circuits using parametric cou- pling, Physical Review A108, 062616 (2023)

    2023

  43. [51]

    Gottesman, Fault-tolerant quantum computation with higher-dimensional systems, inQuantum Computing and Quantum Communications, Lecture Notes in Computer Science, Vol

    D. Gottesman, Fault-tolerant quantum computation with higher-dimensional systems, inQuantum Computing and Quantum Communications, Lecture Notes in Computer Science, Vol. 1509, edited by C. P. Williams (Springer, Berlin, 1999) pp. 302–313, arXiv:quant-ph/9802007

    1999 arXiv

  44. [52]

    Hostens, J

    E. Hostens, J. Dehaene, and B. D. Moor, Stabilizer states and Clifford operations for systems of arbitrary dimen- sions, and modular arithmetic, Physical Review A71, 042315 (2005), arXiv:quant-ph/0408190

    2005 arXiv

  45. [53]

    L. H. Pedersen, N. M. Møller, and K. Mølmer, Fidelity of quantum operations, Physics Letters A367, 47 (2007)

    2007

  46. [54]

    Lambert, E

    N. Lambert, E. Gigu` ere, P. Menczel, B. Li, P. Hopf, G. Su´ arez, M. Gali, J. Lishman, R. Gadhvi, R. Agarwal, A. Galicia, N. Shammah, P. Nation, J. R. Johansson, S. Ahmed, S. Cross, A. Pitchford, and F. Nori, QuTiP 5: The quantum toolbox in Python, Physics Reports1153, 1 (2026)

    2026

  47. [55]

    J. W. P. Hirschfeld,Projective Geometries over Finite Fields, 2nd ed. (Oxford University Press, Oxford, 1998)

    1998

  48. [56]

    Hoffman and S

    J. Hoffman and S. Weintraub, Four dimensional symplec- tic geometry over the field with three elements and a moduli space of abelian surfaces, Note di Matematica 20, 111 (2001)

    2001

  49. [57]

    Guillemin and A

    V. Guillemin and A. Pollack,Differential Topology (Prentice-Hall, Englewood Cliffs, NJ, 1974)

    1974

  50. [58]

    Whitney, On singularities of mappings of euclidean spaces

    H. Whitney, On singularities of mappings of euclidean spaces. i. mappings of the plane into the plane, Annals of Mathematics62, 374 (1955)

    1955

  51. [59]

    Golubitsky and V

    M. Golubitsky and V. Guillemin,Stable Mappings and Their Singularities, Graduate Texts in Mathematics, Vol. 14 (Springer, 1973)

    1973

  52. [60]

    Zanardi, C

    P. Zanardi, C. Zalka, and L. Faoro, Entangling power of quantum evolutions, Physical Review A62, 030301(R) (2000), arXiv:quant-ph/0005031

    2000 arXiv

  53. [61]

    X. Wang, B. C. Sanders, and D. W. Berry, Entan- gling power and operator entanglement in qudit sys- tems, Physical Review A67, 042323 (2003), arXiv:quant- ph/0210156

    2003

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.