qiskit-qudits: A Qiskit Extension for Simulating Qudit Circuits

• URL: http://arxiv.org/abs/2608.22032v1
• Date: Sat, 22 Aug 2026 16:19:43 GMT
• Title: qiskit-qudits: A Qiskit Extension for Simulating Qudit Circuits
• Abstract summary: qiskit-qudits is a Qiskit extension that simulates d-level qudits by encoding each one into m = ceil(log d) qubits.<n> gates decompose into a fixed, transpiler-recognisable cascade of standard qubit gates.<n>This paper describes the software's circuit model, gate hierarchy, decomposition strategy, and measurement/decoding machinery.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions [45.88028371034407]
  Block encoding provides the standard method for accessing matrix data within quantum circuits.<n>We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian.
  arXiv  Detail & Related papers  (2026-03-12T19:35:16Z)
• An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem [0.0]
  Quantum circuits are typically represented by a (ordered) sequence of gates over a set of virtual qubits.<n>The Qubit Mapping Problem (QMP) is known to be NP-hard.<n>We present a flexible branch and bound algorithm for a generalized version of the QMP.
  arXiv  Detail & Related papers  (2025-08-29T15:35:16Z)
• Scalable modular architecture for universal quantum computation [45.989522481082986]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>We illustrate the approach with two examples, consisting of 10, respectively 127 qubits, inspired by IBM quantum processors.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Multi-controlled single-qubit unitary gates based on the quantum Fourier transform and deep decomposition [0.0]
  We will present a few new generalizations of the multi-controlled X (MCX) gate that uses the quantum Fourier transform (QFT)<n>First, we will optimize QFT-MCX and prove that it is equivalent to a stair MCX gates array.<n>The supremacy of our implementations over the best-known optimized algorithm will be demonstrated.
  arXiv  Detail & Related papers  (2024-08-01T21:56:02Z)
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing [17.731117502015355]
  Scheme for qubits with $XX+YY$ coupling realizes any two-qubit gate up to single-qubit gates.<n>We observe marked improvements across various applications, including generic $n$-qubit gate synthesis, quantum volume, and qubit routing.
  arXiv  Detail & Related papers  (2023-12-09T19:30:31Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Let Each Quantum Bit Choose Its Basis Gates [3.6690675649846396]
  Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits) In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits. This work aims to give quantum scientists the ability to run meaningful algorithms with qubit systems that are not perfectly uniform.
  arXiv  Detail & Related papers  (2022-08-29T05:55:55Z)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.