Preferences help
enabled [disable] Abstract
Number of results
2016 | 28 | 41-56
Article title

Deutsch-Jozsa Algorithm for Three Fermions System

Title variants
Languages of publication
One of the most important quantum algorithms is Dutsch-Jozsa algorithm. It is one of the most basic ways to demonstrate the power of quantum computation. In this research a system consists of three electron (fermions) in state |0˃ and one in state |1˃ the Hadamard transform was applied on all states. Then, the black box is applied to compute f. Finally it has been applied the Hadamard gate. It was proved this quantum information processing system can solve Deutsch’s problem with one evaluation of the function f while the classical system requires (2n/2 + 1 = 5) evaluations.
Physical description
  • Department of Physics, College of Science, Al- Mustansiriyah University, Baghdad, Iraq
  • Department of Computer Science, College of Science, Baghdad University, Baghdad, Iraq
  • Department of Physics, College of Science, Al- Mustansiriyah University, Baghdad, Iraq
  • [1] Alastair, A. A.; The Deutsch-Jozsa Problem: De-quantization and Entanglement. Centre for Discrete Mathematics and Theoretical Computer Science University of Auckland, New Zealand, CDMTCS-371, 2009.
  • [2] Gulde, S., Riebe, M., Lancaster, G.P., Becher, C., Eschner, J., Haffner, H., Kaler, F.S., Chuang, I.L., and Blatt, R.; Implementation of the Deutsch-Jozsa Algorithm on an Ion-Trap Quantum Computer. Nature Publishing Group, Vol. 421, No. 2, Pp. 48-50, 2003.
  • [3] Batty, M.; Casaccino, A.; Duncan, A.J.; Rees, S. and Severini, S. An Application of the Deutsch-Jozsa Algorithm to Formal Languages and the Word Problem in Groups. Springer-Verlag Berlin Heidelberg, Pp. 57-59, 2008.
  • [4] Zhang, P., Jiang, Y., Liu, R.F., Gao, H., Li, H.R., and Lia, F.; Implementing the Deutsch's algorithm with Spin-Orbital Angular Momentum of Photon without Interferometer. Optics Communications, 285, Pp. 838-841, 2012.
  • [5] Kiktenko, E.O., Fedorov, A.K. Strakhovd A.A.; and Man’ko, V.I; Single Qudit Realization of the Deutsch Algorithm using Superconducting Many-Level Quantum Circuits. Physics Letters A, Vol. 379, No. 22-23, Pp. 1409-1413, 2015.
  • [6] Marinescu, D. C. and Marinescu, G. M.; Classical and Quantum, Information. Elsevier, 2012.
  • [7] Nielsen, M.A. and Chuang, I.L.; Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, England, 2010.
  • [8] Mermin, N.D.; Quantum Computer Science: An Introduction. United States of America by Cambridge University, 2007.
  • [9] Cleve R., Ekert A., Macchiavello C. and Mosca M.; Quantum Algorithms Revisited. Proceedings of the Royal Society of London Vol. 454, Pp. 339-354, 1998.
  • [10] Alina, V. Quantum Algorithms for Computing the Boolean Function and Verifying Repetition Code. Computer Science and Information Technologies, Vol. 756, Pp. 227-247, 2010.
  • [11] Nisan M. S. On the Degree of Boolean Functions as Real Polynomials. Computational Complexity, Vol. 4, No. 4, Pp. 301-313, 1994.
Document Type
Publication order reference
YADDA identifier
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.