Cover Image

Implementing a Quantum Finite Automaton in IBMQ using Custom Control Pulses

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lussi, Eduardo Willwock, de Sousa, Lucas Cavalcante, Marchi, Jerusa, de Santiago, Rafael, Duzzioni, Eduardo Inacio
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Finite-State Symbolic Automaton Model for the Collatz Map and Its Convergence Properties
by: Brauer, Leonard Ben Aurel
Published: (2025)

Complexity of Fungal Automaton Prediction
by: Formenti, Enrico, et al.
Published: (2026)

A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
by: Wei, Zhenghao, et al.
Published: (2024)

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

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
by: Rote, Günter
Published: (2024)

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

Fast and General Automatic Differentiation for Finite-State Methods
by: Yang, Lucas Ondel, et al.
Published: (2026)

Finite-State Automaton To/From Regular Expression Visualization
by: Morazán, Marco T., et al.
Published: (2024)

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)

A Representative Framework for Implementing Quantum Finite Automata on Real Devices
by: Khadieva, Aliya, et al.
Published: (2024)

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

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
by: Haneef, Farah
Published: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)

Approximate Problems for Finite Transducers
by: Filiot, Emmanuel, et al.
Published: (2025)

Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Repetitive Finite Automata With Translucent Letters
by: Mráz, František, et al.
Published: (2024)

Finite maximal codes and factorizations of cyclic groups
by: De Felice, Clelia
Published: (2022)

Descriptional Complexity of Finite Automata -- Selected Highlights
by: Salomaa, Arto, et al.
Published: (2023)

Efficient Constructions of Finite-State Independent Normal Pairs
by: Pulari, Subin
Published: (2026)

Controller Synthesis for Parametric Timed Games
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2025)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
by: Kostolányi, Peter, et al.
Published: (2026)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
by: Akshay, S, et al.
Published: (2023)

Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata
by: Ziiatdinov, Mansur, et al.
Published: (2024)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
by: Kuriyama, Takayuki
Published: (2014)

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

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
by: De Rosa, Mattia, et al.
Published: (2025)

On the Simulation Cost of Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

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

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

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

Tokenization as Finite-State Transduction
by: Cognetta, Marco, et al.
Published: (2024)

The Similarity Control Problem with Required Events
by: Wang, Yu, et al.
Published: (2026)

More on Maximally Permissive Similarity Control of Discrete Event Systems
by: Wang, Yu, et al.
Published: (2024)