Cover Image

Productive Quantum Programming Needs Better Abstract Machines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Núñez-Corrales, Santiago, Di Matteo, Olivia, Dumbell, John, Edwards, Marcus, Giusto, Edoardo, Pakin, Scott, Stirbu, Vlad
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Formal Languages and Automata Theory Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Realisability and Complementability of Multiparty Session Types
by: Di Giusto, Cinzia, et al.
Published: (2025)

Synchronisability in Mailbox Communication
by: Di Giusto, Cinzia, et al.
Published: (2024)

Static Analysis Framework for Detecting Use-After-Free Bugs in C++
by: Teodorescu, Vlad-Alexandru, et al.
Published: (2024)

Notes on Stack Machines and Quantum Stack Machines
by: Qiu, Daowen
Published: (2025)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
by: Di Giusto, Cinzia, et al.
Published: (2025)

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
by: Caltais, Georgiana, et al.
Published: (2024)

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
by: Nepeivoda, Antonina, et al.
Published: (2025)

On the Impact of the Communication Model on Realisability
by: Di Giusto, Cinzia, et al.
Published: (2025)

Networks of Moore Machines
by: Yodaiken, Victor
Published: (2015)

Structural Abstraction and Refinement for Probabilistic Programs
by: Li, Guanyan, et al.
Published: (2025)

Tahr: The Generative Attribute Grammar Framework
by: Ciccaglione, Matteo, et al.
Published: (2025)

Digital Circuits as Moore Machines
by: Yodaiken, Victor
Published: (2010)

Imposing Rules in Process Discovery: an Inductive Mining Approach
by: Norouzifar, Ali, et al.
Published: (2024)

Random Testing of Model Checkers for Timed Automata with Automated Oracle Generation
by: Manini, Andrea, et al.
Published: (2025)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
by: Manini, Andrea, et al.
Published: (2026)

Characterizing normality via automata and random matrix products
by: Bienvenu, Laurent, et al.
Published: (2026)

On Decidability Timed Automata with 2 Parametric Clocks
by: Bersani, Marcello M., et al.
Published: (2025)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
by: Leys, Tim, et al.
Published: (2024)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
by: Briones, Laura Brandán, et al.
Published: (2025)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

Hyper-Minimization for Deterministic Register Automata
by: Li, Yong, et al.
Published: (2026)

Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Equivalence and Similarity Refutation for Probabilistic Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Measure Many Quantum Finite Automata on Infinite Words
by: Midya, Abhisek, et al.
Published: (2026)

Generalised Arc Consistency via the Synchronised Product of Finite Automata wrt a Constraint
by: Beldiceanu, Nicolas
Published: (2025)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
by: Geißler, Dominik, et al.
Published: (2025)

Self-Replicating Mechanical Universal Turing Machine
by: Lano, Ralph P.
Published: (2024)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)

Resolving Nondeterminism by Chance
by: Paul, Soumyajit, et al.
Published: (2025)

Type-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
by: Paul, Abhijit
Published: (2025)

Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
by: Geißler, Dominik, et al.
Published: (2025)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
by: Zhang, Kaiwen, et al.
Published: (2026)

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
by: Prabhu, Shreekanth M, et al.
Published: (2023)

AS2FM: Enabling Statistical Model Checking of ROS 2 Systems for Robust Autonomy
by: Henkel, Christian, et al.
Published: (2025)

Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
by: Chen, Boqi, et al.
Published: (2024)

WEX: Formal Specifications for Windows in Stream Processing
by: Hitarth, S, et al.
Published: (2022)