Optical implementations, oracle equivalence, and the bernstein–vazirani algorithm

Journal of the Optical Society of America B: Optical Physics

Volumn 24, Issue 2, 2007, Pages 221-225

  Arvind, ^a,b   Kaur, Gurpreet ^a   Narang, Geetu ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b GURU NANAK DEV UNIVERSITY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85010127613     PISSN: 07403224     EISSN: None     Source Type: Journal    
DOI: 10.1364/JOSAB.24.000221     Document Type: Article

References (29)

1. D. P. DiVincenzo, “Quantum computation,” Science 270, 255–261 (1995).
2. C. H. Bennett, “Quantum information and computation,” Phys. Today 48(10), 24–30 (1995).
3. C. H. Bennett and D. P. DiVincenzo, “Quantum information and computation,” Nature 404, 247–255 (2000).
4. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Phys. Rev. A 52, 3457–3467 (1995).
5. D. P. DiVincenzo, “Two-bit gates are universal for quantum computation,” Phys. Rev. A 51, 1015–1022 (1995).
6. D. P. DiVincenzo, “Quantum gates and circuits,” Proc. R. Soc. London Ser. A 454, 261–276 (1998).
7. R. P. Feynmann, “Simulating physics with computers,” Int. J. Theor. Phys. 21, 467–488 (1982).
8. P. Benioff, “Quantum mechanical models of Turing machines that dissipate no energy,” Phys. Rev. Lett. 48, 1581–1585 (1982).
9. D. Deutsch, “Quantum-theory, the Church–Turing principle and the universal quantum computer,” Proc. R. Soc. London Ser. A 400, 97–117 (1985).
10. D. Deutsch, “Quantum computational networks,” Proc. R. Soc. London Ser. A 425, 73–90 (1989).
11. D. Deutsch and R. Jozsa, “Rapid solution of problems by quantum computation,” Proc. R. Soc. London Ser. A 439, 553–558 (1992).
12. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comput. 26, 1484–1509 (1997).
13. A. Ekert and R. Jozsa, “Quantum computation and Shor’s factoring algorithm,” Rev. Mod. Phys. 68, 733–753 (1996).
14. L. K. Grover, “Quantum mechanics helps in searching for a needle in a haystack,” Phys. Rev. Lett. 79, 325–328 (1997).
15. E. Bernstein and U. Vazirani, “Quantum complexity theory,” SIAM J. Comput. 26, 1411–1473 (1997).
16. M. Horodecki, “Entanglement measures,” Quantum Inf. Comput. 1, 3–26 (2001).
17. R. Jozsa, Entanglement and Quantum Computation (Oxford U. Press, 1998).
18. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge U. Press, 2000).
19. R. Jozsa and N. Linden, “On the role of entanglement in quantum-computational speed up,” Proc. R. Soc. London Ser. A 459, 2011–2032 (2003).
20. D. Kenigsberg, T. Mor, and G. Ratsaby, “Quantum advantage without entanglement,” arXiv.org e-print archive, quant-ph/0511272, November 30, 2005, http://arxiv.org/lanl/quant-ph/0511272.
21. R. Simon and N. Mukunda, “Minimal 3-component SU(2) gadget for polarization optics,” Phys. Lett. A 143, 165–169 (1990).
22. D. A. Meyer, “Sophisticated quantum search without entanglement,” Phys. Rev. Lett. 85, 2014–2017 (2000).
23. B. M. Terhal and J. A. Smolin, “Single quantum querying of a database,” Phys. Rev. A 58, 1822–1826 (1998).
24. D. Collins, K. W. Kim, and W. C. Holton, “Deutsch–Jozsa algorithm as a test of quantum computation,” Phys. Rev. A 58, R1633–R1636 (1998).
25. Arvind, “Quantum entanglement and quantum computational algorithms,” Pramana J. Phys. 56, 357–365 (2001).
26. Arvind, K. Dorai, and A. Kumar, “Quantum entanglement in the NMR implementation of the Deutsch–Jozsa algorithm,” Pramana, J. Phys. 56, L705–L713 (2001).
27. J. Du, M. Shi, X. Zhou, Y. Fan, B. Ye, R. Han, and J. Wu, “Implementation of a quantum algorithm to solve the Bernstein–Vazirani parity problem without entanglement on an ensemble quantum computer,” Phys. Rev. A 64, 042306 (2001).
28. E. Brainis, L.-P. Lamoureux, N. J. Cerf, Ph. Emplit, M. Haelterman, and S. Massar, “Fiber-optics implementation of the Deutsch–Jozsa and Bernstein–Vazirani quantum algorithms with three qubits,” Phys. Rev. Lett. 90, 157902 (2003).
29. J. Siewert and R. Fazio, “Quantum algorithms for Josephson networks,” Phys. Rev. Lett. 87, 257905 (2001).