Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Adaptive Modular Language for Quantum Computing (AMQL)

Jincheng Zhang

Published Aug 31, 2026• 0 citations
Publisher

Abstract

This paper introduces Adaptive Modular Language for Quantum Computing (AMQL), a novel programming language designed to enhance quantum computing development through a specifically tailored approach. AMQL incorporates quantum mechanics concepts directly into the language's syntax and semantics, facilitating easier quantum circuit design, robust error mitigation, and reliable verification. The design prioritizes intuitive representation of quantum states and operations, aiming to reduce the cognitive burden on developers and accelerate the creation of complex quantum algorithms. This paper details the language's core features, the rationale behind its design choices, and preliminary results demonstrating its potential to streamline quantum programming workflows.

DOI
10.5281/zenodo.22194300

Related papers

Modular Logic for Parallel Quantum Computing

Jincheng Zhang

This paper investigates the potential of modular logic to revolutionize parallel quantum computing, addressing the challenges of scalability and fault tolerance. We propose a novel system leveraging formal language and reasoning to design and orchestrate quantum computations, promoting independent and verifiable execution of computational modules within a quantum circuit. The core mechanism centers around a language that explicitly defines the logical relationships between modules, enabling automated circuit design and optimization. This approach seeks to overcome the limitations of traditional quantum programming by enhancing expressiveness, simplifying verification, and facilitating a more robust and scalable approach to quantum computation. The paper details the proposed system, its reasoning framework, and preliminary results demonstrating improvements in circuit design and verification.

•Sep 5, 2026•0 citations

Dynamic Topological Quantum Circuit Design Language

Jincheng Zhang

This paper introduces a novel programming language, the Dynamic Topological Quantum Circuit Design Language (DTQCDL), designed to directly represent and generate quantum circuits based on their topological structure. The core mechanism relies on a formal definition of quantum circuit topology combined with automated reasoning to produce executable quantum circuits. The language aims to simplify the complex design process of quantum circuits, thereby reducing the barriers to entry for quantum computing. This document outlines the key features, syntax, and underlying principles of DTQCDL, highlighting its potential for streamlining quantum circuit development and facilitating broader adoption of quantum technologies. The system focuses on providing a high-level abstraction that allows users to express quantum circuit concepts without needing to deeply understand the low-level details of gate implementation. The automated reasoning component ensures the correctness and efficiency of the generated circuits.

•Aug 29, 2026•0 citations

Qutes: A High-Level Quantum Programming Language for Simplified Quantum Computing

Simone Faro, Francesco Pio Marino, Gabriele Messina

Quantum computing leverages the principles of quantum mechanics to perform computations far beyond the capabilities of classical systems, particularly in fields such as cryptography and optimization. However, current quantum programming languages often require low-level implementation, posing significant barriers for many developers due to their steep learning curve and limited abstraction. In response, we introduce Qutes, a high-level quantum programming language designed to simplify quantum algorithm development while maintaining the flexibility required for advanced applications. By abstracting complex quantum operations and allowing intuitive expressions through high-level constructs, Qutes enables users to write efficient quantum programs without extensive knowledge of quantum mechanics or circuit design. Built upon Qiskit, Qutes translates its syntax directly into executable quantum code, facilitating seamless integration with quantum hardware. This paper provides an overview of the language's architecture, core functionalities, and its ability to unify classical and quantum operations within a single framework. Additionally, we demonstrate Qutes' application in key quantum algorithms, showcasing its potential to make quantum programming more accessible and practical for a wider range of developers and researchers.

ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)•Jul 20, 2025•2 citations

Extending Qutes: a practical high-level language for quantum computing

Simone Faro, Francesco Pio Marino, Gabriele Messina

Abstract Quantum computing offers transformative capabilities by exploiting quantum mechanical principles to solve problems that are intractable for classical systems, particularly in areas like cryptography, optimization, and data analysis. However, most current quantum programming languages operate at a low level, requiring in-depth expertise in quantum mechanics and circuit theory, which presents a barrier to wider adoption. In this work, we introduce Qutes, a high-level quantum programming language that simplifies the development of quantum algorithms while preserving the flexibility needed for advanced applications. Qutes abstracts low-level quantum operations through intuitive syntax and high-level constructs, enabling developers to express complex algorithms without detailed circuit knowledge. Built atop Qiskit, Qutes transpiles seamlessly into executable code, ensuring compatibility with real quantum hardware. We present the architecture, language design, and hybrid classical-quantum integration of Qutes, and demonstrate its use through implementations of canonical quantum algorithms. Our results highlight Qutes’ potential to democratize quantum programming by lowering the entry threshold and accelerating prototyping for researchers and developers alike.

The Computer Journal•Oct 22, 2025•0 citations

quAPL: Modeling Quantum Computation in an Array Programming Language

Santiago Núñcz-Corrales, Marcos Frenkel, Bruno Ricardi de Abreu

Most contemporary quantum programming languages describe computation as circuits, using a host classical counterpart to drive the execution of quantum programs. However, the circuit model adds expensive complexity to quantum algorithmic development and decreases the transparency of connections between syntax and formal semantics in quantum programs. We argue that producing a high-level quantum programming language without reference to circuits is possible and necessary. We summarize desirable features in future high-level quantum programming languages and provide evidence supporting array pro-gramming languages as a natural paradigm for quantum algorithmic expression at the circuit level and beyond. We highlight why APL is a profitable host programming language to attain this goal progressively. In particular, we demonstrate how features provided by APL, such as native support of complex numbers and matrix operations, naturally capture quan-tum operations while bringing a less cluttered syntax that encodes and encapsulates the linear character of quantum circuit execution. We discuss implementation details of quAPL, an APL library for quantum circuit specification, simulation, and execution intended to provide a gradual ramp toward developing composable procedural abstractions. Finally, we discuss the broader implications of our work and the next steps in our research program.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•2 citations

Quantum Topology Language (QTTL) – Automated Generation of Quantum Algorithms and Quantum Computing Models

Jincheng Zhang

Quantum topology, a burgeoning field of physics, promises revolutionary advancements in computation and information processing. Within this landscape, Quantum Topology Language (QTTL) emerges as a novel framework for automating the creation of quantum algorithms and models, significantly accelerating the research and development process. This paper explores the concept of QTTL and its potential to streamline quantum computing initiatives. We detail the core mechanism behind QTTL, focusing on leveraging the unique properties of quantum topology to generate effective and adaptable quantum algorithms. The benefits of automated QTTL generation are discussed, including reduced development costs and accelerated innovation within the quantum computing community.

•Sep 3, 2026•0 citations
This paper introduces Adaptive Modular Language for Quantum Computing (AMQL), a novel programming language designed to enhance quantum computing development through a specifically tailored approach. AMQL incorporates quantum mechanics concepts directly into the language's syntax and semantics, facilitating easier quantum circuit design, robust error mitigation, and reliable verification. The design prioritizes intuitive representation of quantum states and operations, aiming to reduce the cognitive burden on developers and accelerate the creation of complex quantum algorithms. This paper details the language's core features, the rationale behind its design choices, and preliminary results demonstrating its potential to streamline quantum programming workflows.
This paper investigates the potential of modular logic to revolutionize parallel quantum computing, addressing the challenges of scalability and fault tolerance. We propose a novel system leveraging formal language and reasoning to design and orchestrate quantum computations, promoting independent and verifiable execution of computational modules within a quantum circuit. The core mechanism centers around a language that explicitly defines the logical relationships between modules, enabling automated circuit design and optimization. This approach seeks to overcome the limitations of traditional quantum programming by enhancing expressiveness, simplifying verification, and facilitating a more robust and scalable approach to quantum computation. The paper details the proposed system, its reasoning framework, and preliminary results demonstrating improvements in circuit design and verification.
This paper introduces a novel programming language, the Dynamic Topological Quantum Circuit Design Language (DTQCDL), designed to directly represent and generate quantum circuits based on their topological structure. The core mechanism relies on a formal definition of quantum circuit topology combined with automated reasoning to produce executable quantum circuits. The language aims to simplify the complex design process of quantum circuits, thereby reducing the barriers to entry for quantum computing. This document outlines the key features, syntax, and underlying principles of DTQCDL, highlighting its potential for streamlining quantum circuit development and facilitating broader adoption of quantum technologies. The system focuses on providing a high-level abstraction that allows users to express quantum circuit concepts without needing to deeply understand the low-level details of gate implementation. The automated reasoning component ensures the correctness and efficiency of the generated circuits.
Quantum computing leverages the principles of quantum mechanics to perform computations far beyond the capabilities of classical systems, particularly in fields such as cryptography and optimization. However, current quantum programming languages often require low-level implementation, posing significant barriers for many developers due to their steep learning curve and limited abstraction. In response, we introduce Qutes, a high-level quantum programming language designed to simplify quantum algorithm development while maintaining the flexibility required for advanced applications. By abstracting complex quantum operations and allowing intuitive expressions through high-level constructs, Qutes enables users to write efficient quantum programs without extensive knowledge of quantum mechanics or circuit design. Built upon Qiskit, Qutes translates its syntax directly into executable quantum code, facilitating seamless integration with quantum hardware. This paper provides an overview of the language's architecture, core functionalities, and its ability to unify classical and quantum operations within a single framework. Additionally, we demonstrate Qutes' application in key quantum algorithms, showcasing its potential to make quantum programming more accessible and practical for a wider range of developers and researchers.
Abstract Quantum computing offers transformative capabilities by exploiting quantum mechanical principles to solve problems that are intractable for classical systems, particularly in areas like cryptography, optimization, and data analysis. However, most current quantum programming languages operate at a low level, requiring in-depth expertise in quantum mechanics and circuit theory, which presents a barrier to wider adoption. In this work, we introduce Qutes, a high-level quantum programming language that simplifies the development of quantum algorithms while preserving the flexibility needed for advanced applications. Qutes abstracts low-level quantum operations through intuitive syntax and high-level constructs, enabling developers to express complex algorithms without detailed circuit knowledge. Built atop Qiskit, Qutes transpiles seamlessly into executable code, ensuring compatibility with real quantum hardware. We present the architecture, language design, and hybrid classical-quantum integration of Qutes, and demonstrate its use through implementations of canonical quantum algorithms. Our results highlight Qutes’ potential to democratize quantum programming by lowering the entry threshold and accelerating prototyping for researchers and developers alike.
Most contemporary quantum programming languages describe computation as circuits, using a host classical counterpart to drive the execution of quantum programs. However, the circuit model adds expensive complexity to quantum algorithmic development and decreases the transparency of connections between syntax and formal semantics in quantum programs. We argue that producing a high-level quantum programming language without reference to circuits is possible and necessary. We summarize desirable features in future high-level quantum programming languages and provide evidence supporting array pro-gramming languages as a natural paradigm for quantum algorithmic expression at the circuit level and beyond. We highlight why APL is a profitable host programming language to attain this goal progressively. In particular, we demonstrate how features provided by APL, such as native support of complex numbers and matrix operations, naturally capture quan-tum operations while bringing a less cluttered syntax that encodes and encapsulates the linear character of quantum circuit execution. We discuss implementation details of quAPL, an APL library for quantum circuit specification, simulation, and execution intended to provide a gradual ramp toward developing composable procedural abstractions. Finally, we discuss the broader implications of our work and the next steps in our research program.
Quantum topology, a burgeoning field of physics, promises revolutionary advancements in computation and information processing. Within this landscape, Quantum Topology Language (QTTL) emerges as a novel framework for automating the creation of quantum algorithms and models, significantly accelerating the research and development process. This paper explores the concept of QTTL and its potential to streamline quantum computing initiatives. We detail the core mechanism behind QTTL, focusing on leveraging the unique properties of quantum topology to generate effective and adaptable quantum algorithms. The benefits of automated QTTL generation are discussed, including reduced development costs and accelerated innovation within the quantum computing community.