APLAS 2024
Tue 22 - Fri 25 October 2024 Kyoto
Tue 22 Oct 2024 14:00 - 14:30 at Yamauchi Hall - Quantum Chair(s): Jacques Garrigue

We propose a quantum programming paradigm where all data are familiar classical data, and the only non-classical element is a random number generator that can return results with negative probability. Currently, the vast majority of quantum programming languages instead work with quantum data types made up of qubits. The description of their behavior relies on heavy linear algebra and many interdependent concepts and intuitions from quantum physics, which takes dedicated study to understand. We demonstrate that the proposed view of quantum programming explains its central concepts and constraints in more accessible, computationally relevant terms. This is achieved by systematically reducing everything to the existence of that negative-probability random generator, avoiding mention of advanced physics as much as possible. This makes quantum programming more accessible to programmers without a deep background in physics or linear algebra. The bulk of this paper is written with such an audience in mind. As a working vehicle, we lay out a simple quantum programming language under this paradigm, showing that not only can it express all quantum programs, it also naturally captures the semantics of measurement without ever mentioning qubits or collapse. The language is proved to be implementable and universal.

Tue 22 Oct

Displayed time zone: Osaka, Sapporo, Tokyo change

14:00 - 15:30
QuantumResearch Papers at Yamauchi Hall
Chair(s): Jacques Garrigue Nagoya University
14:00
30m
Talk
Quantum Programming Without the Quantum Physics
Research Papers
Jun Inoue National Institute of Advanced Industrial Science and Technology, Japan
14:30
30m
Talk
Quantum Bisimilarity is a Congruence under Physically Admissible Schedulers
Research Papers
Lorenzo Ceragioli IMT Lucca, Italy, Fabio Gadducci University of Pisa, Giuseppe Lomurno University of Pisa, Italy, Gabriele Tedeschi University of Pisa, Italy
15:00
30m
Talk
Type-Based Verification of Connectivity Constraints in Lattice Surgery
Research Papers
Ryo Wakizaka Kyoto University, Atsushi Igarashi Kyoto University, Yasunari Suzuki NTT Computer and Data Science Laboratories