Strategies for quantum races

DOI10.4230/LIPICS.ITCS.2019.51MaRDI QIDQ5090429zbMATH OpenFDO

Authors Troy Lee, Maharshi Ray, Miklos Santha

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/1809.03671

zbMATH Keywords

bitcoin miningconvex optimizationgame theoryquantum computing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Quantum strategies
• Quantum strategic game theory
• Mini-maximizing two qubit quantum computations
• Can a game be quantum?
• Quantum approach to Cournot-type competition

Cites work

• Duality in quadratic programming
• Dueling algorithms
• Exact quantum lower bound for Grover's problem
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Majority is not enough: bitcoin mining is vulnerable
• Non-cooperative games
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Related-Key Cryptanalysis of the Full AES-192 and AES-256
• Two-person nonzero-sum games and quadratic programming

This page was built for publication: Strategies for quantum races

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090429)