Programme

Programme

All times are in Tokyo time (UTC+09:00).

Current Tokyo local time is --:--

Day 1 – July-7 2021

17:50–18:00
Opening
Invited Talk 1(Session Chair: Tetsuo Yokoyama)
18:00–19:00
How can we construct reversible Turing machines in a very simple reversible cellular automaton?
Kenichi Morita
19:00–19:30
Break
Programming and Programming Languages(Session Chair: Keisuke Nakano)
19:30–20:00
Reversible Functional Array Programming
Torben Ægidius Mogensen
20:00–20:30
Compiling Janus to RSSA
Martin Kutrib, Uwe Meyer, Niklas Deworetzki and Marc Schuster
20:30–20:55
Towards a Unified Language Architecture for Reversible Object-Oriented Programming
Lasse Hay-Schmidt, Robert Glück, Martin Holm Cservenka and Tue Haulund
[slides]
20:55–21:25
Causal-Consistent Debugging of Distributed Erlang Programs
Giovanni Fabbretti, Ivan Lanese and Jean-Bernard Stefani
21:25–21:55
Break
Reversible Concurrent Computation(Session Chair: Claudio Antares mezzina/Shoji Yuen)
21:55–22:25
Towards a truly concurrent semantics for reversible CCS
Hernán Melgratti, Claudio Antares Mezzina and G. Michele Pinna
22:25–22:55
Forward-Reverse Observational Equivalences in CCSK
Ivan Lanese and Iain Phillips
22:55–23:25
Explicit Identifiers and Contexts in Reversible Concurrent Calculus
Clément Aubert and Doriana Medić
[slides],[video]
23:25–23:55
Reversibility and predictions
Martin Vassor

Day 2 – July-8 2021

Invited Talk 2(Session Chair: Robert Wille)
18:00–19:00
Decision Diagrams and Reversible Computation
Shin-ichi Minato
19:00–19:30
Break
Theory and Foundations(Session Chair: Ivan Lanese)
19:30–20:00
A Tangled Web of 12 Lens Laws
Keisuke Nakano
[slides],[video]
20:00–20:20
Splitting recursion schemes into reversible and classical interacting threads
Luca Roversi, Luca Paolini and Armando Matos
20:20–20:40
Reversibility of Executable Interval Temporal Logic Specifications
Antonio Cau, Stefan Kuhn and James Hoey
[slides],[video]
20:40–21:10
Break
Invited Talk 3(Session Chair: Shigeru Yamashita)
21:10–22:10
Variational Quantum Eigensolver and Its Applications
Atsushi Matsuo
22:10–22:40
Break
Circuit Synthesis(Session Chair: Shigeru Yamashita)
22:40–23:10
Efficient Construction of Functional Representations for Quantum Algorithms
Lukas Burgholzer, Rudy Raymond, Indranil Sengupta and Robert Wille
[slides],[video]
23:10–23:40
Finding Optimal Implementations of Non-native CNOT Gates using SAT
Philipp Niemann, Luca Müller and Rolf Drechsler
23:40–24:10
Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network
Evan E. Dobbs, Robert Basmadjian, Alexandru Paler and Joseph S. Friedman
[slides],[video]
24:10–24:30
OR-Toffoli and OR-Peres Reversible Gates
Claudio Moraga
24:30–24:45
Closing
Important dates:

Abstract submission:
March 14, 2021 (EXTENDED)

Submission deadline:
March 21, 2021 (EXTENDED)

Notification to authors:
April 24, 2021

Final version:
May 12, 2021

Conference:
July 7 - July 8, 2021

General Chair:

Shoji Yuen
Nagoya University, Japan

Program Chairs:

Shigeru Yamashita
Ritsumeikan University, Japan

Tetsuo Yokoyama
Nanzan University, Japan
Impress | Contact