Fri 20 Nov 2020 01:00 - 01:20 at SPLASH-I - R-4 Chair(s): Gushu Li, Sylvain Boulmé
Quantum computers promise to perform certain computations exponentially faster than any classical device. Precise control over their physical implementation and proper shielding from unwanted interactions with the environment become more difficult as the space/time volume of the computation grows. Code optimization is thus crucial in order to reduce resource requirements to the greatest extent possible. Besides manual optimization, previous work has adapted classical methods such as constant-folding and common subexpression elimination to the quantum domain. However, such classically-inspired methods fail to exploit certain optimization opportunities across subroutine boundaries, limiting the effectiveness of software reuse. To address this insufficiency, we introduce an optimization methodology which employs annotations that describe how subsystems are entangled in order to exploit these optimization opportunities. We formalize our approach, prove its correctness, and present benchmarks: Without any prior manual optimization, our methodology is able to reduce, e.g., the qubit requirements of a 64-bit floating-point subroutine by $34\times$.
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 |