Qmod: Expressive High-Level Quantum Modeling

• URL: http://arxiv.org/abs/2502.19368v1
• Date: Wed, 26 Feb 2025 18:04:01 GMT
• Title: Qmod: Expressive High-Level Quantum Modeling
• Authors: Matan Vax, Peleg Emanuel, Eyal Cornfeld, Israel Reichental, Ori Opher, Ori Roth, Tal Michaeli, Lior Preminger, Lior Gazit, Amir Naveh, Yehuda Naveh,
• Abstract summary: Quantum computing hardware is advancing at a rapid pace, yet the lack of high-level programming abstractions remains a serious bottleneck.<n>This paper presents Qmod, a high-level quantum programming language designed to capture algorithmic intent in natural terms.
• Score: 0.16365624921211983
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing hardware is advancing at a rapid pace, yet the lack of high-level programming abstractions remains a serious bottleneck in the development of new applications. Widely used frameworks still rely on gate-level circuit descriptions, causing the algorithm's functional intent to become lost in low-level implementation details, and hindering flexibility and reuse. While various high-level quantum programming languages have emerged in recent years - offering a significant step toward higher abstraction - many still lack support for classical-like expression syntax, and native constructs for useful quantum algorithmic idioms. This paper presents Qmod, a high-level quantum programming language designed to capture algorithmic intent in natural terms while delegating implementation decisions to automation. Qmod introduces quantum numeric variables and expressions, including digital fixed-point arithmetic tuned for compact representations and optimal resource usage. Beyond digital encoding, Qmod also supports non-digital expression modes - phase and amplitude encoding - frequently exploited by quantum algorithms to achieve computational advantages. We describe the language's constructs, demonstrate practical usage examples, and outline future work on evaluating Qmod across a broader set of use cases.

Related papers

• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Unitary Expressions: A Necessary Abstraction for Extensible Quantum Programming Languages and Systems [0.21756081703276003]
  We introduce the OpenQudit system for describing, parsing, optimizing, analyzing, and utilizing programs comprising gates described as symbolic unitary expressions.<n>QGL is a unitary-specific expression language, and implement a differentiating just-in-time compiler in OpenQudit.<n>Our QVM can compute approximately ten times faster than current leading numerical quantum compilation frameworks.
  arXiv  Detail & Related papers  (2025-01-16T17:05:41Z)
• Design and synthesis of scalable quantum programs [0.8007726207322294]
  We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity.<n>The quantum program is expressed in terms of a high-level model together with constraints and objectives on the final program.<n>The technology adapts electronic design automation methods to quantum computing, finding feasible implementations in a virtually unlimited functional space.
  arXiv  Detail & Related papers  (2024-12-10T10:12:03Z)
• ONDA: A High-Level Quantum Programming Language with Sequential Execution and Conditional Branching [0.0]
  ONDA is a quantum programming language designed to significantly simplify quantum programming. ONDA compiles into quantum instructions executed autonomously by specialized quantum hardware. By leveraging a quantum microarchitecture that autonomously processes compiled instructions, ONDA facilitates the intuitive implementation of high-level quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-09T11:16:29Z)
• Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computers [0.52197339162908]
  We introduce Qrisp, a framework designed to bridge several gaps between high-level programming paradigms and quantum hardware. Qrisp's standout feature is its ability to compile programs to the circuit level, making them executable on most existing physical backends.
  arXiv  Detail & Related papers  (2024-06-20T23:40:22Z)
• Qwerty: A Basis-Oriented Quantum Programming Language [0.4999814847776098]
  We present Qwerty, a new quantum programming language that allows programmers to manipulate qubits more expressively than gates. Qwerty is a powerful framework for high-level quantum-classical computation.
  arXiv  Detail & Related papers  (2024-04-19T03:13:43Z)
• 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)
• Qafny: A Quantum-Program Verifier [39.47005122712576]
  We present Qafny, an automated proof system for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations. We show how Qafny can efficiently verify important quantum algorithms, including quantum-walk algorithms, Grover's algorithm, and Shor's algorithm.
  arXiv  Detail & Related papers  (2022-11-11T18:50:52Z)
• 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)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.