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

Carlos A. Batista, Tiago M. L. Veras, Leon D. da Silva +1 more

Edouard Brainis, L.-P. Lamoureux, Nicolas J. Cerf +3 more

We report on a fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms for 8-point functions. The measured visibility of the 8-path interferometer is about 97.5%. Potential applications of our setup to quantum communication or cryptographic protocols using several qubits are discussed.

Koji Nagata

Vladimir Silva

In this chapter, we study three algorithms of little practical use but important because they were the first to show that quantum computers can solve problems significantly faster than classical ones. Consider the time complexities O(n) for the algorithms: classical vs. quantum in Table 9-1 (where n is the size of the input).

Daowen Qiu, Shenggen Zheng

Mark Tame, M. S. Kim

We show that fundamental versions of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms can be performed using a small entangled cluster state resource of only six qubits. We then investigate the minimal resource states needed to demonstrate general $n$-qubit versions and a scalable method to produce them. For this purpose, we propose a versatile photonic on-chip setup.