全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

The Future of Quantum Computer Advantage

DOI: 10.4236/ajcm.2023.134034, PP. 619-631

Keywords: Quantum Computers, Qubit, Decoherence, Superposition, Entanglement, Parallelism, Hadamard Gates, Shor’s Algorithm, Bloch Sphere, Moore’s Law

Full-Text   Cite this paper   Add to My Lib

Abstract:

As technological innovations in computers begin to advance past their limit (Moore’s law), a new problem arises: What computational device would emerge after the classical supercomputers reach their physical limitations? At this moment in time, quantum computers are at their starting stage and there are already some strengths and advantages when compared with modern, classical computers. In its testing period, there are a variety of ways to create a quantum computer by processes such as the trapped-ion and the spin-dot methods. Nowadays, there are many drawbacks with quantum computers such as issues with decoherence and scalability, but many of these issues are easily emended. Nevertheless, the benefits of quantum computers at the moment outweigh the potential drawbacks. These benefits include its use of many properties of quantum mechanics such as quantum superposition, entanglement, and parallelism. Using these basic properties of quantum mechanics, quantum computers are capable of achieving faster computational times for certain problems such as finding prime factors of an integer by using Shor’s algorithm. From the advantages such as faster computing times in certain situations and higher computing powers than classical computers, quantum computers have a high probability to be the future of computing after classical computers hit their peak.

References

[1]  Google Research: Google Quantum.
https://quantumai.google/research
[2]  Tüftelakademie (2022) Quantum Computer - Quantum 1x1.
tueftelakademie.de/quantum1x1/quantum_computer/
[3]  IonQ Staff (2023) Quantum Computing 101: Introduction, Evaluation, and Applications.
ionq.com/resources/quantum-computing-101-introduction-evaluation-applications
[4]  Krambeck, D. (2015) Fundamentals of Quantum Computing.
https://www.allaboutcircuits.com/technical-articles/fundamentals-of-quantum-computing/
[5]  Brooks, M. (2023) What’s Next for Quantum Computing.
www.technologyreview.com/2023/01/06/1066317/whats-next-for-quantum-computing/
[6]  IBM Quantum Learning. Composer User Guide.
https://learning.quantum-computing.ibm.com/tutorial/composer-user-guide
[7]  Cyril. (2020) Introduction to Quantum Logic Gates.
http://einsteinrelativelyeasy.com/index.php/quantum-mechanics/153-introduction-to-quantum-logic-gates
[8]  Cyril. (2020) Introduction to Quantum Computing.
http://einsteinrelativelyeasy.com/index.php/quantum-mechanics/152-introduction-to-quantum-computing
[9]  Mullane, M. (2023) Quantum Computing 101.
https://medium.com/e-tech/quantum-computing-101-38306018d07c
[10]  Grumbling, E. and Horowitz, M. (2019) Quantum Computing: Progress and Prospects.
https://doi.org/10.17226/25196nap.nationalacademies.org/catalog/25196/
quantum-computing-progress-and-prospects
[11]  Yanofsky, N, and Mannucci, M. (2008) Introduction to Quantum Computing: Bloch Sphere.
https://akyrillidis.github.io/notes/quant_post_7
[12]  Dejen, A. and Ridwan, M. (2022) A Review of Quantum Computing. International Journal of Mathematical Sciences and Computing (IJMSC), 8, 49-59.
https://doi.org/10.5815/ijmsc.2022.04.05
[13]  Vos, J. (2019) All about Hadamard Gates.
https://freecontent.manning.com/all-about-hadamard-gates/
[14]  Wikipedia (2023) RSA (Cryptosystem).
https://en.wikipedia.org/wiki/RSA_(cryptosystem)
[15]  Marchenkova, A. (2015) Break RSA Encryption with This One Weird Trick.
https://medium.com/quantum-bits/break-rsa-encryption-with-this-one-weird-trick-d955e3394870
[16]  Velu, C. and Putra, F. (2023) How to Introduce Quantum Computers without Slowing Economic Growth.
https://pubmed.ncbi.nlm.nih.gov/37460723/
https://doi.org/10.1038/d41586-023-02317-x

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133