Search papers, labs, and topics across Lattice.
University of Liverpool
2
0
1
Maximum degree in tournaments is provably $螛(n^{3/2})$ for quantum algorithms, matching a long-standing conjecture.
Quantum learning algorithms can achieve cubic separations over classical randomized learners, shattering the longstanding belief that exact learning speedups are constrained by Grover search and Bernstein-Vazirani limits.
