A scalable method for demonstrating the Deutsch-Jozsa and Bernstein-Vazirani algorithms using cluster states
classification
🪐 quant-ph
keywords
algorithmsbernstein-vaziraniclusterdeutsch-jozsamethodresourcescalablestates
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.