YoVDO

Compiling Conditional Quantum Gates without Using Helper Qubits

Offered By: ACM SIGPLAN via YouTube

Tags

Quantum Computing Courses Computer Science Courses Quantum Gates Courses Grover's Algorithm Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking compilation scheme for conditional quantum gates presented in this 17-minute video from the PLDI 2024 conference. Discover how researchers Keli Huang and Jens Palsberg from the University of California at Los Angeles have developed a method to compile multi-qubit conditionals to two-qubit conditionals without using helper qubits. Learn about the significant improvements in gate efficiency, requiring only 1/3 as many gates as previous methods, and its crucial impact on practical quantum computing applications. Examine the experimental results demonstrating the scheme's effectiveness in optimizing quantum circuits, particularly for Grover's algorithm and quantum walk implementations. Gain insights into how this innovative approach enhances the reliability of compiled quantum code, addressing key challenges in quantum computing and compiler design.

Syllabus

[PLDI24] Compiling Conditional Quantum Gates without Using Helper Qubits


Taught by

ACM SIGPLAN

Related Courses

Probabilistic Graphical Models 1: Representation
Stanford University via Coursera
Computer Security
Stanford University via Coursera
Intro to Computer Science
University of Virginia via Udacity
Introduction to Logic
Stanford University via Coursera
Internet History, Technology, and Security
University of Michigan via Coursera