CFP last date

by
M.A. Jayaram,
Goutami Adavi

International Journal of Computer Applications |

Foundation of Computer Science (FCS), NY, USA |

Volume 183 - Number 43 |

Year of Publication: 2021 |

Authors: M.A. Jayaram, Goutami Adavi |

10.5120/ijca2021921834 |

M.A. Jayaram, Goutami Adavi . Quantum Computing: Some Percepts and Realms of Applications. International Journal of Computer Applications. 183, 43 ( Dec 2021), 17-22. DOI=10.5120/ijca2021921834

@article{
10.5120/ijca2021921834,

author = {
M.A. Jayaram,
Goutami Adavi
},

title = { Quantum Computing: Some Percepts and Realms of Applications },

journal = {
International Journal of Computer Applications
},

issue_date = { Dec 2021 },

volume = { 183 },

number = { 43 },

month = { Dec },

year = { 2021 },

issn = { 0975-8887 },

pages = {
17-22
},

numpages = {9},

url = {
https://ijcaonline.org/archives/volume183/number43/32219-2021921834/
},

doi = { 10.5120/ijca2021921834 },

publisher = {Foundation of Computer Science (FCS), NY, USA},

address = {New York, USA}

}

%0 Journal Article

%1 2024-02-07T01:19:33.268112+05:30

%A M.A. Jayaram

%A Goutami Adavi

%T Quantum Computing: Some Percepts and Realms of Applications

%J International Journal of Computer Applications

%@ 0975-8887

%V 183

%N 43

%P 17-22

%D 2021

%I Foundation of Computer Science (FCS), NY, USA

A quantum computer is akin to a classical computer in multiple ways. Analogous to a conventional computer, the information could be stored in some physical system. One needs to invoke the system, perform some sort of operations possibly by means of running a program, and extract the information. Nevertheless, simply told, quantum computing differs from classical computing in two key succinct elements. Firstly, quantum computers can acquire a well defined quantum state, but subjected to random behavior this is the idea of superposition. Secondly, the random behavior goes in a correlated manner – this is the idea of entanglement. Of course, these ideas are the hall mark of quantum computing counterintuitive though. At a very intricate level, conventional computers are mired in digital logical circuits dealing with long strings of 0’s and 1’s. While quantum computing runs on quantum bits aptly called QBITS. Qbits need not have to be binary during computations; they can actually exit in well defined combinations of 0s and 1s. This review paper has intuitive intents that are more than one; to provide an exposition of the topic to an interested novice, to explore possible applications of quantum computing, to delineate the prospective stake holders once quantum computing heralds new vistas, to throw the light on this topic in terms of possible disruptions that may happen in foreseeable future, and to emphasize the impacts of quantum computing.

- Quantum computers, 2020 available at: https://research.google/teams/applied-science/quantum/,
- Microsoft Quantum, 2020, available at : https://cloudblogs.microsoft.com/quantum/
- IBM Q-Ntwork: An Engine for Discovery, available at: https://www.ibm.com/quantum-computing/network/overview/
- Intel: Quantum Computing, available at https://www.intel.com/content/www/us/en/research/quantum-computing.html?wapkw=Quantum%20computing.
- Quantum computing: Spot-Checking Million Lines of Code, available at : https://www.lockheedmartin.com/en-us/news/features/2017/quantum-computing-spot-checking-millions-lines-code.html.
- R. P. Feynman, 1982, “Simulating physics with computers,” International Journal of Theoretical Physics, vol. 21, no. 6, pp. 467–488.
- D. Deutsch, Quantum theory, the Church–Turing principle and the universal quantum computer, 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, vol. 400, no. 1818, pp. 97–117.
- ——, “Quantum mechanics helps in searching for a needle in a haystack,” 1997, Phys. Rev. Lett., vol. 79, pp. 325–328.
- L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, ser. STOC ’96. New York, NY, USA: ACM, 1996, pp. 212–219.Available: http://doi.acm.org/10. 1145/237814.237866
- P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” 1997,SIAM J. Comput., vol. 26, no. 5, pp. 1484–1509
- P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” 1994,in Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124–134.
- Francesco Bova, Avi Goldfarb , Roger G. Melko, 2021, Commercial applications of quantum computing, EPJ Quantum Technology, 8(2), pp 1-13
- Quantum computing, https://www.scottaaronson.com/blog/?p=1400.
- Adolfy Hoisie, Los Alamos National Laboratory Vladimir Getov, 2009, Computer, Published by IEEE Computer Society, PP 24-26
- B. E. Kane, 1998,“A silicon-based nuclear spin quantum computer,” Nature, vol. 393, pp. 133–137.
- J. J. Pla, K. Y. Tan, J. P. Dehollain, W. H. Lim, J. J. Morton, D. N. Jamieson, A. S. Dzurak, and A. Morello, 2012, “A single-atom electron spin qubit in silicon,” Nature, vol. 489, no. 7417, p. 541.
- Bahman Zohuri, Farhang Mossavar Rahmani, What is Quantum Computing and How it Works, Artificial Intelligence Driven by Quantum Computing, Modern Approaches on Material Science, Lupine Publishers, pp 343-348
- C.P.Williums, 2011, Quantum Gates, Explorations in Quantum Computing, Texts in Computer Science, Springer-Verlag London Limited, PP 51-73.
- Quantum Computer, https://en.wikipedia.org/wiki/Quantum_computing
- L. M. Vandersypen and I. L. Chuang, 2005,“NMR techniques for quantum control and computation,” Reviews of modern physics, vol. 76, no. 4, p. 1037.
- D. Deutsch, Quantum theory, the Church–Turing principle and the universal quantum computer, 1985,Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, vol. 400, no. 1818, pp. 97–117.
- Arathi Udayakumar, Quantum Computer Architecture, Research Gate, 2020. 10.13140/RG.2.2.36794.82881.
- B.Bhishnoi, 2020,Quantum Computation and Applications, Semantic Scholar.

Computer Science

Information Sciences