Papers › Non-Boolean Quantum Amplitude Amplification and Quantum Mean Estimation
Non-Boolean Quantum Amplitude Amplification and Quantum Mean Estimation
Prasanth Shyamsundar
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper generalizes the quantum amplitude amplification and amplitude estimation algorithms to work with non-boolean oracles. The action of a non-boolean oracle Uᵩ on an eigenstate |x⟩ is to apply a state-dependent phase-shift φ(x). Unlike boolean oracles, the eigenvalues exp(iφ(x)) of a non-boolean oracle are not restricted to be ±1. Two new oracular algorithms based on such non-boolean oracles are introduced. The first is the non-boolean amplitude amplification algorithm, which preferentially amplifies the amplitudes of the eigenstates based on the value of φ(x). Starting from a given initial superposition state |ψ₀⟩, the basis states with lower values of cos(φ) are amplified at the expense of the basis states with higher values of cos(φ). The second algorithm is the quantum mean estimation algorithm, which uses quantum phase estimation to estimate the expectation ⟨ψ₀|Uᵩ|ψ₀⟩, i.e., the expected value of exp(iφ(x)) for a random x sampled by making a measurement on |ψ₀⟩. It is shown that the quantum mean estimation algorithm offers a quadratic speedup over the corresponding classical algorithm. Both algorithms are demonstrated using simulations for a toy example. Potential applications of the algorithms are briefly discussed.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections