Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
Fri 20 Nov 2020 01:40 - 02:00 at SPLASH-I - R-4 Chair(s): Gushu Li, Sylvain Boulmé
Approximation errors must be taken into account when compiling quantum programs into a low-level gate set. We present a methodology that tracks such errors automatically and then optimizes accuracy parameters to guarantee a specified overall accuracy while aiming to minimize the implementation cost in terms of quantum gates.
The core idea of our approach is to extract functions that specify the optimization problem directly from the high-level description of the quantum program. Then, custom compiler passes optimize these functions, turning them into (near-)symbolic expressions for (1) the total error and (2) the implementation cost (e.g., total quantum gate count). All unspecified parameters of the quantum program will show up as variables in these expressions, including accuracy parameters.
After solving the corresponding optimization problem, a circuit can be instantiated from the found solution.
We develop two prototype implementations, one in C++ based on Clang/LLVM, and another using the Q# compiler infrastructure. We benchmark our prototypes on typical quantum computing programs, including the quantum Fourier transform, quantum phase estimation, and Shor's algorithm.
Thu 19 Nov Times are displayed in time zone: Central Time (US & Canada) change
13:00 - 14:20: R-4OOPSLA at SPLASH-I +12h Chair(s): Rohan PadhyeCarnegie Mellon University, Robert RandUniversity of Chicago | |||
13:00 - 13:20 Talk | Assertion-Based Optimization of Quantum Programs OOPSLA Link to publication DOI Media Attached | ||
13:20 - 13:40 Talk | Dataflow-Based Pruning for Speeding up Superoptimization OOPSLA Manasij MukherjeeUniversity of Utah, Pranav KantUniversity of Utah, Zhengyang LiuUniversity of Utah, John RegehrUniversity of Utah Link to publication DOI Media Attached | ||
13:40 - 14:00 Talk | Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation OOPSLA Link to publication DOI Media Attached | ||
14:00 - 14:20 Talk | Eliminating Abstraction Overhead of Java Stream Pipelines using Ahead-of-Time Program Optimization OOPSLA Link to publication DOI Pre-print Media Attached |
Fri 20 Nov Times are displayed in time zone: Central Time (US & Canada) change
01:00 - 02:20: R-4OOPSLA at SPLASH-I Chair(s): Gushu LiUniversity of California at Santa Barbara, Sylvain BoulméGrenoble Alps University / CNRS / Grenoble INP / VERIMAG | |||
01:00 - 01:20 Talk | Assertion-Based Optimization of Quantum Programs OOPSLA Link to publication DOI Media Attached | ||
01:20 - 01:40 Talk | Dataflow-Based Pruning for Speeding up Superoptimization OOPSLA Manasij MukherjeeUniversity of Utah, Pranav KantUniversity of Utah, Zhengyang LiuUniversity of Utah, John RegehrUniversity of Utah Link to publication DOI Media Attached | ||
01:40 - 02:00 Talk | Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation OOPSLA Link to publication DOI Media Attached | ||
02:00 - 02:20 Talk | Eliminating Abstraction Overhead of Java Stream Pipelines using Ahead-of-Time Program Optimization OOPSLA Link to publication DOI Pre-print Media Attached |