Sampling in a Quantum Population, and Applications

2009/07/24 by Niek J. Bouman, Bouman, Niek J., Serge Fehr +1 · 2 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.0907.4246

[v5] Fixed a proof-technical issue related to abort in QOT, and rephrased some statements about composability; Proceedings CRYPTO 2010 (LNCS vol. 6223, Springer)

openalex publication_date 2009/07/24 · arxiv created 2012/01/16 · arxiv updated 2012/01/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose a framework for analyzing classical sampling strategies for estimating the Hamming weight of a large string, when applied to a multi-qubit quantum system instead. The framework shows how to interpret 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: quantum oblivious-transfer from bit-commitment, and BB84 quantum-key-distribution.

Cited by

• Finite Key Rates for QKD Protocols with Data Filtering
• Tight finite-key analysis for quantum cryptography

Related

• Exploiting the randomness of the measurement basis in quantum\n cryptography: Secure Quantum Key Growing without Privacy Amplification
• Quantum Sampling for Optimistic Finite Key Rates in High Dimensional Quantum Cryptography
• On Sampling and Inference using Quantum Algorithms
• Large N Quantum Cryptography
• Monte Carlo simulation of random circuit sampling in quantum computing