225 citations · 582 across the 52 of their papers we have counts for
Showing 2018 · quant-phShow all
3 papers · 2 filters
quant-ph2018
Strategies for quantum races
Troy Lee, Maharshi Ray, Miklos Santha
We initiate the study of quantum races, games where two or more quantum computers compete to solve a computational problem. While the problem of dueling algorithms has been studied…
quant-ph2018★ 1 cited
On learning linear functions from subset and its applications in quantum computing
Gábor Ivanyos, Anupam Prakash, Miklos Santha
Let be the finite field of size and let be a linear function. We introduce the {\em Learning From Subset} problem LFS$(q,…
quant-ph2018★ 2 cited
Total Functions in QMA
Serge Massar, Miklos Santha
The complexity class QMA is the quantum analog of the classical complexity class NP. The functional analogs of NP and QMA, called functional NP (FNP) and functional QMA (FQMA), con…