3rd International Workshop on
Quantum Compilation

November 7, 2019 · The Westin Westminster · Westminster, CO, USA · co-located with ICCAD

About the workshop

The workshop aims to bring together researchers from quantum computing, electronic design automation, and compiler construction. Open questions that we anticipate this group to tackle include new methods for circuit synthesis and optimization, optimizations and rewriting, techniques for verifying the correctness of quantum programs, and new techniques for compiling efficient circuits and protocols regarding fault-tolerant and architecture constraints.

The scope of the workshop includes, but is not limited to, current hot topics in quantum circuit design such as

  • space-optimizing compilers for reversible circuits
  • design-space exploration for automatic code generation from classical HDL specification
  • quantum programming languages
  • reversible logic synthesis
  • technology-aware mapping
  • error correction
  • optimized libraries (e.g., for arithmetic and Hamiltonian simulation)
  • benchmarking of circuits for small and medium scale quantum computers
  • quantum and reversible circuit peep-holing and (re)synthesis
  • software and tools for all above mentioned topics
  • quantum outreach: coding contests, tutorials, education

Program (Room: Westminster II)

08:00 – 08:30 Welcome
Mathias Soeken (Microsoft & EPFL), Thomas Häner (Microsoft)
08:30 – 09:00 Mapping qubits to any hardware - a graph mapper for ProjectQ
Damien Nguyen (Huawei Technologies Switzerland AG)
09:00 – 09:30 Efficient template matching in quantum circuits
Raban Iten (ETH Zurich), David Sutter (ETH Zurich), Stefan Woerner (IBM)
09:30 – 10:00 Short introduction of all posters
10:00 – 11:00 Poster session (with coffee)

Introduction to UniversalQCompiler
Raban Iten (ETH Zurich), Oliver Reardon-Smith (University of York), Luca Mondada (ETH Zurich), Ethan Redmond (University of York), Ravjot Singh (University of Hamburg), Roger Colbeck (University of York)

Efficient and Correct Compilation of Quantum Circuits
Stefan Hillmich (Johannes Kepler University Linz), Lukas Burgholzer (Johannes Kepler University Linz), Robert Wille (Johannes Kepler University Linz)

Building a library of composable functions for quantum communication and distributed quantum computers
Harold Ollivier (LIP6 - Paris Sorbonne University)

On the qubit routing problem
Alexander Cowtan (Cambridge Quantum Computing), Silas Dilkes (Cambridge Quantum Computing), Ross Duncan (University of Strathclyde), Alexandre Krajenbrink (Cambridge Quantum Computing), Will Simmons (Cambridge Quantum Computing), Seyon Sivarajah (Cambridge Quantum Computing)

Application Motivated Benchmarking of Quantum Computation and Compilation
Daniel Mills (The University of Edinburgh), Seyon Sivarajah (Cambridge Quantum Computing), Travis Scholten (IBM), Ross Duncan (Cambridge Quantum Computing)

Fidelity-aware qubit remapping
Peter Karalekas (Rigetti Computing), Mark Skilbeck (Rigetti Computing), Eric Peterson (Rigetti Computing)

Learning Quantum Error Models
William Moses (MIT), Costin Iancu (Lawrence Berkeley National Laboratory), Wade de Jong (Lawrence Berkeley National Laboratory)

Optimize Surface Code Braiding
Fei Hua (Rutgers University), Eddy Z. Zhang (Rutgers University)

Analyzing the Impact of Errors in Quantum Program Components
Ed Younis (University of California, Berkeley), Koushik Sen (University of California, Berkeley), Jan Balewski (Lawrence Berkeley National Lab), Costin Iancu (Lawrence Berkeley National Lab)

Quantum computational finance: asset pricing
Patrick Rebentrost (MIT & National University of Singapore), Samuel Bosch (EPFL), Seth Lloyd (MIT)

Towards Optimal Qubit Mapping in NISQ Era
Hao Fu (University of Science and Technology of China), Mingzheng Zhu (University of Science and Technology of China), Wenli Wu (University of Science and Technology of China), Eddy Z. Zhang (Rutgers University), Haisheng Tan (University of Science and Technology of China)
11:00 – 11:30 Two-qubit circuits and the monodromy polytope
Eric Peterson (Rigetti Computing), Gavin Crooks (Rigetti Computing), Robert Smith (Rigetti Computing)
11:30 – 12:00 t|ket>: a Retargetable Compiler for Quantum Software
Alexander Cowtan (Cambridge Quantum Computing), Silas Dilkes (Cambridge Quantum Computing), Ross Duncan (University of Strathclyde), Will Simmons (Cambridge Quantum Computing), Seyon Sivarajah (Cambridge Quantum Computing)
12:00 – 13:30 Lunch break
13:30 – 14:00 Phase Gadget Synthesis for Shallow Circuits
Alexander Cowtan (Cambridge Quantum Computing), Silas Dilkes (Cambridge Quantum Computing), Ross Duncan (University of Strathclyde), Will Simmons (Cambridge Quantum Computing), Seyon Sivarajah (Cambridge Quantum Computing)
14:00 – 14:30 Lower bounds on the non-Clifford resources for quantum computations
Michael Beverland (Microsoft), Earl Campbell (The University of Sheffield), Mark Howard (National University of Ireland), Vadym Kliuchnikov (Microsoft)
14:30 – 15:00 Contract-based verification of the Qiskit Terra quantum compiler
Yunong Shi (The University of Chicago), Ali Javadi-Abhari (IBM), Andrew Cross (IBM)
15:00 – 16:00 Poster session (with coffee)
16:00 – 16:30 Rotation Primitives in Quantum Compilation
Kaitlin Smith (Southern Methodist University), Jessie Henderson (Southern Methodist University), Mitchell Thornton (Southern Methodist University)
16:30 – 17:00 Heuristics for Quantum Compiling with a Continuous Gate Set
Marc Grau Davis (University of California, Berkeley), Ethan Smith (University of California, Berkeley), Ana Tudor (University of California, Berkeley), Koushik Sen (University of California, Berkeley), Irfan Siddiqi (University of California, Berkeley), Costin Iancu (Lawrence Berkeley National Lab)
17:00 – 17:10 Closing and discussions

Important dates

September 1, 2019 (anywhere-on-earth) Submission of abstract
September 8, 2019 Notification of decisions
November 7, 2019 Workshop

Instructions for authors

The main purpose of the workshop is to exchange recent ideas and reserch in the area of quantum compilation. The workshop has no formal proceedings. Authors are invited to submit an abstract or a paper, with no restrictions on the format. Submission of tool and case-study papers are highly encouraged. In case of a positive evaluation, submissions are accepted either as oral or poster presentation to be part of the workshop program. All abstracts and papers are distributed only among the participants. Please submit your papers through EasyChair: https://easychair.org/conferences/?conf=iwqc19


Previous editions