Abstract

Quantum computing is a promising field that emerged out of a combination of quantum physics and computer science. With ever expanding data across different areas, the conventional computer will run out of its capacity to handle such big data. Further, extracting the meaningful from big complex data still, accompany challenges with it. Quantum computing main goal is to provide such algorithms which are robust and faster in solving problems as compared to classical computers. In this paper, the limitations of a classical computer, basic features of quantum computing and its applications in the bioinformatics have been explored.

References

• Moore, G, E. 1965. Cramming More Components onto Integrated Circuits. Electronics, 38(8), 114–117.
• Hruska, J. 2013. Intel’s former chief architect: Moore’s law will be dead within a decade.
• Seabaugh, A. 2013. The Tunneling Transistor. IEEE Spectrum. Retrieved from https://spectrum.ieee.org/semiconductors/devices/the-tunneling-transistor
• IBM. 2019. IBM Unveils World's First Integrated Quantum Computing System for Commercial Use. Retrieved from https://newsroom.ibm.com/2019-01-08-IBM-Unveils-Worlds-First-Integrated-Quantum-Computing-System-for-Commercial-Use
• Bennett, H. C. 1995. Quantum information and computation. Physics Today. 24-30
• Dirac notation
• Sutor, B. 2018. Scientists Prove a Quantum Computing Advantage over Classical. IBM Research Blog.
• Olmschenk, S. et al. 2009. Quantum teleportation between distant matter qubits. Science, 323(5913), 486–489
• Bazille, H. 2014. Protein design: a NP-hard problem in bioinformatics. Computer Science. 1-33
• Kapun, E., & Tsarev, F. 2013. De Bruijn Superwalk with Multiplicities Problem is NP-hard. BMC bioinformatics, 14 Suppl 5(Suppl 5), S7. doi:10.1186/1471-2105-14-S5-S7
• Just, W. 2001. Computational complexity of multiple sequence alignment with SP-score. Journal of Computational Biol biology 8(6), 615–623.
• Wang, L. and Jiang, T. 1994. On the complexity of multiple sequence alignment. Journal of Computational Biology, 1, 337–348.
• Zaslavsky, E., & Singh, M. 2006. A combinatorial optimization approach for diverse motif finding applications. Algorithms for molecular biology: AMB, 1, 13. doi:10.1186/1748-7188-1-13
• Li, R. Y., Felice, R. D., Rohs, R., & Lidar, D. A. 2018. Quantum annealing versus classical machine learning applied to a simplified computational biology problem. Npj Quantum Information, 4(1), 14. https://doi.org/10.1038/s41534-018-0060-8
• Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., and Aspuru-Guzik, A. 2012. Finding low-energy conformations of lattice protein models by quantum annealing. Sci Rep, 2(571). doi: 10.1038/srep00571
• Jain, M and Chaturvedi, S.K. 2014. Quantum Computing Based Technique for Cancer Disease Detection System. J Comput Sci Syst Biol, 7, 095-102. doi: 10.4172/jcsb.1000143