Productive Quantum Programming Needs Better Abstract Machines

• URL: http://arxiv.org/abs/2505.00718v1
• Date: Thu, 17 Apr 2025 17:00:06 GMT
• Title: Productive Quantum Programming Needs Better Abstract Machines
• Authors: Santiago Núñez-Corrales, Olivia Di Matteo, John Dumbell, Marcus Edwards, Edoardo Giusto, Scott Pakin, Vlad Stirbu,
• Abstract summary: We explain why having the "right" quantum abstract machine (QAM) is essential for making progress in the field.<n>We propose a novel framework for evaluating QAMs based on a set of desirable criteria.
• Score: 1.0365583543874495
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An effective, accessible abstraction hierarchy has made using and programming computers possible for people across all disciplines. Establishing such a hierarchy for quantum programming is an outstanding challenge, especially due to a proliferation of different conventions and the rapid pace of innovation. One critical portion of the hierarchy is the abstract machine, the layer that separates a programmer's mental model of the hardware from its physical realization. Drawing on historical parallels in classical computing, we explain why having the "right" quantum abstract machine (QAM) is essential for making progress in the field and propose a novel framework for evaluating QAMs based on a set of desirable criteria. These criteria capture aspects of a QAM such as universality, compactness, expressiveness, and composability, which aid in the representation of quantum programs. By defining this framework we take steps toward defining an optimal QAM. We further apply our framework to survey the landscape of existing proposals, draw comparisons, and assess them based on our criteria. While these proposals share many common strengths, we find that each falls short of our ideal. Our framework and our findings set a direction for subsequent efforts to define a future QAM that is both straightforward to map to a variety of quantum computers, and provides a stable abstraction for quantum software development.

Related papers

• A Framework for Quantum Advantage [30.07551633400823]
  We aim to articulate an operational definition for quantum advantage that is both platform-agnostic and empirically verifiable.<n>We outline our vision for the near future, in which quantum computers enhance existing high-performance computing platforms.
  arXiv  Detail & Related papers  (2025-06-25T17:53:35Z)
• 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)
• 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)
• An Abstraction Hierarchy Toward Productive Quantum Programming [0.3640881838485995]
  We propose an abstraction hierarchy to support quantum software engineering. We discuss the consequences of overlaps across the programming, execution, and hardware models found in current technologies. While our work points to concrete conceptual challenges and gaps in quantum programming, our primary thesis is that progress hinges on thinking about the abstraction hierarchy holistically.
  arXiv  Detail & Related papers  (2024-05-22T18:48:36Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• 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)
• Assessing requirements to scale to practical quantum advantage [56.22441723982983]
  We develop a framework for quantum resource estimation, abstracting the layers of the stack, to estimate resources required for large-scale quantum applications. We assess three scaled quantum applications and find that hundreds of thousands to millions of physical qubits are needed to achieve practical quantum advantage. A goal of our work is to accelerate progress towards practical quantum advantage by enabling the broader community to explore design choices across the stack.
  arXiv  Detail & Related papers  (2022-11-14T18:50:27Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quingo: A Programming Framework for Heterogeneous Quantum-Classical Computing with NISQ Features [0.0]
  We propose the Quingo framework to integrate and manage quantum-classical software and hardware to provide the programmability over HQCC applications. We also propose the Quingo programming language, an external domain-specific language highlighting timer-based timing control and opaque operation definition.
  arXiv  Detail & Related papers  (2020-09-02T06:42:51Z)

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.