ONDA: A High-Level Quantum Programming Language with Sequential Execution and Conditional Branching

• URL: http://arxiv.org/abs/2410.06779v3
• Date: Tue, 18 Mar 2025 17:49:15 GMT
• Title: ONDA: A High-Level Quantum Programming Language with Sequential Execution and Conditional Branching
• Authors: Francesco Junior De Gregorio,
• Abstract summary: ONDA is a quantum programming language designed to significantly simplify quantum programming.<n>ONDA compiles into quantum instructions executed autonomously by specialized quantum hardware.<n>By leveraging a quantum microarchitecture that autonomously processes compiled instructions, ONDA facilitates the intuitive implementation of high-level quantum algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: This paper introduces ONDA, a quantum programming language designed to significantly simplify quantum programming by providing multiple abstraction layers similar to those found in classical computing. Unlike traditional quantum programming languages, which primarily focus on circuit construction, ONDA compiles into quantum instructions executed autonomously by specialized quantum hardware, eliminating the need for classical assistance. The proposed architecture uniquely supports sequential execution, branching, and the direct implementation of classical control structures such as conditional statements and loops (e.g., if, do-while) entirely within the quantum domain. By leveraging a quantum microarchitecture that autonomously processes compiled instructions, ONDA facilitates the intuitive implementation of high-level quantum algorithms, reducing complexity and broadening access to quantum programming to promote wider adoption and accelerate advancements in quantum computing.

Related papers

• QCircuitNet: A Large-Scale Hierarchical Dataset for Quantum Algorithm Design [17.747641494506087]
  We introduce QCircuitNet, the first benchmark and test dataset designed to evaluate AI's capability in designing and implementing quantum algorithms. Unlike using AI for writing traditional codes, this task is fundamentally different and significantly more complicated due to highly flexible design space and intricate manipulation of qubits.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs [7.042810171786408]
  We propose a notion of quantum register machine, the first purely quantum architecture (including an instruction set) that supports quantum control flows. Based on quantum register machine, we describe the first comprehensive implementation process of quantum recursion programs. Our efficient implementation of quantum algorithms also offers automatic parallelisation of quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-19T14:48:41Z)
• Utilizing classical programming principles in the Intel Quantum SDK: implementation of quantum lattice Boltzmann method [1.4426921903884633]
  We explore the use of classical programming techniques in implementing the quantum lattice Boltzmann method in the Intel Quantum SDK. The novelty of this work lies in leveraging classical techniques for the implementation of quantum algorithms.
  arXiv  Detail & Related papers  (2024-07-05T07:30:25Z)
• Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects [0.0]
  In this survey, we explore the feasibility of an integrated design and optimization scheme that spans from the algorithmic level to quantum hardware, combining the steps of logic circuit design and compilation optimization. Leveraging the exceptional cognitive and learning capabilities of AI algorithms, one can reduce manual design costs, enhance the precision and efficiency of execution, and facilitate the implementation and validation of the superiority of quantum algorithms on hardware.
  arXiv  Detail & Related papers  (2024-06-30T15:50:10Z)
• 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)
• 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)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Program Scheduling [48.142860424323395]
  We introduce the Quantum Program Scheduling Problem (QPSP) to improve the utility efficiency of quantum resources. Specifically, a quantum program scheduling method concerning the circuit width, number of measurement shots, and submission time of quantum programs is proposed to reduce the execution latency.
  arXiv  Detail & Related papers  (2024-04-11T16:12:01Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Compilation of Entangling Gates for High-Dimensional Quantum Systems [2.6389356041253262]
  We introduce a complete workflow for compiling any two-qudit unitary into an arbitrary native gate set. Case studies demonstrate the feasibility of both, the proposed approach as well as the corresponding implementation.
  arXiv  Detail & Related papers  (2023-01-10T19:00:01Z)
• Parametric Synthesis of Computational Circuits for Complex Quantum Algorithms [0.0]
  The purpose of our quantum synthesizer is enabling users to implement quantum algorithms using higher-level commands. The proposed approach for implementing quantum algorithms has a potential application in the field of machine learning.
  arXiv  Detail & Related papers  (2022-09-20T06:25:47Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Paulihedral: A Generalized Block-Wise Compiler Optimization Framework For Quantum Simulation Kernels [17.038656780131692]
  Paulihedral is a block-wise compiler framework that can deeply optimize the quantum simulation kernel. We show that Paulihedral can outperform state-of-the-art compiler infrastructures in a wide-range of applications on both near-term superconducting quantum processors and future fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2021-09-07T23:52:58Z)
• QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-05-17T16:17:57Z)
• Composable Programming of Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-01-20T14:20:14Z)
• Architecture aware compilation of quantum circuits via lazy synthesis [0.0]
  We propose a meta-heuristic that couples the iterative approach of SWAP insertion techniques with greedy architecture aware synthesis routines. We show that our algorithms show significant reduction in the entangling gate overhead due to compilation.
  arXiv  Detail & Related papers  (2020-12-17T15:20:02Z)
• 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)
• Extending XACC for Quantum Optimal Control [70.19683407682642]
  Quantum computing vendors are beginning to open up application programming for direct pulse-level quantum control. We present an extension to the XACC system-level quantum-classical software framework. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences.
  arXiv  Detail & Related papers  (2020-06-04T13:13:55Z)

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.