Jyun-Ao Lin

An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits – Communications of the ACM

cacm.acm.org/research-hig...

I feel sorry for myself that I'm going to have a surgery next week and won't be able to attend my first POPL.... I was so looking forward to it as well as the PLanQC and other workshops.....

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report) 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). LSTAs extend classic...

Our paper "Verifying Quantum Circuits with Level-Synchronized Tree Automata" has recently been accepted to appear at POPL'25! In which we develop a novel automata model that is suitable for quantum program verification. Check the preprint at
arxiv.org/abs/2410.18540