The initialization-free Bernstein-Vazirani algorithm's optimal success probability is derived in closed form, with a necessary and sufficient condition for maximal performance and a proof of advantage over the standard probabilistic version.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Quantum Resources and Performance in the Initialization-Free Bernstein-Vazirani Algorithm
The initialization-free Bernstein-Vazirani algorithm's optimal success probability is derived in closed form, with a necessary and sufficient condition for maximal performance and a proof of advantage over the standard probabilistic version.