Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/184285
Title: ON SOME OPTIMISATION PROBLEMS ARISING FROM QUANTUM COMPUTING
Authors: MAHARSHI RAY
Keywords: games, quantum, bitcoin-mining, optimisation, contextuality, self-testing
Issue Date: 31-Jul-2020
Citation: MAHARSHI RAY (2020-07-31). ON SOME OPTIMISATION PROBLEMS ARISING FROM QUANTUM COMPUTING. ScholarBank@NUS Repository.
Abstract: The thesis studies some problems arising from quantum computing using tools from optimisation theory. The first part of the thesis focuses on duelling algorithms in game theory. In a competitive scenario, quite often the best strategy to beat an opponent is not the same as one's own optimal strategy (when there is no competition). We observe that in the quantum setting, duelling algorithms for even simple tasks like searching can give rise to very interesting game theoretic dynamics. For example, we answer questions like "what is the Nash equilibrium strategy when say, two (or more) players perform Grover's search and the first one to find the solution wins?" In the second part of the thesis we study quantum Self-testing, schemes that certify quantum state and measurements using only measurement statistics. We leverage the graph-theoretic framework for contextuality, combined with tools from semi-definite programming, to establish new robust self-testing results.
URI: https://scholarbank.nus.edu.sg/handle/10635/184285
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
RayM.pdf2.34 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

23
checked on Jan 21, 2021

Download(s)

7
checked on Jan 21, 2021

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.