17:00 |
09:00 |
04:00 |
01:00 |
Earl T. Campbell
University of Sheffield and AWS Center for Quantum Computing
On random circuits and their uses in compilation.
Abstract : I will review work by myself and others in
recent years on the use of randomization in circuit
optimization. I will present general results showing that any
deterministic compiler for approximate synthesis problems can be
lifted to a better random compiler. I will discuss the subtle
issue of what "better" means and how it is sensitive to the
metric and computation task at hand. I will then review
specific randomized algorithms for quantum simulations,
including randomized Trotter (Su & Childs) and my group's work
on the qDRIFT and SPARSTO algorithms. I will conclude by
commenting on the derandomization of random algorithms!
video >
|
18:00 |
10:00 |
05:00 |
02:00 |
Yuval Sanders,
Dominic Berry,
Pedro Costa,
Louis Tessler,
Nathan Wiebe,
Craig Gidney,
Hartmut Neven and
Ryan Babbush
.
Compilation of Fault-Tolerant Quantum
Heuristics for Combinatorial Optimization
abstract
>
video >
|
18:20 |
10:20 |
05:20 |
02:20 |
Lukas Burgholzer
and
Robert Wille
Verifying the Results of Quantum
Circuit Compilation Flows
abstract
>
video >
|
18:40 |
10:40 |
05:40 |
02:40 |
Christophe Chareton, Sébastien Bardin, François Bobot, Valentin
Perrelle and Benoît Valiron
A formally certified implementation
of the Shor algorithm’s quantum circuit
abstract
>
video >
|
19:00 |
11:00 |
06:00 |
03:00 |
POSTER SESSION / BREAK
Posters presented in this session : TBA
|
19:40 |
11:40 |
06:40 |
03:40 |
Alexander Cowtan, Will Simmons and Ross Duncan
A Generic Compilation Strategy for
the Unitary Coupled Cluster Ansatz
abstract
>
video >
|
20:00 |
12:00 |
07:00 |
04:00 |
Richard Meister, Simon Benjamin and Earl Campbell
Tailoring Term Truncations for
Electronic Structure Calculations Using a Linear Combination
of Unitaries
abstract
>
video >
|
20:20 |
12:20 |
07:20 |
04:20 |
Fereshte Mozafari,
Heinz Riener
and
Giovanni De Micheli
Uniform Quantum State Preparation: A
Boolean Approach for Preparing Uniform Quantum States
Efficiently and Precisely
abstract
>
video >
|
20:40 |
12:40 |
07:40 |
04:40 |
Bruno Schmitt and Giovanni De Micheli
The Tweedledum Library
abstract
>
video >
|
21:00 |
13:00 |
08:00 |
04:00 |
POSTER SESSION / BREAK
Posters presented in this session : TBA
|
22:00 |
14:00 |
09:00 |
06:00 |
Miriam Backens,
Hector
Miller-Bakewell ,
Giovanni de Felice,
Leo Lobski
and John van de Wetering
There and back again: A circuit extraction
tale
abstract >
video >
|
22:20 |
14:20 |
09:20 |
06:20 |
Emanuel Malvetti, Raban Iten and Roger Colbeck
Quantum Circuits for Sparse Isometries
abstract >
video >
|
22:40 |
14:40 |
09:40 |
06:40 |
Agustín Borgna,
Simon Perdrix
and
Benoît Valiron
Hybrid quantum-classical circuit
optimization with the ZX-calculus
abstract
>
video >
|
23:00 |
15:00 |
10:00 |
07:00 |
Richie Yeung and Stefano Gogioso
A Simplification Method for Layered
Quantum Circuits of Mixed Phase Gadgets
abstract
>
video >
|
23:20 |
15:20 |
10:20 |
07:20 |
Quanlong Wang.
Exact synthesis of quantum circuits in
algebraic ZX-calculus
abstract
>
video >
|
23:40 |
15:40 |
10:40 |
07:40 |
Sarah Li,
Neil J. Ross
and
Peter Selinger.
Generators and Relations for the
Group On(Z[1/2])
abstract >
video >
|
00:00 |
16:00 |
11:00 |
08:00 |
POSTER SESSION / BREAK
Posters presented in this session : TBA
|
01:00 |
17:00 |
12:00 |
09:00 |
Eleanor Rieffel
Quantum Artificial Intelligence Laboratory (QuAIL) NASA Ames Research Center
Utilizing NISQ devices for evaluating quantum
algorithms
Abstract : With the advent of quantum supremacy, we have
an unprecedented opportunity to explore quantum algorithms in
new ways. The emergence of general-purpose quantum processors
opens up empirical exploration of quantum algorithms far beyond
what has been possible to date. Challenging computational
problems arising in the practical world are often tackled by
heuristic algorithms. While heuristic algorithms work well in
practice, by definition they have not been analytically proven
to be the best approach or to outperform the best previous
approach. Instead, heuristic algorithms are empirically tested
on benchmark and real-world problems. With the empirical
evaluation NISQ hardware enables, we expect a broadening of
established applications of quantum computing. What to run and
how best to utilize these still limited quantum devices to gain
insight into quantum algorithms remain open research
questions. We discuss opportunities and challenges for using
NISQ devices to evaluate quantum algorithms, including in
elucidating quantum mechanisms and their uses for quantum
computational purposes, in the design of novel or refined
quantum algorithms, in compilation, error-mitigation, and robust
algorithms design, and in techniques for evaluating quantum
algorithms empirically.
video >
|
02:00 |
18:00 |
13:00 |
10:00 |
Ed Younis,
Koushik Sen,
Katherine Yelick and Costin Iancu
QFAST: Quantum Synthesis Using a
Hierarchical Continuous Circuit Space
abstract >
video >
|
02:20 |
18:20 |
13:20 |
10:20 |
Ryan LaRose, Andrea
Mari, Nathan Shammah, Peter Karalekas and Will Zeng.
Mitiq: A software package for error
mitigation on near-term quantum computers
abstract
>
video >
|
02:40 |
18:40 |
13:40 |
10:40 |
Gushu Li,
Li Zhou,
Nengkun Yu,
Yufei Ding,
Mingsheng Ying and
Yuan Xie.
Proq: Projection-based Runtime Assertions
for Debugging on a Quantum Computer
abstract >
video >
|