YoVDO

An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits

Offered By: ACM SIGPLAN via YouTube

Tags

Quantum Circuits Courses Quantum Computing Courses Automata Theory Courses Circuit Analysis Courses Formal Methods Courses Quantum States Courses Bug Hunting Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking paradigm for analyzing and detecting bugs in quantum circuits through this 18-minute conference talk from PLDI 2023. Discover how researchers utilize tree automata to represent quantum states compactly and develop transformers for implementing quantum gate semantics. Learn about the innovative approach that employs algebraic representations of quantum states, avoiding floating-point number inaccuracies. Examine the performance of this technique against various benchmarks, including its ability to verify a large circuit with 40 qubits and 141,527 gates, and detect bugs in a circuit with 320 qubits and 1,758 gates. Gain insights into the connection between quantum program verification and automata theory, opening new possibilities for leveraging automata-based verification in quantum computing.

Syllabus

[PLDI'23] An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits


Taught by

ACM SIGPLAN

Related Courses

Automata Theory
Stanford University via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
离散数学概论 Discrete Mathematics Generality
Peking University via Coursera
System Validation: Automata and behavioural equivalences
EIT Digital via Coursera
System Validation (3): Requirements by modal formulas
EIT Digital via Coursera