Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2406.13797 · Theoretical Computer Science

On the intersection problem for quantum finite automata

Andrea Benso, Flavio D’Alessandro, Paolo Papi

Published Jul 16, 2025• 2 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2025.115454

Related papers

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem

Alberto Bertoni, Christian Choffrut, Flavio D’Alessandro

arXiv:1303.2967•Lecture notes in computer science•Jan 1, 2013•3 citations

Another approach of the equivalence problem for measure-many one-way quantum finite automata

Tianrong Lin

•Jun 13, 2011•0 citations

On hybrid models of quantum finite automata

Lvzhou Li, Yuan Feng

arXiv:1206.2131•Journal of Computer and System Sciences•Feb 18, 2015•12 citations

The Emptiness Problem for Quantum Finite Automata with Classical States

Jyun-Ao Lin, Patrick Totzke, Yun Chen Tsai +1 more

Quantum Finite Automata with Classical states (QFACs) are nondeterministic finite automata over a finite alphabet of quantum operations. We study expressiveness of this model on finite words and the corresponding emptiness problem. We show that regular languages are incomparable with those definable by Quantum Finite Automata (QFAs) and that both are strictly subsumed by QFAC-definable languages. We show that the emptiness problem for a QFAC can be reduced to the emptiness of the language intersection of a QFA and a finite automaton. This intersection is known to be decidable for strict thresholds but undecidable for non-strict cases. Furthermore, we consider the problem for flat QFACs, a restriction where the underlying automata contain no nested loops, and relate it to the higher-dimensional orbit problem, a long-standing open challenge in dynamical systems. Finally, we propose a sound and semi-complete witness searching procedure to verify the non-emptiness of one-loop QFACs, which are sufficiently expressive to represent some prominent quantum algorithms, such as Grover's search and quantum random walks.

arXiv:2608.29319•Aug 29, 2026•0 citations

On Some Decision Problems on Quantum Automata

Flavio D’Alessandro, Carlo Mereghetti, Beatrice Palano +1 more

Lecture notes in computer science•Jan 1, 2026•1 citation

Approximate QCAs in one dimension using approximate algebras

Daniel Ranard, Michael Walter, Freek Witteveen

Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small error, as occurs for local quantum dynamics on the lattice. A priori, approximate QCAs could exhibit genuinely new behavior, failing to be well-approximated by any exact QCA. We show this does not occur in one dimension: every approximate QCA on a finite circle can be rounded to a strict QCA with approximately the same action on local operators, so these systems are classified by the same index as in the exact case. Previous work considered the case of the infinite line, by using global methods not amenable to finite systems. Our new approach proceeds locally and now applies to finite systems, including circles or homomorphisms from sub-intervals. We extract exact local boundary algebras from the approximate QCA restricted to local patches, then glue these to form a strict QCA. The key technical ingredient is a robust notion of the intersection of two subalgebras: when the projections onto two subalgebras approximately commute, we construct an exact subalgebra that serves as a stable proxy for their intersection. This construction uses a recent theorem of Kitaev on the rigidity of approximate $C^*$-algebras.

quant-pharXiv:2603.08702•Mar 10, 2026•1 citation
Quantum Finite Automata with Classical states (QFACs) are nondeterministic finite automata over a finite alphabet of quantum operations. We study expressiveness of this model on finite words and the corresponding emptiness problem. We show that regular languages are incomparable with those definable by Quantum Finite Automata (QFAs) and that both are strictly subsumed by QFAC-definable languages. We show that the emptiness problem for a QFAC can be reduced to the emptiness of the language intersection of a QFA and a finite automaton. This intersection is known to be decidable for strict thresholds but undecidable for non-strict cases. Furthermore, we consider the problem for flat QFACs, a restriction where the underlying automata contain no nested loops, and relate it to the higher-dimensional orbit problem, a long-standing open challenge in dynamical systems. Finally, we propose a sound and semi-complete witness searching procedure to verify the non-emptiness of one-loop QFACs, which are sufficiently expressive to represent some prominent quantum algorithms, such as Grover's search and quantum random walks.
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small error, as occurs for local quantum dynamics on the lattice. A priori, approximate QCAs could exhibit genuinely new behavior, failing to be well-approximated by any exact QCA. We show this does not occur in one dimension: every approximate QCA on a finite circle can be rounded to a strict QCA with approximately the same action on local operators, so these systems are classified by the same index as in the exact case. Previous work considered the case of the infinite line, by using global methods not amenable to finite systems. Our new approach proceeds locally and now applies to finite systems, including circles or homomorphisms from sub-intervals. We extract exact local boundary algebras from the approximate QCA restricted to local patches, then glue these to form a strict QCA. The key technical ingredient is a robust notion of the intersection of two subalgebras: when the projections onto two subalgebras approximately commute, we construct an exact subalgebra that serves as a stable proxy for their intersection. This construction uses a recent theorem of Kitaev on the rigidity of approximate C∗C^*C∗-algebras.