< Retour au sommaire

An Interpreter for a Concurrent Quantum Language

Ines Dias le

Lieu: Salle 1073

Abstract

Despite all progress being made over the years in the Quantum Computing field, quantum noise remains a challenge for the realization of quantum computers. A possible way of minimizing the effect of noise in quantum computing is to reorder the instructions that are set for execution in a quantum computer. By introducing concurrency to quantum programs, together with an appropriate scheduler that decides the order of execution of these instructions, it is possible to realize this reordering. In this talk, we present a Haskell implementation for a concurrent quantum language. This task involved the implementation of a parser using Parsec and the implementation of the operational semantics of the language. The goal of this implementation is to study to what extent concurrency (and, specifically, reordering) can reduce noise in quantum computing. Specifically, this implementation allows to simulate the execution of programs of the language. For a given program and an initial state, it is possible to obtain all the possible final results of the execution, as well as an histogram that represents the results of several executions. Therefore this implementation is useful for evaluating if the introduction of concurrency in a program does not change its input-output behaviour.