A scalable method for demonstrating the Deutsch-Jozsa and Bernstein-Vazirani algorithms using cluster states

2010/03/31 by M. S. Tame, M. S. Kim · 1 citation
Physics and Astronomy · #quant-ph

paper · pdf · doi:10.1103/physreva.82.030305

published as Phys. Rev. A 82, 030305(R) (2010) · 4 pages, 3 figures, RevTeX4

arxiv created 2010/10/01 · arxiv updated 2015/03/13

Abstract

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 arbitrary n-qubit versions and a scalable method to produce them. For this purpose we propose a versatile on-chip photonic waveguide setup.

Cited by

• Blind Quantum Computation on a Modular Superconducting Processor

Related

• Experimental realization of the Deutsch-Jozsa algorithm with a six-qubit cluster state
• Deterministic generation of a two-dimensional cluster state
• Scheme for implementing the Deutsch-Jozsa algorithm via atomic ensembles
• Cluster States Generation with a Quantum Metasurface
• Success rates for linear optical generation of cluster states in coincidence basis