Quantum information science

Last updated

Quantum information science is an interdisciplinary field that combines the principles of quantum mechanics, information theory, and computer science to explore how quantum phenomena can be hanessed for the processing, analysis, and transmission of information. [1] Quantum information science covers both theoretical and experimental aspects of quantum physics, including the limits of what can be achieved with quantum information. The term quantum information theory is sometimes used, but it refers to the theoretical aspects of information processing and does not include experimental research. [2]

Contents

At its core, quantum information science explores how information behaves when stored and manipulated using quantum systems. Unlike classical information, which is encoded in bits that can only be 0 or 1, quantum information uses quantum bits or qubits that can exist simultaneously in multiple states because of superposition. [3] Additionally, entanglement—a uniquely quantum linkage between particles—enables correlations that have no classical counterpart. [4] [5] [6] Quantum information science is not only changing our understanding of information, but is also paving a new way for advancements in quantum computing, quantum communication, quantum metrology and quantum sensing. [7]

Scientific and engineering studies

Quantum information science is inherently interdisciplinary, bringing together physics, computer science, mathematics, and engineering. It involves developing theoretical frameworks, designing quantum algorithms, constructing quantum hardware, and implementing quantum communication protocols. [8]

Quantum teleportation, entanglement and the manufacturing of quantum computers depend on a comprehensive understanding of quantum physics and engineering. Google and IBM, among others, have invested significantly in quantum computer hardware research, leading to significant progress in manufacturing quantum computers since the 2010s. Currently, it is possible to build a quantum computer with over 100 qubits, but the error rates are high due to several factors including decoherence, [9] the lack of suitable hardware and materials for quantum computer manufacturing, which make it difficult to create a scalable quantum computer. [10]

Quantum cryptography devices are now available for commercial use. The one time pad, a cipher used by spies during the Cold War, uses a sequence of random keys for encryption. These keys can be securely exchanged using quantum entangled particle pairs, as the principles of the no-cloning theorem and wave function collapse ensure the secure exchange of the random keys. The development of devices that can transmit quantum entangled particles is a significant scientific and engineering goal.[ citation needed ]

Qiskit, Cirq and Q Sharp are popular quantum programming languages. Additional programming languages for quantum computers are needed, as well as a larger community of competent quantum programmers. To this end, additional learning resources are needed, since there are many fundamental differences in quantum programming which limits the number of skills that can be carried over from traditional programming. [11] OpenQASM (Open Quantum Assembly Language) is a machine-independent imperative programming language designed to describe quantum circuits. It is based on the quantum circuit model and represents quantum programs as ordered sequences of parameterized operations, including gates, measurements, resets, and real-time classical computations. Beyond implementing quantum algorithms, OpenQASM also enables the specification of circuits for tasks such as characterization, validation, and debugging of quantum processors. [12]

Quantum algorithms and quantum complexity theory are two of the subjects in algorithms and computational complexity theory. In 1994, mathematician Peter Shor introduced a quantum algorithm for prime factorization [13] that, with a quantum computer containing 4,000 logical qubits, could potentially break widely used ciphers like RSA and ECC, posing a major security threat. This led to increased investment in quantum computing research and the development of post-quantum cryptography [14] to prepare for the fault-tolerant quantum computing (FTQC) era. [15] [16]

See also

References

  1. ↑ Watrous, John (2018-04-26). The Theory of Quantum Information. Cambridge University Press. ISBN   978-1-316-85312-2.
  2. ↑ "Quantum Information Science". www.pnnl.gov. Retrieved 2025-08-06.
  3. ↑ Nielsen, Michael A.; Chuang, Isaac L. (2010-12-09). Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press. ISBN   978-1-139-49548-6.
  4. ↑ Bub, Jeffrey (2023), "Quantum Entanglement and Information", in Zalta, Edward N.; Nodelman, Uri (eds.), The Stanford Encyclopedia of Philosophy (Summer 2023 ed.), Metaphysics Research Lab, Stanford University, retrieved 2025-08-06
  5. ↑ Brukner, Caslav; Zukowski, Marek (2009). "Bell's Inequalities: Foundations and Quantum Communication". arXiv: 0909.2611 [quant-ph].
  6. ↑ Braunstein, S. L. (2005). "Entanglement in Quantum Information Processing". In Akulin, V.M.; Sarfati, A.; Kurizki, G.; Pellegrin, S. (eds.). NATO Science Series II: Mathematics, Physics and Chemistry. Vol. 189. Dordrecht: Springer Netherlands. pp. 17–26. Bibcode:2005deip.book...17B. doi:10.1007/1-4020-3283-8_3. ISBN   978-1-4020-3283-7.{{cite book}}: |journal= ignored (help); Missing or empty |title= (help)
  7. ↑ "Quantum Sensing & Metrology". 60. Quantum Innovation Centre (QINC). Retrieved 2025-08-06.
  8. ↑ "Quantum Information Science". Energy.gov. 2024-11-15. Retrieved 2025-08-06.
  9. ↑ Schlosshauer, Maximilian (2019-10-25). "Quantum decoherence". Physics Reports. 831: 1–57. arXiv: 1911.06282 . Bibcode:2019PhR...831....1S. doi:10.1016/j.physrep.2019.10.001. ISSN   0370-1573.
  10. ↑ de Leon, Nathalie P.; Itoh, Kohei M.; Kim, Dohun; Mehta, Karan K.; Northup, Tracy E.; Paik, Hanhee; Palmer, B. S.; Samarth, N.; Sangtawesin, Sorawis; Steuerman, D. W. (2021-04-16). "Materials challenges and opportunities for quantum computing hardware". Science. 372 (6539): eabb2823. Bibcode:2021Sci...372.2823D. doi:10.1126/science.abb2823. OSTI   1777671. PMID   33859004.{{cite journal}}: CS1 maint: article number as page number (link)
  11. ↑ Ömer, Bernhard (2005-07-01). "Classical Concepts in Quantum Programming". International Journal of Theoretical Physics. 44 (7): 943–955. arXiv: quant-ph/0211100 . Bibcode:2005IJTP...44..943O. doi:10.1007/s10773-005-7071-x. ISSN   1572-9575.
  12. ↑ "Introduction to OpenQASM". IBM Quantum Documentation. Retrieved 2025-08-22.
  13. ↑ Shor, Peter W. (January 1999). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer" . SIAM Review. 41 (2): 303–332. Bibcode:1999SIAMR..41..303S. doi:10.1137/S0036144598347011. ISSN   0036-1445.
  14. ↑ Bernstein, Daniel J. (2025), "Post-quantum Cryptography" , Encyclopedia of Cryptography, Security and Privacy, Springer, Cham, pp. 1846–1847, doi:10.1007/978-3-030-71522-9_386, ISBN   978-3-030-71522-9 , retrieved 2025-08-06
  15. ↑ Häner, Thomas; Jaques, Samuel; Naehrig, Michael; Roetteler, Martin; Soeken, Mathias (2020). "Improved Quantum Circuits for Elliptic Curve Discrete Logarithms". In Ding, Jintai; Tillich, Jean-Pierre (eds.). Post-Quantum Cryptography. Lecture Notes in Computer Science. Cham: Springer International Publishing. pp. 425–444. arXiv: 2001.09580 . doi:10.1007/978-3-030-44223-1_23. ISBN   978-3-030-44223-1.
  16. ↑ Gottesman, Daniel (1998-01-01). "Theory of fault-tolerant quantum computation". Physical Review A. 57 (1): 127–137. arXiv: quant-ph/9702029 . Bibcode:1998PhRvA..57..127G. doi:10.1103/PhysRevA.57.127.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.