A finite state automaton for quantum computing

DOI10.1007/S11128-025-05047-3MaRDI QIDQ6852779zbMATH OpenFDO

Authors YoungMin Kwon, Gul A. Agha

Publication date 25 February 2026

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-025-05047-3

zbMATH Keywords

QAOAquantum finite-state automataHamiltonian for NFAQFA

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• scientific article; zbMATH DE number 5292465 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1971709 (Why is no real title available?)
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
• A review on quantum approximate optimization algorithm and its variants
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Bounded Model Checking of Hybrid Systems for Control
• Bounded model checking using satisfiability solving
• Checking NFA equivalence with bisimulations up to congruence
• Quantum approximate optimization for combinatorial problems with constraints
• Quantum automata and quantum grammars
• The unconstrained binary quadratic programming problem: a survey
• Towards a design flow for reversible logic

This page was built for publication: A finite state automaton for quantum computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852779)