Call for Paper - January 2021 Edition
IJCA solicits original research papers for the January 2021 Edition. Last date of manuscript submission is December 21, 2020. Read More

Matrix Representation of Quantum Gates

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Aradhyamath Poornima, Naghabhushana N. M., Rohitha Ujjinimatad
10.5120/ijca2017913011

Aradhyamath Poornima, Naghabhushana N M. and Rohitha Ujjinimatad. Matrix Representation of Quantum Gates. International Journal of Computer Applications 159(8):1-6, February 2017. BibTeX

@article{10.5120/ijca2017913011,
	author = {Aradhyamath Poornima and Naghabhushana N. M. and Rohitha Ujjinimatad},
	title = {Matrix Representation of Quantum Gates},
	journal = {International Journal of Computer Applications},
	issue_date = {February 2017},
	volume = {159},
	number = {8},
	month = {Feb},
	year = {2017},
	issn = {0975-8887},
	pages = {1-6},
	numpages = {6},
	url = {http://www.ijcaonline.org/archives/volume159/number8/27018-2017913011},
	doi = {10.5120/ijca2017913011},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

The field of quantum computing is growing rapidly and there is a surprisingly large literature. Research in this area includes the design of quantum reversible circuits and developing quantum algorithms for the models of quantum computing. This paper is focused on representing quantum reversible gates in matrix form. In turn these matrices can be used to develop quantum circuits with help of K-Map. Also this paper gives the historical development of quantum algorithms and basics concepts in quantum compuation.

References

  1. R. P. Feynman, ”Simulating Physics with Computers,” International Journal of Theoretical Physics, vol. 21, no. 6/7, pp. 467- 488, 1982.
  2. R. P. Feynman, Quantum mechanical computers, Foundation of Physics, Vol. 16, pp. 507 - 531(1986). (Originally appeared in optics news, February 1985).
  3. C. H. Bennet, Logical reversibility of computation, IBM Journal of Research and Development 17 (1973) 525532.
  4. Benioff . P. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turning machines. Journal of Statistical Physics 22(5):563-591.
  5. Benioff. P. quantum mechanical Hamiltonian model of Turning machines Journal of Statistical Physics Vol 29, pp. 515- 546 (1982)
  6. Benioff . P. quantum mechanical Hamiltonian model of Turning machines that dissipate no energy, Physics Review letters Vol. 48, pp. 1581 - 1585 (1982)
  7. C. H. Bennett and G. Brassard, in Proc. IEEE Int. Conf. on Computers, Systems, and Signal Processing, Bangalore, India (1984), pp. 175179.
  8. S. Wiesner, ” Conjugate coding, ” written circa 1970 and belatedly published in Siact News 15(1), pp. 78-88, 1983
  9. A.C. Yao, Quantum circuit complexity, in: Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Science, 1993, pp. 352361.
  10. A. Barenco, C. Bennet, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J.A. Smolin, H. Weinfurter, Elementary gates for quantum computation, Physical Review A 52 (1995) 34573467.
  11. V. V. Shende, A.S. Bullock, I. L. Markov, Synthesis of quantum-logic circuits, IEEE Transactions on Computer- Aided Design of Integrated Circuits and Systems 25 (2006) 10001010.
  12. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society of London A400:97117.
  13. Deutsch D. Quantum computational networks, Proceedings of the Royal Society of London, Vol. A425, 7390, 1989.
  14. D. Deutsch, R. Jozsa, Rapid solution of problems by quantum computation, Proceedings of the Royal Society of London A 439 (1992) 553.
  15. Shor P.W. Algorithms for quantum computation: discrete logarithms and factoring, In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 124134. IEEE Press.
  16. Shor P. W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, http://arxiv.org/abs/quant-ph/9508027v2
  17. Grover L. K. A fast quantum mechanical algorithm for database search, In Proceedings of the 28th Annual ACM Symposium on the Theory of Computation, pages 212219. ACM Press. Also arXiv:quant-ph/9605043.
  18. Grover L. K. Quantum mechanics helps in searching for a needle in a haystack, Physical Review letters 79(2), pp. 325- 328, 1997.
  19. L. K. Grover, Quantum telecomputation, arXiv:quantph/ 9704012.
  20. M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.
  21. T. Toffoli, Reversible computing , Tech. Memo MIT/LCS/TM- 151, MIT Lab. For Com. Sci. 1980.

Keywords

Quantum Computation, Quantum gates, Qubits