OpenQudit: Extensible and Accelerated Numerical Quantum Compilation via a JIT-Compiled DSL

• URL: http://arxiv.org/abs/2511.16585v1
• Date: Thu, 20 Nov 2025 17:37:42 GMT
• Title: OpenQudit: Extensible and Accelerated Numerical Quantum Compilation via a JIT-Compiled DSL
• Authors: Ed Younis,
• Abstract summary: This paper introduces OpenQudit, a compilation framework that allows users to define quantum operations symbolically.<n>OpenQudit's ahead-of-time compiler uses a tensor network representation and an e-graph-based pass for symbolic simplification.<n>The evaluation shows that this symbolic approach is highly effective, accelerating the core instantiation task by up to $mathttsim20times$ on common quantum circuit synthesis problems.
• Score: 0.4264192013842096
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-performance numerical quantum compilers rely on classical optimization, but are limited by slow numerical evaluations and a design that makes extending them with new instructions a difficult, error-prone task for domain experts. This paper introduces OpenQudit, a compilation framework that solves these problems by allowing users to define quantum operations symbolically in the Qudit Gate Language (QGL), a mathematically natural DSL. OpenQudit's ahead-of-time compiler uses a tensor network representation and an e-graph-based pass for symbolic simplification before a runtime tensor network virtual machine (TNVM) JIT-compiles the expressions into high-performance native code. The evaluation shows that this symbolic approach is highly effective, accelerating the core instantiation task by up to $\mathtt{\sim}20\times$ on common quantum circuit synthesis problems compared to state-of-the-art tools.

Related papers

• Constant-time hybrid compilation of Shor's algorithm with quantum just-in-time compilation [0.0]
  This work provides an implementation of Shor's factoring algorithm, compiled to elementary quantum gates using PennyLane and Catalyst.<n>We demonstrate that with QJIT compilation, the algorithm is compiled once per bit width of $N$, even when $N$-specific optimizations are applied to circuit generation.<n>The implementation is benchmarked up to 32-bit $N$, and both the size of the compiled program and the pure compilation time are found to be constant.
  arXiv  Detail & Related papers  (2025-04-16T19:30:10Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• A High Performance Compiler for Very Large Scale Surface Code Computations [38.26470870650882]
  We present the first high performance compiler for very large scale quantum error correction. It translates an arbitrary quantum circuit to surface code operations based on lattice surgery. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device.
  arXiv  Detail & Related papers  (2023-02-05T19:06:49Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers [0.0]
  Open-source software package, Arline Benchmarks, is designed to perform automated benchmarking of quantum compilers. We compare several quantum compilation frameworks based on a set of important metrics. We propose a concept of composite compilation pipeline that combines compiler-specific circuit optimizations in a single compilation stack.
  arXiv  Detail & Related papers  (2022-02-28T18:48:01Z)
• Verified Compilation of Quantum Oracles [10.942063551929914]
  VQO is a high-assurance quantum programming framework. OQASM is the oracle quantum assembly language. VQO's versions were on par with or better than (in terms of both qubit and gate counts) oracles produced by Quipper.
  arXiv  Detail & Related papers  (2021-12-13T14:36:36Z)
• Enabling a Programming Environment for an Experimental Ion Trap Quantum Testbed [0.615738282053772]
  Ion trap quantum hardware promises to provide a computational advantage over classical computing for specific problem spaces. Ion trap systems currently require both strategies to mitigate high levels of noise and also tools to ease the challenge of programming these systems with pulse- or gate-level operations. This work focuses on improving the state-of-the-art for quantum programming of ion trap testbeds through the use of a quantum language specification, QCOR.
  arXiv  Detail & Related papers  (2021-10-30T02:28:36Z)
• Enabling Retargetable Optimizing Compilers for Quantum Accelerators via a Multi-Level Intermediate Representation [78.8942067357231]
  We present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable, ahead-of-time compiler. We support the entire gate-based OpenQASM 3 language and provide custom extensions for common quantum programming patterns and improved syntax. Our work results in compile times that are 1000x faster than standard Pythonic approaches, and 5-10x faster than comparative standalone quantum language compilers.
  arXiv  Detail & Related papers  (2021-09-01T17:29:47Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• A MLIR Dialect for Quantum Assembly Languages [78.8942067357231]
  We demonstrate the utility of the Multi-Level Intermediate Representation (MLIR) for quantum computing. We extend MLIR with a new quantum dialect that enables the expression and compilation of common quantum assembly languages. We leverage a qcor-enabled implementation of the QIR quantum runtime API to enable a retargetable (quantum hardware agnostic) compiler workflow.
  arXiv  Detail & Related papers  (2021-01-27T13:00:39Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)

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.