arXiv (All)
open access
High-Fidelity Universal Quantum Gate Compilation for Non-semisimple Ising Anyons via Genetic Algorithm-Optimized Solovay-Kitaev Decomposition
Non-semisimple Ising anyons extend the fusion space of conventional Ising models and offer a new route toward universal topological quantum computation (TQC). However, how to construct a high-fidelity universal quantum gate set that meets fault-tolerant thresholds via braiding operations of non-semi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Factorized Boolean representations for efficient quantum synthesis#819473
- Factorized Boolean representations for efficient quantum synthesis#809477
- Measurement-free, scalable, and fault-tolerant universal quantum computing.#165838
- Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code#1326230
- Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation#1155103
Record · ID 1490411
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive