Artifact for the Paper "How Many Quantum Circuit Identities Are Needed to Generate All Others?"
Fuente:
Zenodo
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Recurso digital |
| Lingua: | inglese |
| Pubblicazione: |
Zenodo
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866902105319538688 |
|---|---|
| author | Ding, Yuantian Yu, Nengkun Qiu, Xiaokang |
| author_facet | Ding, Yuantian Yu, Nengkun Qiu, Xiaokang |
| contents | <div> <div>The artifact is a Rust core (with Python bindings via PyO3) and a set of Python</div> <div>driver scripts that reproduce every experimental table and figure in the paper.</div> <div>It covers six gate sets — `logical`, `clifford`, `clifford-t`,</div> <div>`common-clifford-t`, `clifford-t1/2`, and `clifford-rz(pi/3)` — and includes:</div> <br> <div>- ECC synthesis and pruning (Section 5.1),</div> <div>- a comparison against a naive baseline (Section 5.2.1),</div> <div>- proving identities from existing Quartz ECC sets (Section 5.2.2),</div> <div>- a fixed-point precision study (Section 5.2.3), and</div> <div>- an exportable proof viewer (Section 5.2.4).</div> <br> <div>For evaluation, we recommend a machine with at least 16-core CPU and 32 GB of RAM. A</div> <div>full sweep may take one to two days; you can stop at any point and inspect the</div> <div>partial results, or run a single configuration for a quick check.</div> <div> </div> <div>The most updated documentation is available <a href="https://github.com/YuantianDing/qcel-howmany">here</a>.</div> </div> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_20222265 |
| institution | Zenodo |
| language | eng |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Artifact for the Paper "How Many Quantum Circuit Identities Are Needed to Generate All Others?" Ding, Yuantian Yu, Nengkun Qiu, Xiaokang Quantum computers <div> <div>The artifact is a Rust core (with Python bindings via PyO3) and a set of Python</div> <div>driver scripts that reproduce every experimental table and figure in the paper.</div> <div>It covers six gate sets — `logical`, `clifford`, `clifford-t`,</div> <div>`common-clifford-t`, `clifford-t1/2`, and `clifford-rz(pi/3)` — and includes:</div> <br> <div>- ECC synthesis and pruning (Section 5.1),</div> <div>- a comparison against a naive baseline (Section 5.2.1),</div> <div>- proving identities from existing Quartz ECC sets (Section 5.2.2),</div> <div>- a fixed-point precision study (Section 5.2.3), and</div> <div>- an exportable proof viewer (Section 5.2.4).</div> <br> <div>For evaluation, we recommend a machine with at least 16-core CPU and 32 GB of RAM. A</div> <div>full sweep may take one to two days; you can stop at any point and inspect the</div> <div>partial results, or run a single configuration for a quick check.</div> <div> </div> <div>The most updated documentation is available <a href="https://github.com/YuantianDing/qcel-howmany">here</a>.</div> </div> |
| title | Artifact for the Paper "How Many Quantum Circuit Identities Are Needed to Generate All Others?" |
| topic | Quantum computers |
| url | https://doi.org/10.5281/zenodo.20222265 |