A Quantum ISA for High-Level Programming, Enabling Sequential Execution and Conditional Branching

• URL: http://arxiv.org/abs/2410.06779v2
• Date: Sat, 12 Oct 2024 17:48:47 GMT
• Title: A Quantum ISA for High-Level Programming, Enabling Sequential Execution and Conditional Branching
• Authors: Francesco Junior De Gregorio,
• Abstract summary: The paper introduces a novel quantum instruction set architecture that abstracts quantum circuits to support high-level programming paradigms. By separating concerns between hardware and software, the proposed architecture simplifies quantum algorithm development.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: This paper introduces a novel quantum instruction set architecture that abstracts quantum circuits to support high-level programming paradigms, including sequential execution and branching. By separating concerns between hardware and software, the proposed architecture simplifies quantum algorithm development, allowing programmers to work with classical structures while still being able to exploit quantum-specific behavior . This abstraction enables developers to focus on algorithm design without being burdened by low-level circuit construction, thus facilitating both hardware optimization and software innovation. The proposed architecture represents a step forward in bridging the gap between classical and quantum programming.

Related papers

• 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)
• 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)
• 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.