CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Basic Quantum Algorithms and Applications

by Marufa Rahmi, Debakar Shamanta, Ayesha Tasnim
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 56 - Number 4
Year of Publication: 2012
Authors: Marufa Rahmi, Debakar Shamanta, Ayesha Tasnim
10.5120/8880-2868

Marufa Rahmi, Debakar Shamanta, Ayesha Tasnim . Basic Quantum Algorithms and Applications. International Journal of Computer Applications. 56, 4 ( October 2012), 26-31. DOI=10.5120/8880-2868

@article{ 10.5120/8880-2868,
author = { Marufa Rahmi, Debakar Shamanta, Ayesha Tasnim },
title = { Basic Quantum Algorithms and Applications },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 56 },
number = { 4 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 26-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume56/number4/8880-2868/ },
doi = { 10.5120/8880-2868 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:58:00.615170+05:30
%A Marufa Rahmi
%A Debakar Shamanta
%A Ayesha Tasnim
%T Basic Quantum Algorithms and Applications
%J International Journal of Computer Applications
%@ 0975-8887
%V 56
%N 4
%P 26-31
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Quantum computation, the ultimate goal of future computing, is an interesting field for researchers. The concept of quantum computation is based on basics of quantum mechanics. A quantum computer is a device for computation that makes direct use of quantum mechanical phenomena such as superposition and entanglement, to perform operations on data. The basic principle behind quantum computation is that quantum properties can be used to represent data and perform operations on these data. A quantum computer operates by manipulating the qubits with a fixed sequence of quantum logic gates. The sequence of gates to be applied is called a quantum algorithm. The field of quantum computation algorithm is fast moving and the scope is vast. Major quantum algorithms are summarized in this paper along with their applications.

References
  1. VlatkoVedral, Martin B. Plenio, Basics of Quantum Computation, Progress in quantum electronics, vol 22, (1998).
  2. John Preskill, Making Weirdness Work: Quantum Information and Computation.
  3. Peter W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.
  4. J. Eisert, M. M. Wolf, Quantum Computing.
  5. Grover L. K, A fast quantum mechanical algorithm for database search, Proceedings, 28th Annual ACM Symposium on the Theory of Computing, (May 1996) p. 212.
  6. Lov K. Grover (1996). "A fast quantum mechanical algorithm for database search", Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing:212–219.
  7. Vidya Raj C and M. S. Shivakumar, Applying Quantum Algorithm to Speed Up the Solution of Hamiltonian Cycle Problems, IFIP International Federation for Information Processing, Springer Boston, Volume 228/2007:53-61
  8. Goong Chen, Stephen A. Fulling, Jeesen Chen, Generalization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time, quant-ph/0007123, Jul 2000.
  9. Forman, G. 2003. An extensive empirical study of feature selection metrics for text classification. J. Mach. Learn. Res. 3 (Mar. 2003), 1289-1305.
  10. Sannella, M. J. 1994 Constraint Satisfaction and Debugging for Interactive User Interfaces. Doctoral Thesis. UMI Order Number: UMI Order No. GAX95-09398. , University of Washington.
  11. David Deutsch and Richard Jozsa (1992). "Rapid solutions of problems by quantum computation". Proceedings of the Royal Society of London A439: 553.
  12. Cleve, A. Ekert, C. Macchiavello, and M. Mosca (1998). "Quantum algorithms revisited", Proceedings of the Royal Society of London A454: 339–354.
  13. Hartmut Klauck, Quantum time-space tradeoffs for sorting, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, San Diego, CA, USA, Session 2A : 69 – 76(2003).
  14. P. Høyer, J. Neerbek, Y. Shi (2001). Quantum complexities of ordered searching, sorting, and element distinctness, 28th International Colloquium on Automata, Languages, and Programming: 62-73.
  15. Andris Ambainis , A Better Lower Bound for Quantum Algorithms Searching an Ordered List, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, Page: 352 (1999).
  16. Sean Hallgren, Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem, Proceedings of the 34th ACM Symposium on Theory of Computing, 2002 Pages: 653-658.
Index Terms

Computer Science
Information Sciences

Keywords

Qubit Black box quantum computer known as an Oracle Hadamard Transformation Hadamard Gates Superposition Eigen value Eigenstate

Powered by PhDFocusTM