Metraipolis › archive › dc_bf8072d31d41
qiskit-qudits: A Qiskit Extension for Simulating Qudit Circuits — arXiv:2608.22032
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22032
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T09:33:11.414Z
- SHA-256 of the archived text
73a35cd8acf1b2e99f654c034fdc6d714419fb68b1150373f17583edd5be8458- Stable URL of this page
https://metraipolis.com/documento/dc_bf8072d31d41
How to cite
qiskit-qudits: A Qiskit Extension for Simulating Qudit Circuits — arXiv:2608.22032 — arXiv (en), https://arxiv.org/abs/2608.22032 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf8072d31d41 (Metraipolis archive dc_bf8072d31d41, sha256 73a35cd8acf1b2e99f654c034fdc6d714419fb68b1150373f17583edd5be8458)
BibTeX
@misc{dcbf8072d31d41,
title = {qiskit-qudits: A Qiskit Extension for Simulating Qudit Circuits — arXiv:2608.22032},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22032},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf8072d31d41; sha256 73a35cd8acf1b2e99f654c034fdc6d714419fb68b1150373f17583edd5be8458},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22032. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
qiskit-qudits is a Qiskit extension that simulates d-level qudits by encoding each one into m = ceil(log_2 d) qubits. Qudit gates are exposed as ordinary Qiskit Gate and ControlledGate subclasses, and operations that are not unitary gates (measurement, reset, barrier, state preparation) as dedicated Instruction subclasses dispatched through a dedicated apply() hook; every gate carries both a dense encoded unitary (via NumPy's array protocol) and a qubit-level definition. Because d need not be a power of two, the encoded Hilbert space is generally larger than the logical one; the library resolves this by the identity-padding convention, in which every gate acts as the identity on the unphysical part of the encoded space. When every operand dimension is a power of two, gates decompose into a fixed, transpiler-recognisable cascade of standard qubit gates; otherwise the library falls back to exact dense unitary synthesis, so that dimensions 2 <= d <= 16 are supported exactly, not only powers of two. This paper describes the software's circuit model, gate hierarchy, decomposition strategy, and measurement/decoding machinery, states its limitations, and verifies the implementation numerically: the qudit QFT against the discrete Fourier transform for both power-of-two and non-power-of-two d, extending the check of the underlying theory paper, which could only be run for d = 2^m, and every gate's emitted decomposition against its dense unitary across the whole gate set. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-25 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2608.22032 — 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-10-18T09:27:54.373Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).