Quantum Communication Complexity on Near-Term Networks
Solving the Equality Problem with Realistic Noise
T.G. Jacobs (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Tzula B. Propp – Mentor (TU Delft - QID/Wehner Group)
S.D.C. Wehner – Mentor (TU Delft - QID/Wehner Group)
N. Yorke-Smith – Graduation committee member (TU Delft - Algorithmics)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Quantum computers allow us to solve certain problems that are unsolvable using classical computers. In this study we focus on solving the equality problem by simulating a three quantum computer network and using the communication complexity to determine if our theoretical quantum advantage is still there in practice. We want to know how the noise from realistic quantum networks that already exist affect this communication complexity. We found that we can beat the classical solution when simulating a laboratory setup in which the quantum computers are in close proximity to each other and when using only a small bit strings. However, when moving to setups in which there are kilometres between quantum computers instead of metres or when using larger bit strings as input to our problem we see that the noise becomes too much to simulate.