7 papers
Statistical Symmetry Release for Equivariant Quantum Learning
Zeyu Chen
Hard symmetry constraints reduce model complexity, but can also erase label information. Statistical symmetry release determines when finite data and quantum measurements justify r…
Behavioral Memory under Symmetry in One-Way Quantum Automata
Zeyu Chen
Under compact symmetry, observable behavior reduces to an invariant operator algebra, but its dimension is not yet classical memory: some coordinates are dynamically frozen, some i…
On the Simulation Cost of Quantum Finite Automata
Zeyu Chen, Junde Wu
This paper identifies exact probabilistic simulation cost as the natural quantitative measure of quantum advantage for finite automata under strict cutpoints. It gives sharp simula…
Exact Separation of Words via Trace Geometry
Zeyu Chen, Junde Wu
A basic question in the study of measure-once quantum finite automata is whether two distinct input words can be separated with certainty. The exact separation problem reduces to a…
The State Cost of Classical Simulation of One-Way General Quantum Finite Automata
Zeyu Chen, Junde Wu
Under strict cutpoints, probabilistic finite automata (PFAs) and one-way general quantum finite automata (1gQFAs) recognize the same stochastic languages, shifting the theoretical…
Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
Zeyu Chen, Junde Wu
Affine automata provide a finite-state computational model that preserves the linear-algebraic structure of quantum computation while operating entirely over the reals. Recent work…