Quantum rejection sampling

DOI10.1145/2090236.2090261zbMath1347.68153arXiv1103.2774OpenAlexW2138262447MaRDI QIDQ5890925

Maris Ozols, Jérémie Roland, Martin Roetteler

Publication date: 7 October 2016

Published in: ACM Transactions on Computation Theory, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.2774

zbMATH Keywords

quantum algorithmsrejection samplingquery complexityBoolean hidden shift problemquantum Metropolis sampling

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (8)

Quantum Gibbs samplers: the commuting case ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ SMT sampling via model-guided approximation ⋮ Quantum linear key-recovery attacks using the QFT ⋮ Fourier 1-norm and quantum speed-up ⋮ Quantum pattern matching fast on average ⋮ Scalable pseudorandom quantum states ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: Quantum rejection sampling