Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9805082 · Lecture notes in computer science

Quantum counting

Gilles Brassard, Peter Høyer, Alain Tapp

Published Jan 1, 1998• 421 citations
arXivHTMLPDF
DOI
10.1007/bfb0055105

Related papers

Quantum counting, and a relevant sign

Natalie Chung, Rafael I. Nepomechie

arXiv:2310.07428•MATRIX book series•Jan 1, 2026•0 citations

Quantum Statistics

Graduate student series in physics•Jan 1, 1999•0 citations

Application of the Quantum Counting Algorithm to Estimate the Weights of Boolean Functions in Quipper

Д. Денисенко

Abstract Quantum counting is one of the well-known problems in which the application of quantum parallelism speeds up computations. Different authors suggest different estimates for the success probability of a quantum counting algorithm. Moreover, some authors use the direct quantum Fourier transform, while others, the inverse quantum Fourier transform in the quantum counting algorithm. The present paper demonstrates the results of mathematical simulation of the application of the quantum counting algorithm to estimate the weights of some Boolean functions, depending on six variables, in a quantum simulator Quipper to verify known estimates of the success probability of the quantum counting algorithm.

Journal of Experimental and Theoretical Physics•May 1, 2020•4 citations

State reduction in quantum-counting quantum nondemolition measurements

Gerard J Milburn, Daniel F. Walls

We show how quantum-counting quantum nondemolition measurements may be made using standard demolition counting techniques (e.g., photoelectron counting) for two oscillators coupled via a four-wave-mixing interaction. The analysis reveals how the state of one oscillator is reduced to a number eigenstate during the irreversible demolition counting process occurring in another coupled oscillator.

Physical Review A•Jul 1, 1984•73 citations

Quantum Statistics

Marius Grundmann

Graduate texts in physics•Jan 1, 2010•0 citations

Quantum Statistics

WORLD SCIENTIFIC eBooks•Mar 26, 2013•0 citations
Abstract Quantum counting is one of the well-known problems in which the application of quantum parallelism speeds up computations. Different authors suggest different estimates for the success probability of a quantum counting algorithm. Moreover, some authors use the direct quantum Fourier transform, while others, the inverse quantum Fourier transform in the quantum counting algorithm. The present paper demonstrates the results of mathematical simulation of the application of the quantum counting algorithm to estimate the weights of some Boolean functions, depending on six variables, in a quantum simulator Quipper to verify known estimates of the success probability of the quantum counting algorithm.