7 citations · 9 across the 7 of their papers we have counts for
7 papers
The Emptiness Problem for Quantum Finite Automata with Classical States
Jyun-Ao Lin, Patrick Totzke, Yun Chen Tsai +1
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 fi…
Parameterized Verification of Quantum Circuits (Technical Report)
Parosh Aziz Abdulla, Yu-Fang Chen, Michal Hečko +4
We present the first fully automatic framework for verifying relational properties of parameterized quantum programs, i.e., a program that, given an input size, generates a corresp…
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
Yu-Fang Chen, Kai-Min Chung, Min-Hsiu Hsieh +4
We present a verifier of quantum programs called AutoQ 2.0. Quantum programs extend quantum circuits (the domain of AutoQ 1.0) by classical control flow constructs, which enable us…
Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen +5
We present a new method for the verification of quantum circuits based on a novel symbolic representation of sets of quantum states using level-synchronized tree automata (LSTAs).…
An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report)
Yu-Fang Chen, Kai-Min Chung, Ondřej Lengál +3
We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our approach, the problem is given by a triple and the question is whether, giv…
A new involution for quantum loop algebras
Jyun-Ao Lin
In this article, we introduce a completion of the positive half of the quantum affinization of a symmetr…
Spherical Hall algebras of a weighted projective curve
Jyun-Ao Lin
In this article, we deal with the structure of the spherical Hall algebra of coherent sheaves with parabolic structures on a smooth projective curve of arbitrary genus. We provide…