no code implementations • 11 Jul 2019 • Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha
Our classical result improves on the algorithm of [CLSW17] and runs in time $\widetilde{O}(n^{3/2}/\epsilon^2 \cdot \mathrm{EO})$.
1 code implementation • 28 May 2018 • Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka
The polynomial-time hierarchy ($\mathrm{PH}$) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\mathrm{PH}$ does not collapse).
Computational Complexity Quantum Physics 68Q12, 68Q15, 81P68, 03D15 F.1.3
no code implementations • 28 Oct 2017 • Divesh Aggarwal, Gavin K. Brennen, Troy Lee, Miklos Santha, Marco Tomamichel
We investigate the risk of Bitcoin, and other cryptocurrencies, to attacks by quantum computers.
Quantum Physics General Finance
