Metraipolis › archive › dc_91cb302ebbbf

Qyantram: A Transparent and Verifiable Quantum Computing Platform — arXiv:2611.03262

Source: arXiv (en)
Original: https://arxiv.org/abs/2611.03262
License (as archived): CC0-1.0
Archived: 2026-11-03T18:59:24.649Z
SHA-256 of the archived text: 6b852692d3d1589194dd4dbcf12780a239a47b1bf9b84b32f491e8e2516928d6
Stable URL of this page: https://metraipolis.com/documento/dc_91cb302ebbbf

How to cite

Qyantram: A Transparent and Verifiable Quantum Computing Platform — arXiv:2611.03262 — arXiv (en), https://arxiv.org/abs/2611.03262 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_91cb302ebbbf (Metraipolis archive dc_91cb302ebbbf, sha256 6b852692d3d1589194dd4dbcf12780a239a47b1bf9b84b32f491e8e2516928d6)

BibTeX

@misc{dc91cb302ebbbf,
  title = {Qyantram: A Transparent and Verifiable Quantum Computing Platform — arXiv:2611.03262},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03262},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_91cb302ebbbf; sha256 6b852692d3d1589194dd4dbcf12780a239a47b1bf9b84b32f491e8e2516928d6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03262. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Most quantum circuit platforms focus on idealized circuit assembly and simulation, hiding hardware compilation, error identification, and variational model training behind black-box operations. QYANTRAM addresses this gap through an open platform comprising four subsystems, built around evidence-backed results and independent verification. Its staged compilation pipeline makes every transformation traceable, while the router publishes rejected SWAP candidates and their scores for transparent decision-making. Verification exploits inactive qubits remaining in the |0> state, reducing complexity from 2^N to 2^k for k active qubits. This mathematically exact reduction enables full pre-compilation verification on 127- and 156-qubit layouts, achieving approximately 10,000x speed-ups with execution times below one millisecond. The error identification engine exhaustively evaluates all Pauli error patterns without sampling, matching closed-form predictions within 2.8e-17. Its machine-learning engine achieves numerical agreement within 2.0e-15 of qiskit.quantum_info while training 25-50 times faster. The router introduces approximately 1.27x more SWAP gates than Qiskit's SABRE due to its omission of optimization, trading routing efficiency for complete decision transparency and traceability.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.ET, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Emerging Technologies (cs.ET).
Pagina del lavoro: https://arxiv.org/abs/2611.03262 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:19:24.721Z dalla pagina https://arxiv.org/list/cs.ET/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).