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.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4representative citing papers
A Stackelberg model for cryptographic hybridization is introduced in which the defender randomizes over algorithms, the attacker solves a conditional optimization subgame via dynamic programming, and the defender's problem is cast as a linear program.
Differences in representation structure between the Ising minimal model and SU(2)_2 Chern-Simons theory do not impact observables relevant to topological quantum computation.
This document outlines the content of a teaching module covering theoretical and experimental aspects of applied optics with emphasis on imaging, lasers, and communication technologies.
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.
-
A Stackelberg Model for Hybridization in Cryptography
A Stackelberg model for cryptographic hybridization is introduced in which the defender randomizes over algorithms, the attacker solves a conditional optimization subgame via dynamic programming, and the defender's problem is cast as a linear program.
-
Ising anyons in the $SU(2)_2$ Chern--Simons theory
Differences in representation structure between the Ising minimal model and SU(2)_2 Chern-Simons theory do not impact observables relevant to topological quantum computation.
-
Notes on Images and Communication
This document outlines the content of a teaching module covering theoretical and experimental aspects of applied optics with emphasis on imaging, lasers, and communication technologies.