Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A brief introduction to quantum computing

André Chailloux

Published Jul 6, 2020• 0 citations
OpenAlex

Abstract

The goal of this talk is to present an introduction to quantum computing for non-specialists. I will first present the quantum computing model in order to have a first feel of what we can and cannot do with a quantum computer. Then I will present a few iconic quantum algorithms such as Grover’s algorithm and Shor’s algorithm. Finally, I will talk about perspectives relative to quantum-secure cryptography. During the talk, I will also briefly talk about error correction for quantum computation and quantum cryptography.

Related papers

An Introduction to Quantum Computing for Non-Physicists

Eleanor Gilbert Rieffel, Wolfgang Polak

Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation appeared justified when Peter Shor described a polynomial time quantum algorithm for factoring integers. In quantum systems, the computational space increases exponentially with the size of the system which enables exponential parallelism. This parallelism could lead to exponentially faster quantum algorithms than possible classically. The catch is that accessing the results, which requires measurement, proves tricky and requires new non-traditional programming techniques. The aim of this paper is to guide computer scientists and other non-physicists through the conceptual and notational barriers that separate quantum computing from conventional computing. We introduce basic principles of quantum mechanics to explain where the power of quantum computers comes from and why it is difficult to harness. We describe quantum cryptography, teleportation, and dense coding. Various approaches to harnessing the power of quantum parallelism are explained, including Shor's algorithm, Grover's algorithm, and Hogg's algorithms. We conclude with a discussion of quantum error correction.

arXiv:quant-ph/9809016•Sep 8, 1998•21 citations

Quantum Computing: A Brief Introduction to the Emerging Technology and Its Engineering Paradigm

Sachin Aralikatti

Quantum computing is considered as good mixture of quantum physics, computer science and information theories. This paper introduces fundamentals needed to understand different layers associated with quantum computing some of them are superposition, entanglement, quantum gates and circuit models like Grover’s algorithm, Shor’s algorithm. Thereafter, it will elaborate hurdles encounter in constructing a quantum computer like Constructing, verification, architecture, quantum error correction, compiler and programming issues. Finally some of the applications like quantum cryptography is discussed.

TEST Engineering & Management•Jan 18, 2020•1 citation

Quantum Image Processing

Shashidhar Ram Joshi

The basics of quantum computing will be discussed. The introduction to different types of computing environments will be done. The concept of qubits will be introduced and compared with bits. The concepts of superposition and quantum entanglement will be discussed. The application of Shor’s and Grover’s algorithm will be discussed briefly and how these algorithms contribute for the enormous power of quantum computing will be elaborated. The brief description of quantum gates will be introduced. Algorithms like Quantum Hadamard Edge Detection can identify outlines and features significantly faster than classical methods will be explained. Topics on protection of visual data through quantum encryption and quantum key distribution will be explained. The pattern recognition using hybrid quantum machine learning models for image classification and segmentation will be elaborated.

Proceedings of International Conference on Innovation in Computing Science Engineering and Technology•Oct 12, 2026•0 citations

Introduction to Quantum Computing

Andreas Bolfing

Abstract This chapter gives a brief introduction to quantum computing, which is the discipline of studying algorithms based on the principles of quantum theory. It outlines the two fundamental quantum algorithms, which are known as Grover’s and Shor’s algorithm, which are able to solve number-theoretical problems that are intractable for present conventional computers. Thus, this chapter also shows the impact of these quantum algorithms on present cryptography under the assumption of the existence of a large-scale quantum computer, concluding that quantum computing poses a serious threat to public-key cryptosystems, because their underlying mathematical problems can be solved efficiently by using Shor’s algorithm.

•Sep 10, 2020•3 citations

Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography

D.J. Guan

The development of quantum algorithms and quantum information theory, as well as the design and construction of experimental quantum computers, are the most exciting events in the scientific community in the last two decades. In this talk, I will briefly introduce quantum computation and quantum information. I will also discuss the influences of these developments on information security and our recent research results on the design of cryptographic protocol by using quantum information. Quantum Computers In 1982 Richard Feynman observed that certain quantum mechanical effects cannot be simulated efficiently on a traditional computer. It is speculated that computations may be done more efficiently by using these quantum effects.

•Jan 1, 2008•0 citations

An overview of Quantum Cryptography and Shor’s Algorithm

The paper aims to examine the mechanisms of quantum cryptography and review the relationship between quantum and classical encryption schemes.A brief introduction of quantum computation is provided, with a simplified explanation of Shor's Algorithm showcasing the potentials of quantum computation.Related literature such as books, journals, proceedings, lecture notes and webpages on quantum cryptography were reviewed and were sourced from prominent databases like IEEE Xplore, ScienceDirect, and JSTOR.This gave a clearer picture on the mechanisms of quantum cryptography and Shor's algorithm.The authors were able to succinctly describe quantum cryptography, show how encryption is achieved by exploiting the properties of quantum particles, and demonstrated with examples the intricacies with Shor's algorithm.It is expected that interested researchers will be more informed on current research in quantum cryptography and influence potential cryptography scholars to explore further the mechanisms of quantum cryptography, quantum computation, and other principles of the quantum theory.

International Journal of Advanced Trends in Computer Science and Engineering•Oct 15, 2020•50 citations
The goal of this talk is to present an introduction to quantum computing for non-specialists. I will first present the quantum computing model in order to have a first feel of what we can and cannot do with a quantum computer. Then I will present a few iconic quantum algorithms such as Grover’s algorithm and Shor’s algorithm. Finally, I will talk about perspectives relative to quantum-secure cryptography. During the talk, I will also briefly talk about error correction for quantum computation and quantum cryptography.
Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation appeared justified when Peter Shor described a polynomial time quantum algorithm for factoring integers. In quantum systems, the computational space increases exponentially with the size of the system which enables exponential parallelism. This parallelism could lead to exponentially faster quantum algorithms than possible classically. The catch is that accessing the results, which requires measurement, proves tricky and requires new non-traditional programming techniques. The aim of this paper is to guide computer scientists and other non-physicists through the conceptual and notational barriers that separate quantum computing from conventional computing. We introduce basic principles of quantum mechanics to explain where the power of quantum computers comes from and why it is difficult to harness. We describe quantum cryptography, teleportation, and dense coding. Various approaches to harnessing the power of quantum parallelism are explained, including Shor's algorithm, Grover's algorithm, and Hogg's algorithms. We conclude with a discussion of quantum error correction.
Quantum computing is considered as good mixture of quantum physics, computer science and information theories. This paper introduces fundamentals needed to understand different layers associated with quantum computing some of them are superposition, entanglement, quantum gates and circuit models like Grover’s algorithm, Shor’s algorithm. Thereafter, it will elaborate hurdles encounter in constructing a quantum computer like Constructing, verification, architecture, quantum error correction, compiler and programming issues. Finally some of the applications like quantum cryptography is discussed.
The basics of quantum computing will be discussed. The introduction to different types of computing environments will be done. The concept of qubits will be introduced and compared with bits. The concepts of superposition and quantum entanglement will be discussed. The application of Shor’s and Grover’s algorithm will be discussed briefly and how these algorithms contribute for the enormous power of quantum computing will be elaborated. The brief description of quantum gates will be introduced. Algorithms like Quantum Hadamard Edge Detection can identify outlines and features significantly faster than classical methods will be explained. Topics on protection of visual data through quantum encryption and quantum key distribution will be explained. The pattern recognition using hybrid quantum machine learning models for image classification and segmentation will be elaborated.
Abstract This chapter gives a brief introduction to quantum computing, which is the discipline of studying algorithms based on the principles of quantum theory. It outlines the two fundamental quantum algorithms, which are known as Grover’s and Shor’s algorithm, which are able to solve number-theoretical problems that are intractable for present conventional computers. Thus, this chapter also shows the impact of these quantum algorithms on present cryptography under the assumption of the existence of a large-scale quantum computer, concluding that quantum computing poses a serious threat to public-key cryptosystems, because their underlying mathematical problems can be solved efficiently by using Shor’s algorithm.
The development of quantum algorithms and quantum information theory, as well as the design and construction of experimental quantum computers, are the most exciting events in the scientific community in the last two decades. In this talk, I will briefly introduce quantum computation and quantum information. I will also discuss the influences of these developments on information security and our recent research results on the design of cryptographic protocol by using quantum information. Quantum Computers In 1982 Richard Feynman observed that certain quantum mechanical effects cannot be simulated efficiently on a traditional computer. It is speculated that computations may be done more efficiently by using these quantum effects.
The paper aims to examine the mechanisms of quantum cryptography and review the relationship between quantum and classical encryption schemes.A brief introduction of quantum computation is provided, with a simplified explanation of Shor's Algorithm showcasing the potentials of quantum computation.Related literature such as books, journals, proceedings, lecture notes and webpages on quantum cryptography were reviewed and were sourced from prominent databases like IEEE Xplore, ScienceDirect, and JSTOR.This gave a clearer picture on the mechanisms of quantum cryptography and Shor's algorithm.The authors were able to succinctly describe quantum cryptography, show how encryption is achieved by exploiting the properties of quantum particles, and demonstrated with examples the intricacies with Shor's algorithm.It is expected that interested researchers will be more informed on current research in quantum cryptography and influence potential cryptography scholars to explore further the mechanisms of quantum cryptography, quantum computation, and other principles of the quantum theory.