A scalable method for demonstrating the Deutsch-Jozsa and Bernstein-Vazirani algorithms using cluster states
arXiv:1003.4974 · doi:10.1103/PhysRevA.82.030305
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.
4 pages, 3 figures, RevTeX4
References in corpus (13)
- Quantum Computing
- Photonic quantum technologies
- Silica-on-Silicon Waveguide Quantum Circuits
- Resource-efficient linear optical quantum computation
- High-speed linear optics quantum computing using active feed-forward
- Generation of high-fidelity four-photon cluster state and quantum-domain demonstration of one-way quantum computing
- Active one-way quantum computation with 2-photon 4-qubit cluster states
- Experimental realization of a quantum game on a one-way quantum computer
- Potential and limits to cluster state quantum computing using probabilistic gates
- Cluster-state quantum computing enhanced by high-fidelity generalized measurements
- One-way quantum computation with two-photon multiqubit cluster states
- Experimental Realization of the Deutsch-Jozsa Algorithm with a Six-Qubit Cluster State
- Compact Toffoli gate using weighted graph states
Cited by in corpus (5)
- Noisy One-Way Quantum Computations: The Role of Correlations
- Experimental Realization of a One-way Quantum Computer Algorithm Solving Simon's Problem
- Experimental characterization of photonic fusion using fiber sources
- Experimental Realization of a Four-Photon Seven-Qubit Graph State for One-Way Quantum Computation
- Three-qubit Deutsch-Jozsa in measurement-based quantum computing