Sampling in a Quantum Population, and Applications

  • Niek J. Bouman
  • Serge Fehr
Conference paper

DOI: 10.1007/978-3-642-14623-7_39

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6223)
Cite this paper as:
Bouman N.J., Fehr S. (2010) Sampling in a Quantum Population, and Applications. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg

Abstract

We propose a framework for analyzing classical sampling strategies for estimating the Hamming weight of a large string from a few sample positions, when applied to a multi-qubit quantum system instead. The framework shows how to interpret the result of such a strategy and how to define its accuracy when applied to a quantum system. Furthermore, we show how the accuracy of any strategy relates to its accuracy in its classical usage, which is well understood for the important examples. We show the usefulness of our framework by using it to obtain new and simple security proofs for the following quantum-cryptographic schemes: BB84 quantum-key-distribution, and quantum oblivious-transfer from bit-commitment.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Niek J. Bouman
    • 1
  • Serge Fehr
    • 1
  1. 1.Centrum Wiskunde & Informatica (CWI)AmsterdamThe Netherlands

Personalised recommendations