
Verifying a Quantum Compiler
Learn how techniques from traditional compiler verification can be applied to the emerging domain of quantum computing.
by Kesha Hietala and Robert Rand on Jun 2, 2021 | Tags: compilers, formal verification, optimization, proof engineering, quantum computing
Learn how techniques from traditional compiler verification can be applied to the emerging domain of quantum computing.
The ACM Special Interest Group on Programming Languages (SIGPLAN) explores programming language concepts and tools, focusing on design, implementation, practice, and theory. Its members are programming language developers, educators, implementers, researchers, theoreticians, and users.
Keep up-to-date with the latest technical developments, network with colleagues outside your workplace and get cutting-edge information, focused resources and unparalleled forums for discussions.
Join here: https://www.acm.org/special-interest-groups/sigs/sigplan