Classical and Quantum Computing modalities - A Review

Dr. Rajni

doi:10.61343/jcm.v2i02.72

Authors

Dr. Rajni Department of Physics, Patel Memorial National College, Rajpura, Punjab, INDIA

DOI:

https://doi.org/10.61343/jcm.v2i02.72

Keywords:

Classical Bits, Quantum bits, Computational Methods

Abstract

Quantum computers generally need to operate under more regulated physical condition than classical computer because of quantum mechanics. Classical computer uses bits and quantum computer use qubits. According to IBM, “Groups of quits in superposition can create complex, multidimensional computational spaces” that enable more complex calculations. Quantum algorithms like Shor’s and Grover’s run significantly faster than various algorithms for classical computer. Quantum entanglement offers fascinating opportunities for enhancing AI algorithms through improved computational efficiency. But practical implementation remains challenging due to technical limitations and the need for further research in the field of quantum machine learning. This article provides a brief overview of different quantum computing methods.

References

A Steane, “Quantum computing”, Reports on Progress in Physics, 61:117-173, 1998.

B M Terhal, “Quantum supremacy, here we come”, Nature Physics, 14: 530-531, 2018.

H D Zeh, “Feynman’s interpretation of quantum theory”, The European Physical Journal H, 36:63-74, 2011.

P W Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer”, SIAM review, 41: 303-332, 1999.

S Aaronson and Ambainis, A Forrelation, “A problem that optimally separates quantum from classical computing”, In Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pages 307–316, 2015.

J Anandan and Y Aharonov, “Geometry of quantum evolution”, Physical review letters, 65:1697-1700, 1990.

L. Gurvits, “Classical complexity and quantum entanglement”, Journal of Computer and System Sciences, 69: 448–484, 2004.

B Lu, M Lin, Y Shu et al., “Approximation of the nearest classical state to a quantum state”, arXiv preprint arXiv:2301.09316, 2023.

B W Reichardt, F Unger, and U. Vazirani, “Classical command of quantum systems”, Nature, 496: 456–460, 2013.

C M Unsal and A Yavuz Oruc, “Faster quantum concentration via grover’s search”, International Journal of Parallel, Emergent and Distributed Systems, pages 1–16, 2023.

I L Chuang, N Gershenfeld, and M Kubinec, “Experimental implementation of fast quantum searching”, Physical Review Letters, 80: 3408–3411, 1998.

H L Huang, D C Wu, D J Fan, et al, “Superconducting Quantum Computing: A Review”, Science China Information Sciences, 63: 180501, 2020.

N Maring, A Fyrillas, M Pont. et al, “A versatile single-photon-based quantum computing platform”, Nat. Photon,18: 603–609, 2024.

H S Zhong, et al, “Quantum computational advantage using photons”, Science, 370: 1460–1463, 2020.

P Michler, A Imamoglu, M D Mason, P J Carson, G F Strouse, and S K Buratto, “Quantum correlation among photons from a single quantum dot at room temperature”, Nature (London), 406:968, 2000.

Colin D. Bruzewicz, John Chiaverini, Robert McConnell, Jeremy M. Sage, “Trapped-ion quantum computing: Progress and challenges”, Appl. Phys. Rev., 6: 021314, 2019.

L Zhao et al, “Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers”, npj Quantum Inf., 9: 60, 2023.

J J Cirac and P Zoller, “Quantum computations with cold trapped ions”, Physical Review Letters, 74:4091–4094, 1995.

N Jain, B Coyle, E Kashefi, & N Kumar, “Graph neural network initialization of quantum approximate optimization”, Quantum, 6: 861, 2022.

D Loss and D P DiVincenzo, “Quantum computation with quantum dots”, Physical Review A, 57:120–126, 1998.

T Calarco, A Datta, P Fedichev, E Pazy, and P Zoller, “Spin-based all-optical quantum computation with quantum dots: Understanding and suppressing decoherence”, Physical Review A, 68:012310, 2003.

A Skinner, M Davenport, and B Kane, “Hydrogenic spin quantum computing in silicon: A digital approach”, Physical Review Letters, 90:087901–087905, 2003.

D Copsey, M Oskin, F Impens, T Metodiev, “A Cross, F Chong, and J Chuang Kubiatowicz. Toward a scalable, silicon-based quantum computing architecture”, Journal of Selected Topics in Quantum Electronics, 9:1552–1569, 2003.

W Li, Z Yin, X Li et al., “A hybrid quantum computing pipeline for real world drug discovery”, Sci Rep, 14: 16942, 2024.

A Gircha, A Boev, K Avchaciov, P Fedichev & A Fedorov, “Hybrid quantum-classical machine learning for generative chemistry and drug design”, Sci. Rep., 13: 8250, 2023.

A G Bracamonte, “Quantum Semiconductors Based on Carbon Materials for Nanophotonics and Photonics Applications by Electron Shuttle and Near Field Phenomena”, Recent Progress in Materials, 5:03, 2023.

Meng Ye, Ye Tian, Jian Lin, Yuchen Luo, Jiaqi You, Jiazhong Hu, Wenjun Zhang, Wenlan Chen, and Xiaopeng Li., “Universal Quantum Optimization with Cold Atoms in an Optical Cavity”, Phys. Rev. Lett., 131: 103601, 2023.

M W Doherty et al., “Theory of the ground-state spin of the NV− center in diamond”, Phys. Rev. B, 85: 205023, 2012.

Q L He, et al., “Chiral Majorana fermion modes in a quantum anomalous Hall insulator superconductor structure”, Science, 357: 294–299, 2017.

AY Kitaev, “Unpaired Majorana fermions in quantum wires”, Phys-Usp, 44: 131–136, 2001.

D Aasen, et al., “Milestones toward Majorana-based quantum computing”, Phys Rev X, 6: 031016, 2016.

M Mohseni, P Read, H Neven et al., “Commercialize quantum technologies in five years”, Nature, 543: 171-174, 2017.

S Aaronson. “Ten semi-grand challenges for quantum computing theory”, 2005.

S Aaronson and A Ambainis, “The need for structure in quantum speedups. Theory of Computing”, 10: 133–166, 2014.

C Outeiral et al., “The prospects of quantum computing in computational molecular biology”, Wiley Interdiscip. Rev. Comput. Mol. Sci., 11: e1481, 2021.

R Santagati et al., “Drug design on quantum computers”, Nat. Phys., 20: 549–557, 2024.

N S Blunt et al., “Perspective on the current state-of-the-art of quantum computing for drug discovery applications”, J. Chem. Theory Comput., 18: 7001–7023, 2022.