WorksPhysics and Astronomy
Reference-Assisted Qutrit Control and Conditional One-Round Distillation in a Charge-4e Superconductor Model
Abstract
We formulate a charge- parafermionic-vortex route to qutrit processing as a conditional theory with explicit operational assumptions. Sector preservation and same-label charge-conjugation covariance imply closure for every adaptive visible record. For charge-conjugation-invariant inputs, record probabilities are independent of the supported reference state; for arbitrary inputs, discarding the reference gives a population-weighted mixture of conjugate sector maps. We give a finite-depth stability bound for complete labelled instruments, including postselection and initial zero-sector contamination. A self-contained calculation reproduces the known dense single-qutrit closure of the registered Clifford-plus-Flip gate set. We also specify an abstract ternary CSS syndrome/recovery decoder: 243 classical representatives per CSS component correct all 3,609 Pauli errors of support weight at most two, and an exact integer dynamic program yields the full independent-Pauli logical enumerator. Its all-syndrome acceptance is distinct from the known ideal acceptance of one-round strange-state Golay distillation. An accepted-run target-infidelity budget and a synthetic parameter protocol expose the remaining noise assumptions. Native charge- syndrome extraction, material feasibility, a device threshold, and unconditional fault tolerance are not established.
Introduction
Topological superconductors with charge- order have been proposed as a platform in which flux defects carry parafermionic zero modes and can implement a qutrit version of topological quantum processing [1]. The attractive division of labor is familiar: defect braiding supplies protected algebraic operations, while a coherent interferometric measurement supplies a non-Clifford resource. Turning this division into a logically closed protocol requires more than checking individual braid matrices. One must identify the source of the Pauli operators, specify what an external data qutrit experiences when the charge-conjugation sector is not observed, and place every non-topological step inside a quantitative error model. The broader background already includes general magic-state routes [2], ternary-Golay distillation [3], and measurement-assisted universality in other anyon models [4, 5]; our claims are therefore limited to the reference-assisted instrument formulation and error-interface analysis below. The gate-density and Golay-distillation results are reproduced background, not new universality or distillation protocols.
This paper isolates those questions in a single idealized operation model. Our first contribution is an explicit reference-assisted instrument formulation, related to the general reference-frame and superselection framework [6]. Its adaptive closure theorem specializes these symmetry ideas to the stated visible-record conventions. A data qutrit is coupled to a reference qutrit whose usable state lies in the two-dimensional sector span . The two sectors are exchanged by charge conjugation, and the in-use instruments are assumed to preserve the reference charge sector. The proof is elementary; its role is to make the operational assumptions explicit: it identifies exactly which statements survive tracing out the reference, which require a charge-conjugation-invariant data input, and which fail if the reference is retained or if a reset is charge-conjugation breaking.
Our second contribution is a model-conditional error statement. We represent label, reference, walking, and selected coherence failures by a common classical flag refinement of an accepted run. The probability of any bad flag is bounded by a union bound. This gives a scalar target-infidelity budget, not a device-level logical error rate. We separately prove a channel-distance stability bound under explicit complete-instrument assumptions; the scalar budget parameters are not automatically bounds in that metric. The distinction matters because the registered coherence term refers to a specified measurement test; for another route, such as the two-qutrit auxiliary-state route, the correct fidelity term is different.
The paper has four deliberate boundaries. First, “universal” always means dense single-qutrit closure in the registered ideal sector model and on the stated measurement records. Second, the ternary Golay calculation is separated from the abstract syndrome/recovery decoder: the former has the F2 postselection factor 1/1728, while the latter accepts every abstract syndrome and has no native charge- extraction circuit. Third, all F4 and F5-S feasible regions are abstract parameter or synthetic-data results. Fourth, the literature already contains charge- proposals, ternary Golay distillation, and measurement-assisted anyonic universality; the contribution here is their audited reference-assisted closure and error-interface package. No material, device, or experimental data are used.
The main results are organized as follows. Section 2 fixes the qutrit and reference conventions. Section 3 proves the closure theorem. Section 4 summarizes the registered braid and reference algebra, and Section 5 reproduces the known ideal single-qutrit density result in our conventions. Section 6 describes state preparation, injection, the ternary Golay calculation, and the abstract decoder. Section 7 gives the conditional budget theorem. Section 8 records the synthetic-data interface and its limits. We conclude with the experimental and mathematical problems that remain open.
Charge-conjugation qutrit and operation model
Let and let be the logical data qutrit with computational basis . The Weyl operators are denoted by and , with
Charge conjugation is the unitary
The same notation is used for the corresponding operation on a reference qutrit R. Write and for the registered braid generators, so . We use the sector operator and restrict the usable reference to
The two coherent pure states used below are
The reference basis labels the Abelian charge of the first vortex pair in a neutral four-defect register: is the vacuum channel, while are exchanged by charge conjugation. The registered ideal preparation starts from , applies , and accepts the nonzero outcome of the binary test . This outcome has probability and prepares if the test preserves the two nonzero sectors’ coherence. If a hidden environment instead records which nonzero charge occurred, the prepared reference is . Both preparations have balanced populations and satisfy the reduced-data closure hypotheses; only the first supplies coherence to a route that explicitly requires it.
Alignment is a relational condition distinct from balance. All data may share one reference. For two references, the registered measurement of separates the same-sector span from the opposite-sector span ; applying to the latter aligns the two references without revealing the absolute charge. This preparation correction precedes the restriction to operations preserving the in-use reference sectors. These are ideal primitive-level constructions, not measured device preparation fidelities.
An elementary visible instrument has a classical result and a completely positive (CP), trace-nonincreasing map . In the reference basis it is required to be sector preserving. Thus, on , its Kraus operators have the form
where is a hidden Kraus label and . Covariance is imposed on these CP maps, without requiring a particular matching of Kraus decompositions. The central assumption is the same-label relation
Adaptive choices may depend on earlier visible records, but not on the unobserved reference sector. The phrase “same label” is essential. If charge conjugation permutes visible labels, same-label covariance requires summing CP maps over complete label-permutation orbits and making feedback depend on the resulting quotient record; a mere relabeling need not suffice.
Reference-assisted closure theorem
We now state the central result. For a visible record , write for the composed CP map in reference sector . Let be a reference state supported on , with populations and coherence .
Theorem 1 (Reference-assisted closure and record blindness). Assume sector preservation (5), same-label covariance (6), and feedback that depends only on visible records. Then:
For every adaptive record ,
If the data input obeys , every record probability is independent of inside and equals
For , after tracing out the reference, the normalized data state is independent of but generally depends on :
For arbitrary , the unnormalized reduced branch is
If the sector maps are unitary channels (or share a scalar branch probability, removed on conditioning), this is the channel mixture
Equal weights give the symmetry average of the channel under conjugation by . This is not in general the state twirl . Equal weights must be prepared or imposed by a specified symmetrization; they do not follow from tracing out .
Proof. For one primitive, sector preservation gives a block decomposition of every Kraus operator. (6) relates the diagonal CP maps. Composition preserves that relation because adjacent factors cancel; no Kraus-by-Kraus covariance is required. For an adaptive protocol, induction on the visible record tree applies because the next operation is selected from the already observed record and is therefore the same operation in both sectors. This proves (7).
Expanding the joint state in reference matrix units, the diagonal blocks after record are and the off-diagonal blocks are proportional to and . The partial trace over removes the off-diagonal blocks. If is -invariant, equation (7) makes the two diagonal traces equal, which proves record blindness and (9). No -invariance is needed for (10).
Remark 1 (What the theorem does not say). The theorem does not assert that a coherent reference becomes a classical mixture when it is retained. The identity protocol with gives , whose off-diagonal reference block is nonzero. An inaccessible environment can record the sector while preserving each reference sector and both visible diagonal CP maps. It can therefore dephase a retained reference without breaking visible record blindness. Reading that environmental label, or applying a charge-conjugation-breaking reset, can instead violate same-label covariance. Sector transitions, hidden dephasing, and visible charge readout are distinct mechanisms. Finally, if sends a visible result to , for a -invariant data input the direct conclusion is the paired-record identity ; same-label record blindness requires an invariant record quotient.
Finite-depth stability and zero-sector contamination
Theorem 2 (Stability for complete labelled instruments). Include the visible history, feedback controller, and abort status in the output memory, and pad halted branches by identity steps up to depth . Let be the ideal and actual complete trace-preserving instrument channels, including all outcomes. Assume a uniform bound over histories
The ideal instruments satisfy Theorem 1; where leakage spaces are retained, the comparison uses an explicit trace-preserving extension of the ideal maps to those spaces. Then complete outputs and record laws differ by at most
For two supported reference preparations and a common -invariant data input, actual record laws therefore have total variation at most . For an acceptance event with actual and ideal probabilities , the normalized accepted states satisfy
Proof. Trace-distance contractivity and the channel bound give the telescoping estimate ; classical readout is also contractive. Compare the two actual record laws through their common ideal law. For accepted subnormalized states of traces , the rejected flag block implies . Expanding first with denominator , then with denominator , gives the stated bound.
This is a channel-distance assumption, not a consequence of a small commutator with . For example, visible sector measurements have Kraus operators that commute exactly with , yet distinguish from perfectly and violate same-label covariance. No device value of is established here. For an unbounded stopping protocol one needs a stopping-time bound or an explicit truncation and overflow contribution; its mean length alone does not justify replacing in the estimate.
If a prepared reference has zero-sector weight , its distance from its normalized projection onto is at most , providing a preparation contribution to . For block-incoherent zero-sector contamination this contribution is exactly . If all three reference sectors are preserved, the reduced branch acquires , whose record probabilities need not equal those of the nonzero sectors even when the zero block is charge-conjugation covariant. The original record-blindness theorem thus remains restricted to .
Registered algebra and the source of the Pauli sectors
The charge- defect data used here are the charge-conjugation defect data of the parafermionic-vortex proposal [1]. The defect has quantum dimension and the defect fusion channel contains the three Abelian charge sectors. The braid matrices and probe words were reconstructed from the registered and data, including the path convention for the five braid diagrams. The resulting four- and eight-strand checks reproduce the source matrices and the charge-conjugation mirror relations. The use of -crossed language follows the standard defect formalism [7]. More general parafermion encodings and available braid sets can realize different Clifford images [8]; the following order-24 statement concerns our specified four-defect generators.
For the fixed braid generators used in the source construction, the single-qutrit phase image generated by the registered and has order
This is the single-qutrit Clifford image without the nontrivial Pauli translations. The braid-only representation therefore should not be described as the full Clifford group or as generating every stabilizer state without an additional sector argument.
The reference qutrit supplies that sector argument. In the and reference blocks, the registered operations are charge-conjugate copies. Each block has the same Clifford image, while the reference-assisted controlled operations and measurement projectors supply the nontrivial Pauli translations. The generators normalize the qutrit Weyl group. Their enumeration agrees with the projective Clifford structure , of order [9], in each of these two sectors; the block is a smaller linear subgroup. This is a conditional closure statement: it assumes the reference is available, remains in the registered sector model, and is used with the specified visible records.
The distinction between the 24-element braid image and the 216-element reference-assisted image is operationally important. An external data state does not automatically acquire an equal twirl. By Theorem 1, it sees the population-weighted mixture in equation (10). Equal weights require a prepared balanced reference or an explicit symmetrization.
Self-contained density check for the registered gate set
The density result for this gate family is known: Cui and Wang [10], Lemma 4, give the same commutator and eigenvalues used below. We supply a self-contained check tied to the registered matrices, without claiming a new density theorem. Let denote the 216-element projective qutrit Clifford group in the reference-supported sector, and let
The three measured N3 branches are Pauli conjugates of . The outcome identifies the branch, but two-sided conjugacy does not furnish an output-only Pauli correction on an arbitrary input: for a branch , such a correction would have to be , which is non-Weyl for . Realizing a designated Flip uses the registered repeat-until-target protocol and retains its full branch record. Direct conjugation gives
Its normalized shift-column phase ratios are , which are not the Weyl phases . Thus is genuinely non-Clifford.
Define and , with . Up to a scalar, , so belongs to . For
we find exactly
The eigenvalue is not a root of unity, since would then be an algebraic integer. Therefore the closure contains the one-parameter subgroup generated by . In the Weyl basis , define . The eight coefficients are
Every coefficient is nonzero. Since
the finite Fourier character matrix shows that the nine Hermitian conjugates of have complex span of dimension eight. Complex and real ranks agree for Hermitian generators, so their real span is all traceless Hermitian matrices. Let be the closed generated subgroup for determinant-one representatives. The irrational rotation above puts in , and hence in its Lie algebra. This Lie algebra is therefore . The identity component of the closed Lie subgroup is all of the connected group ; thus
with that representative convention, and the projective single-qutrit gate set is dense. This is a sector-wise ideal statement. It assumes the reference sector is aligned and visible records and the target-Flip protocol are retained. Multi-qutrit universality would additionally require a usable entangling gate, such as SUM, and consistent reference and record semantics for the composite circuit [10]. It does not claim that a reduced channel with an unobserved reference sector is unitary, nor does it provide a fault-tolerant compiler. As a finite reproducibility check, the word approximates with circular angle error and Frobenius error below ; the unreduced accounting is 48,080 Clifford symbols and 6,010 Flip symbols.
Non-stabilizer states, injection, and ternary Golay distillation
Define
In the phase-point convention , , the two states have minima [11]
so both are non-stabilizer states. The exact Wigner tables and the preparation identities are part of the F1/F2 calculation. For example, the registered SUM/controlled operations followed by the two-dimensional measurement produce and branches with equal conditional weights in the reference-supported sector. The interferometric and coherent-test routes then supply the state needed by the injection circuits, with the outcome-dependent charge-conjugation corrections implemented by the reference walk.
The qutrit walk has three equally likely flip labels in the ideal model. If the record is read without error, the expected number of rounds to reach a designated target label is 3. With a total readout error rate , two symmetric wrong labels, and the registered target-stop rule, the exact absorption calculation gives
At small , this behaves as .
For distillation, the registered twirl gives the strange-state family
This full 24-element twirl preserves strange-state fidelity and mixes its rank-two orthogonal complement. The two-element charge-conjugation twirl alone does not produce this family: it leaves unchanged. We reproduce the ternary-Golay strange-state distillation map of Prakash [3] in these parameter conventions, including its cubic suppression, crossing, and ideal acceptance. For eleven independent, identically prepared copies , the one-round output parameter has the form
where and are the exact ternary-Golay enumerator polynomials [3]. Independent integer-enumerator reconstruction and exact polynomial root counting find one nonzero crossing in , in the bracket:
The corresponding accepted-syndrome probability has constant term at the ideal point, and the leading output suppression is cubic. For the untwirled rank-two family , the one-round fidelity map has a unique crossing in the registered range :
The other physical fixed points of the untwirled map are listed in Appendix § 12. Independent input copies and the full twirl are parts of the stated input model for equation (25); local twirling alone does not remove arbitrary correlations between copies.
The gate-density conclusion here concerns the explicit Clifford-plus-Flip set of § 5; we do not assume that every non-stabilizer state is distillable or that every non-Clifford extension has the same operational realization. Broader prime-dimensional distillation constructions provide context [12]. The present calculation reproduces a specified input family and one-round map. It does not construct a native 11-qutrit Golay extraction circuit or show that arbitrary device noise automatically has this form.
Abstract ternary-Golay syndrome and recovery decoder
The classical ternary Golay code generated by gives an exact CSS code. An independent stabilizer check matrix is
For a Pauli label , use the syndrome labels over , with the measured -check eigenvalue sign absorbed into the second label. For each CSS component separately, the decoder stores, for each of the classical syndromes, the lexicographically first minimum-weight representative and applies . The classical ternary errors of weight at most two have distinct syndromes, the syndrome representative histogram is by weight, and every syndrome coset has size . The joint quantum decoder has syndrome pairs. Every Pauli error of support weight at most two has each component of classical weight at most two, so all such Pauli labels are corrected to the identity logical sector.
Let be the total nonidentity probability at one site in the independent Pauli model: the identity has probability , and each of the eight other labels has probability . This is distinct from the strange-state depolarizing parameter . If counts support-weight- errors with residual logical label , then
The exact dynamic program over labels obeys . The identity row begins , giving the guaranteed-correctable mass
All nonidentity logical rows vanish through weight two. Directly enumerating the weight-three labels gives identity-logical recoveries and failures, so the bound is not tight. For example, receives the recovery , leaving a nontrivial weight-five logical residual. The classical covering radius is two; the joint Pauli-syndrome covering radius is four, with minimum-weight histogram (1, 88, 3520, 47520, 7920). Neither covering radius is the guaranteed correction radius.
The ideal full-syndrome recovery instrument rejects no syndrome, so its acceptance is one. In contrast, strange-state distillation projects a particular eleven-copy input onto the zero-syndrome code space. For , the stabilizer weight enumerator is
Using the phase-symmetrized convention, each nonidentity single-site Weyl expectation is , hence
An independent CSS overlap calculation gives the signed numerators and the same value . These two acceptances refer to different instruments and inputs; they cannot be identified or multiplied without a specified composed protocol. All-syndrome acceptance does not imply costless or faultless physical measurement. A native charge-4e extraction schedule, leakage model, and correlated-noise threshold remain open.
Error channels and an accepted-run budget
The F3/F4 model separates the following quantities: visibility and static phase parameters , a silent -jump probability , reference-flip parameter , walk readout error , coherence parameter , and a herald success parameter . In the iid-probe model, the label error for an odd number of probes is computed from the same visibility-and-probe logic used in standard anyon interferometry [13]:
followed by the majority tail of a binomial distribution. In the persistent single-jump model, the silent-jump analysis gives the registered critical value
and the optimal odd probe number changes across this boundary. The iid-probe model and the robust maximum of the iid and persistent models are treated separately below; the value is not a universal threshold for arbitrary drift or Markov noise.
Reference redundancy uses the conditional no-loss flip rate
The loss probability is not included in ; it must be included separately if an abort is counted as a failed attempt rather than conditioned away.
The scalar budget requires a precise event interpretation. Let be the accepted-run event and let , , , denote label, reference, walk, and selected coherence bad flags. For the normalized accepted output , we use squared fidelity to a pure target, . We assume that the accepted protocol has a common classical flag refinement, that each stated term bounds its bad flag conditional on the same acceptance event, and that the all-good flag produces this pure target. These conditions must be checked for each application; a marginal diagnostic fidelity alone does not supply such a flag model. We then obtain the following proposition.
Proposition 1 (Model-conditional target-infidelity budget). Under the accepted-run flag assumptions above, with , equations (22) and (36), and a coherence term defined for the chosen route,
No independence among the four bad events is required for the final union bound.
Proof. On the all-good flag the output has unit fidelity with the ideal output. Every bad flag contributes at most one unit of infidelity, so the total infidelity is bounded by the probability of the union. The union bound gives the second inequality. Independence is used only when deriving the closed forms for individual terms.
The coherence term is route dependent. For the specified H6(a) measurement test, . For the N3 CP-map route, the registered map is independent of , so . For the N2 auxiliary-state route, the exact fidelity is
Consequently must not be called a universal trace or diamond distance. The channel stability theorem (Theorem 2) instead assumes complete-instrument diamond-distance bounds. No conversion from the scalar values or the F4 grid to those bounds is established here.
The crossing in equation (25) applies to eleven independent inputs in the -twirled family, including the designated diagonal family only after that full twirl. Without twirling, the binary diagonal family instead has the smaller crossing . It does not automatically cover retained reference coherence, leakage, correlated Markov jumps, continuous drift, thermal quasiparticles, or decoder faults.
Abstract budget regions and synthetic-data protocol
The F4 interface evaluated the registered scalar budget on 28,800 abstract parameter combinations. Under the original H6(a)-style coherence convention, 16,528 points satisfy , or 57.389%. A later reconciliation of the independent-iid and persistent single-jump models gives
| label process | feasible points (abstract model) | fraction |
| iid probe | 16,528 | 57.389% |
| single jump | 10,524 | 36.542% |
| robust maximum | 10,524 | 36.542% |
Table 1.
The robust row covers only the two registered jump models. It is not a general noise theorem.
F5-S specifies how a future experiment could fit the interface without silently treating correlated data as iid. The synthetic planning run contains 754,000 unique ordinary rows, 854,000 logical-channel rows, and 2,500,000 ordered jump-probe events, for about 3.254 million deduplicated raw events. It uses exact or high-precision formula checks, planning 99% interval fields (with no empirical coverage claim), held-out iid and single-jump semantic diagnostics, and a Markov negative control that must remain inconclusive. The model-selection smoke tests classified all six iid examples as iid, all six persistent-jump examples as single-jump, and all six Markov examples as inconclusive.
These numbers describe a statistical protocol, not an experiment. A real run must retain event ordering, readout scores, timeouts, loss flags, postselection outcomes, and enough independent blocks to estimate effective sample size. The parameter is a resource/postselection interface; it is not a measured device success probability in the present paper.
Scope, experimental interface, and open problems
The theory establishes a conditional chain:
Each arrow carries assumptions. The closure theorem applies to sector-preserving instruments and same-label covariance. The gate algebra assumes the ideal registered operation set. The resource calculation assumes the specified measurement records and postselection. The budget theorem assumes a common classical failure flag and accepted-run conditioning.
The next experimental step is therefore a parameter-mapping exercise, not a claim that the F4 grid has already been realized. A device characterization should estimate visibility and phase drift from the three-point interferometric calibration; estimate from time-ordered jump probes; estimate with explicit loss accounting; estimate from the target-stop walk; and fit separately for the H6(a), N2, and N3 routes. A held-out model-selection block should reject the iid/single-jump abstraction when a Markov or drift model is favored. The resulting joint uncertainty should be propagated through equation (37), rather than by multiplying marginal 99% intervals.
Several theory problems remain open. A native 11-qutrit ternary-Golay decoding circuit should be constructed and its error propagation analyzed. The complete-instrument stability theorem needs device-specific bounds, an explicit leakage space, and a stopping-time or truncation analysis for unbounded protocols. The route-dependent budget should be recast in a common channel metric if a fault-tolerance theorem is desired. Finally, the charge-conjugation reference channel should not be identified with the dynamically gauged model studied in the separate G campaign: the present charge-conjugation defect has dimension , whereas the transposition-flux anyon in the gauged theory has dimension 3. Quantum-double circuit work [4, 5] is therefore a comparison, not a direct hardware implementation of this defect model.
Conclusion
We have written the charge- qutrit route as a conditional, auditable theory rather than as an unconditional universal-fault-tolerance claim. The central structural result is the reference-assisted closure theorem, which separates record blindness, reduced-channel mixing, and retained-reference coherence. The registered operation algebra and reproduced ternary Golay calculation then provide a conditional route from charge-conjugation defects to non-stabilizer qutrit resources. The accepted-run budget quantifies which error assumptions are being made and exposes the route dependence of the coherence term. The remaining work is a native decoder construction and an experimental parameter determination.
Acknowledgments
The research program was designed and directed by the author. Derivations, computations, code, figures and drafting used AI assistance (Anthropic Claude), and computational checks and AI-assisted review used OpenAI Codex. These checks do not constitute independent human peer review. The author takes full responsibility for the content. This work received no external funding.
Golay polynomials and exact conventions
For reproducibility, the polynomials used in equation (25) are listed here in ascending powers of :
The ideal acceptance expansion is
The acceptance is exactly , and . The v0.3 independent validation reconstructs both integer polynomials and uses exact root counts, independently reproducing the original exact twirled calculation. For the untwirled binary family it separately enumerates all signed CSS input patterns, strengthening the historical floating-point/rationalized check. Writing for the unnormalized target overlap and for acceptance, the crossing polynomial factors as
Here . The binary input family is physical for , whereas the registered comparison uses . The acceptance is strictly positive on : its nonnegative Bernstein coefficients give . The quartic factor is
so the complete set of real roots is
Only lies in the open registered half-range. The other interior physical fixed points are and . At , the binary state is , not . For the fixed target , the sign of , where , is successively , , , on the four intervals separated by these three interior roots. Thus the root also changes the direction of target-infidelity improvement; it is outside the registered half-range. These checks certify the finite-code, product-input maps; they make no statement about arbitrary physical noise.
Data and code availability
The code-and-data archive paperF_code_data_v1.0.0.zip accompanies this preprint as an arXiv ancillary file. It contains the original frozen F1–F4 inputs, code, results and provenance; the F5-S synthetic protocol; the reference and budget analyses; the exact decoder, matrix, channel and distillation checks; and the v0.4 root-domain check. The archive includes an environment specification, a combined verification command, and SHA-256 integrity manifests. Its README distinguishes regeneration from checks of stored results and explains the stage-isolation requirement for historical upstream seals. Manuscript sources and historical article drafts are excluded from the ancillary archive.
The numerical interface values remain those of the frozen calculations. The v0.2 displayed decoder probability and classical/Pauli count wording were incorrect; the corrected formula is equation (29), and the integer enumerator is unchanged. Historical correction and review records are retained without rewriting sealed campaign data. This release changes publication metadata and availability wording only; it adds no physical realization or device-noise claim. The work has received computational and AI review but no independent human verification.
Version DOI for the full reproducibility archive, including the manuscript and historical provenance: 10.5281/zenodo.24185612.
References
- [1]Zhengyan Darius Shi, Zhaoyu Han, Srinivas Raghu, and Ashvin Vishwanath. Charge-4e superconductor with parafermionic vortices: A path to universal topological quantum computation. (2026). arXiv:2602.06963v2.arxiv.org/abs/2602.06963
- [2]Sergey Bravyi, and Alexei Kitaev. Universal quantum computation with ideal Clifford gates and noisy ancillas. Physical Review A 71, 022316 (2005). doi:10.1103/PhysRevA.71.022316.DOI
- [3]Shiroman Prakash. Magic state distillation with the ternary Golay code. Proceedings of the Royal Society A 476, 20200187 (2020). doi:10.1098/rspa.2020.0187.DOI
- [4]Shawn X. Cui, Seung-Moon Hong, and Zhenghan Wang. Universal quantum computation with weakly integral anyons. Quantum Information Processing 14, 2687–2727 (2015). doi:10.1007/s11128-015-1016-y.DOI
- [5]Liyuan Chen, Yuanjie Ren, Ruihua Fan, and Arthur Jaffe. A universal circuit set using the S₃ quantum double. npj Quantum Information 11, 112 (2025). doi:10.1038/s41534-025-01063-4.DOI
- [6]Stephen D. Bartlett, Terry Rudolph, and Robert W. Spekkens. Reference frames, superselection rules, and quantum information. Reviews of Modern Physics 79, 555–609 (2007). doi:10.1103/RevModPhys.79.555.DOI
- [7]Maissam Barkeshli, Parsa Bonderson, Meng Cheng, and Zhenghan Wang. Symmetry fractionalization, defects, and gauging of topological phases. Physical Review B 100, 115147 (2019). doi:10.1103/PhysRevB.100.115147.DOI
- [8]Adrian Hutter, and Daniel Loss. Quantum computing with parafermions. Physical Review B 93, 125105 (2016). doi:10.1103/PhysRevB.93.125105.DOI
- [9]D. M. Appleby. Symmetric informationally complete–positive operator valued measures and the extended Clifford group. Journal of Mathematical Physics 46, 052107 (2005). doi:10.1063/1.1896384.DOI
- [10]Shawn X. Cui, and Zhenghan Wang. Universal quantum computation with metaplectic anyons. Journal of Mathematical Physics 56, 032202 (2015). doi:10.1063/1.4914941.DOI
- [11]David Gross. Hudson’s theorem for finite-dimensional quantum systems. Journal of Mathematical Physics 47, 122107 (2006). doi:10.1063/1.2393152.DOI
- [12]Earl T. Campbell, Hussain Anwar, and Dan E. Browne. Magic-state distillation in all prime dimensions using quantum Reed–Muller codes. Physical Review X 2, 041021 (2012). doi:10.1103/PhysRevX.2.041021.DOI
- [13]Parsa Bonderson, Kirill Shtengel, and J. K. Slingerland. Interferometry of non-Abelian anyons. Annals of Physics 323, 2709–2755 (2008). doi:10.1016/j.aop.2008.01.012.DOI