Verifying a Quantum Compiler
Learn how techniques from traditional compiler verification can be applied to the emerging domain of quantum computing.
Archive of posts tagged: quantum computing
How to Test a Quantum Program?
How can we effectively test a complex quantum program state when the test operation is potentially destructive?
People of PL: Mike Hicks
People of PL is a series of interviews with PL researchers. In today’s post, John Wickerson chats with Mike Hicks, who is a Professor in the Department of Computer Science at the University of Maryland, and was former Chair of ACM SIGPLAN.
The First PLanQC in the Road to Quantum Programming
As quantum computers become more practical, there is a rich opportunity to advance the development of tools to assist in the process of programming them, both now and in the future. To encourage more PL-minded researchers to work in this exciting new area, we established the Workshop on Programming Languages for Quantum Computing (PLanQC).
Towards a Universal Quantum Programming Language
Quantum computing may be more powerful than classical computing but has a radically different programming model. Current languages are in their infancy; future languages are likely to be different. Now is a great time for language designers and implementers to try new ideas.
