A quantum circuit model encodes finite automaton transitions in superposition and uses Grover search to find resetting input sequences with quadratic speedup over classical brute-force.
Effective algorithms for constructing minimum cost adaptive distinguishing sequences.Information and Software Technology, 74:69–85, 2016
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A quantum model for synchronizing finite state transition systems
A quantum circuit model encodes finite automaton transitions in superposition and uses Grover search to find resetting input sequences with quadratic speedup over classical brute-force.