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

Journal of Logical and Algebraic Methods in Programming

Formal reasoning about Bernstein-Vazirani algorithm

Hongxia Sun, Zhiping Shi, Shanyan Chen, Guohui Wang, Ximeng Li, Yong Guan

Published Jan 1, 2026• 1 citation
Publisher
DOI
10.1016/j.jlamp.2025.101108

Related papers

A Generalization of the Bernstein-Vazirani Algorithm

Koji Nagata

MOJ Ecology & Environmental Sciences•Feb 9, 2017•8 citations

Distributed Bernstein–Vazirani algorithm

Xu Zhou, Daowen Qiu, Le Luo

Physica A Statistical Mechanics and its Applications•Sep 16, 2023•12 citations

Simon’s, Deutsch–Jozsa, and Bernstein–Vazirani Algorithms

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations

Bernstein-Vazirani Algorithm with a Ccnot-Based Oracle

Mahmoud Hamed Annaby

arXiv:2503.18951•Jan 1, 2025•0 citations

Generalization of the Bernstein–Vazirani algorithm beyond qubit systems

Koji Nagata, Han J.F. Geurdes, Santanu Kumar Patro +3 more

Quantum Studies Mathematics and Foundations•May 20, 2019•8 citations

Quantum Resources and Performance in the Initialization-Free Bernstein-Vazirani Algorithm

Haesol Han, Alexander Streltsov, Soojoon Lee

Naseri et al. [Phys. Rev. A 106, 062429 (2022); arXiv:2205.13610] studied which quantum resources in initial states are essential for the probabilistic Bernstein-Vazirani (BV) algorithm, defining its performance as the optimal average success probability over all measurements. In this work, we consider a variant of BV algorithm, which is called the initialization-free (IF) BV algorithm, in which an arbitrary ancilla state as the oracle register is allowed, to improve the performance. We derive an explicit formula for the performance of the probabilistic IF-BV algorithm and obtain a necessary and sufficient condition for an initial state to achieve maximal performance. We further prove that, under a suitable ordering assumption on the coefficients of the initial state, the probabilistic IF-BV algorithm outperforms the standard probabilistic BV algorithm.

quant-pharXiv:2607.06033•Physical Review A•Jul 8, 2026•0 citations
Naseri et al. [Phys. Rev. A 106, 062429 (2022); arXiv:2205.13610] studied which quantum resources in initial states are essential for the probabilistic Bernstein-Vazirani (BV) algorithm, defining its performance as the optimal average success probability over all measurements. In this work, we consider a variant of BV algorithm, which is called the initialization-free (IF) BV algorithm, in which an arbitrary ancilla state as the oracle register is allowed, to improve the performance. We derive an explicit formula for the performance of the probabilistic IF-BV algorithm and obtain a necessary and sufficient condition for an initial state to achieve maximal performance. We further prove that, under a suitable ordering assumption on the coefficients of the initial state, the probabilistic IF-BV algorithm outperforms the standard probabilistic BV algorithm.