output
20022013
most citedLeftover Hashing Against Quantum Side Information

313 citations

Showing 2010 · quant-phShow all

5 papers · 2 filters

quant-ph20102 cited

Better Non-Local Games from Hidden Matching

Harry Buhrman, Giannicola Scarpa, Ronald de Wolf

We construct a non-locality game that can be won with certainty by a quantum strategy using log n shared EPR-pairs, while any classical strategy has winning probability at most 1/2…

quant-ph20107 cited

New Results on Quantum Property Testing

Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1

We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d…

quant-ph201044 cited

Quantum learning: optimal classification of qubit states

Madalin Guta, Wojciech Kotlowski

Pattern recognition is a central topic in Learning Theory with numerous applications such as voice and text recognition, image analysis, computer diagnosis. The statistical set-up…

quant-ph201014 cited

A tight Tsirelson inequality for infinitely many outcomes

S. Zohren, P. Reska, R. D. Gill +1

We present a novel tight bound on the quantum violations of the CGLMP inequality in the case of infinitely many outcomes. Like in the case of Tsirelson's inequality the proof of ou…

quant-ph2010313 cited

Leftover Hashing Against Quantum Side Information

Marco Tomamichel, Christian Schaffner, Adam Smith +1

The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formu…