Quantum Coin Flipping

Quantum Coin Flipping: and Circuit Design Problems in Distributed Quantum Computing

van Houte, Roy (TU Delft Electrical Engineering, Mathematics and Computer Science)

Aardal, Karen (mentor)
de Laat, David (mentor)
Fehr, Serge (graduation committee)
Attema, Thomas (mentor)
Bosman, Joost (graduation committee)

Delft University of Technology

Applied Mathematics | Optimization

2020-01-16

Quantum coin flipping is a cryptographic primitive in which two or more parties that do not trust each other want establish a fair coin flip. These parties are not physically near each other and use quantum communication channels to interact. A quality of protocols is measured by the best possible cheating strategy, which is the solution of a complex semidefinite optimization problem. In this master thesis we show new explicit bounds in multiparty quantum coin flipping, we investigate how to explicitly formulate these problem in a standard form, we show that a fair coin flip results in the lowest possible bias and we determine more measures of the quality of a protocol. Furthermore, this master thesis presents a rigorous and detailed mathematical description of semidefinite optimization, quantum information theory and quantum coin flipping. This thesis also includes an article written together with J. Mulderij, T. Attema, I. Chiscop and F. Phillipson on distributed quantum computing. In this article, we pose new questions and formulate integer linear programs that solve to find optimal assignment of qubits to computers for a given network of quantum computers and quantum algorithm.

Quantum coin flipping
Quantum Information Theory
semidefinite optimization
quantum computing
cryptography

http://resolver.tudelft.nl/uuid:e80efe5b-1e20-46de-8a2b-44b777172bfd

2021-01-01

Student theses

master thesis

© 2020 Roy van Houte