5.2k citations
- Courant Institute of Mathematical SciencesUS7 papers
- Columbia UniversityUS5 papers
- New York UniversityUS5 papers
- University of California, BerkeleyUS5 papers
- Cornell UniversityUS4 papers
- Microsoft (United States)US4 papers
- University of Illinois Urbana-ChampaignUS4 papers
- University of WashingtonUS4 papers
- Carnegie Mellon UniversityUS3 papers
- Massachusetts Institute of TechnologyUS3 papers
- Stanford UniversityUS3 papers
- Berkeley CollegeUS2 papers
4 papers · 1 filter
Adversary Lower Bound for the Orthogonal Array Problem
Robert Spalek
We prove a quantum query lower bound Ω(n^{(d+1)/(d+2)}) for the problem of deciding whether an input string of size n contains a k-tuple which belongs to a fixed orthogonal array o…
Adversary Lower Bound for the k-sum Problem
Aleksandrs Belovs, Robert Spalek
We prove a tight quantum query lower bound for the problem of deciding whether there exist numbers among that sum up to a prescribed number, provided that…
Robust Classification with Adiabatic Quantum Optimization
Vasil S. Denchev, Nan Ding, S. V. N. Vishwanathan +1
We propose a non-convex training objective for robust binary classification of data sets in which label noise is present. The design is guided by the intention of solving the resul…
Duality of privacy amplification against quantum adversaries and data compression with quantum side information
Joseph M. Renes
We show that the tasks of privacy amplification against quantum adversaries and data compression with quantum side information are dual in the sense that the ability to perform one…