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

International Scientific Conference Sinteza

Quantum Computers - Example of Executing the Deutsch Quantum Algorithm Using Google Colab

Željko Eremić, Tanja Sekulić, Iris Borjanović Trusina

Published Jan 1, 2026• 0 citations
Publisher

Abstract

In this paper, an introduction to the basic principles of quantum computing is provided, from concepts of quantum mechanics to their mathematical and computational representation.The core phenomena of quantum mechanics, such as superposition, interference, and entanglement, are explained, and their applications in quantum information processing are described.Mathematical representation of quantum information, starting from qubits, quantum gates, and quantum operations, is presented and explained.Also, the overview of basic quantum algorithms is given and compared to classical approaches.The quantum Deutsch algorithm is presented and discussed mathematically.Prerequisites and programming code in Python for executing the quantum Deutsch's algorithm are presented.Figures of quantum circuits and execution results are given.Finally, the results of the execution of this algorithm are discussed.

DOI
10.15308/sinteza-2026-334-339

Related papers

Brief Introduction to Quantum Computing for Undergraduate Students: Lecture One

Li Chen

This article provides an introductory overview of quantum computing for college students through intuitive examples. We explore key concepts, starting with the basic principles of quantum mechanics. The discussion covers essential elements such as Qubits, superposition, entanglement, and introduces quantum gates. The article concludes by examining the first quantum algorithm: the solution to Deutsch's Problem.

ACM SIGACT News•Mar 26, 2024•3 citations

An Introduction to Quantum Computing

David A. Kreplin

Quantum computing uses quantum-mechanical principles to enable new models of computation bexond the classical paradigm. This article presents an accessible introduction to the mathematical and conceptual foundations of quantum computing, covering qubits, quantum gates, multi-qubit systems, entanglement, and measurement. The gate-based computation model and quantum circuits are introduced, together with key notations such as universality and reversibility. As an illustrative example, the Deutsch-Josza algorithm is discussed to demonstrate how quantum algorithm can be constucted. The article concludes with a brief overview of the current state and challenges of quantum computing.

•Jan 1, 2026•0 citations

Quantum Computation

Jaden Pieper, Manuel E. Lladser

A quantum computer is a machine that exploits quantum phenomena to store information and perform computations.\nThe chief goal of this article is to provide a brief but comprehensive introduction to quantum computing. It overviews some mathematical underpinnings of quantum computation for readers with only a basic knowledge of linear algebra and probability. However, it does not attempt to be exhaustive nor make an exposition of quantum physics. It further does not attempt to stay current with physical implementations of quantum computers.\nAfter providing a brief historical background, the article introduces the notion of a quantum bit (qubit) and the linear operators (gates) that act on these. It then addresses systems of multiple qubits and their corresponding gates. Along the way, the article covers the essential concepts of separable systems, as well quantum interference and decoherence. It also describes how to represent gates as quantum circuits. To conclude, it explains the underpinnings of two simple but insightful quantum algorithms. A final section suggests further readings for those who wish to delve deeper into quantum computing.

Scholarpedia•Jan 1, 2018•1 citation

Quantum information processing

Andrea Delgado, Kathleen E. Hamilton

This chapter provides an introduction to the principles of quantum information processing, establishing the theoretical foundation for quantum machine learning. It covers the representation of quantum states using qubits, the mathematical framework of quantum mechanics, and the role of superposition, entanglement, and measurement. Key models such as quantum circuits and quantum gates are introduced, along with illustrative algorithms including Deutsch–Jozsa and Grover’s search. These examples demonstrate how quantum mechanics enables computational speedups and highlights the potential advantages of quantum computing in learning and optimization tasks.

Institute of Physics eBooks•Dec 1, 2025•0 citations

Introduction to Quantum Computing

Leo Ismael Lorenzo López

Quantum computing is a discipline that merges concepts from Digital Computing and Quantum Mechanics. This TFG offers an introduction to Quantum Computing, focusing on the essential mathematical tools and their application in basic quantum algorithms with Qiskit. The double-slit experiment will then be recreated as an example of the theory explained. In this way we shall illustrate key phenomena in Quantum Mechanics, such as superposition and interference.

Scientia Insularum Revista de Ciencias Naturales en islas•Jan 1, 2025•0 citations

Quantum computers, principles and latest development

Eduard Ješko

The main goal of this thesis is to give information on quantum computer principles and its latest development. In the first part we introduce quantum bits, quantum registers and quantum gates. We show basic operations acting on one and more qubits. On an example we present, how it is possible to construct an arbitrary gate using only elementary quantum gates. We describe a behaviour of quantum computers called quantum parallelism and show its application in Deutsch's algorithm. We define the quantum Fourier transform and its applications. In the last chapter we explain on what principle the D-Wave quantum computer works. In this thesis we compare classical and quantum computers in terms of algorithms and computational speed.

•Jun 17, 2014•0 citations
In this paper, an introduction to the basic principles of quantum computing is provided, from concepts of quantum mechanics to their mathematical and computational representation.The core phenomena of quantum mechanics, such as superposition, interference, and entanglement, are explained, and their applications in quantum information processing are described.Mathematical representation of quantum information, starting from qubits, quantum gates, and quantum operations, is presented and explained.Also, the overview of basic quantum algorithms is given and compared to classical approaches.The quantum Deutsch algorithm is presented and discussed mathematically.Prerequisites and programming code in Python for executing the quantum Deutsch's algorithm are presented.Figures of quantum circuits and execution results are given.Finally, the results of the execution of this algorithm are discussed.
Quantum computing uses quantum-mechanical principles to enable new models of computation bexond the classical paradigm. This article presents an accessible introduction to the mathematical and conceptual foundations of quantum computing, covering qubits, quantum gates, multi-qubit systems, entanglement, and measurement. The gate-based computation model and quantum circuits are introduced, together with key notations such as universality and reversibility. As an illustrative example, the Deutsch-Josza algorithm is discussed to demonstrate how quantum algorithm can be constucted. The article concludes with a brief overview of the current state and challenges of quantum computing.
A quantum computer is a machine that exploits quantum phenomena to store information and perform computations.\nThe chief goal of this article is to provide a brief but comprehensive introduction to quantum computing. It overviews some mathematical underpinnings of quantum computation for readers with only a basic knowledge of linear algebra and probability. However, it does not attempt to be exhaustive nor make an exposition of quantum physics. It further does not attempt to stay current with physical implementations of quantum computers.\nAfter providing a brief historical background, the article introduces the notion of a quantum bit (qubit) and the linear operators (gates) that act on these. It then addresses systems of multiple qubits and their corresponding gates. Along the way, the article covers the essential concepts of separable systems, as well quantum interference and decoherence. It also describes how to represent gates as quantum circuits. To conclude, it explains the underpinnings of two simple but insightful quantum algorithms. A final section suggests further readings for those who wish to delve deeper into quantum computing.
This chapter provides an introduction to the principles of quantum information processing, establishing the theoretical foundation for quantum machine learning. It covers the representation of quantum states using qubits, the mathematical framework of quantum mechanics, and the role of superposition, entanglement, and measurement. Key models such as quantum circuits and quantum gates are introduced, along with illustrative algorithms including Deutsch–Jozsa and Grover’s search. These examples demonstrate how quantum mechanics enables computational speedups and highlights the potential advantages of quantum computing in learning and optimization tasks.
The main goal of this thesis is to give information on quantum computer principles and its latest development. In the first part we introduce quantum bits, quantum registers and quantum gates. We show basic operations acting on one and more qubits. On an example we present, how it is possible to construct an arbitrary gate using only elementary quantum gates. We describe a behaviour of quantum computers called quantum parallelism and show its application in Deutsch's algorithm. We define the quantum Fourier transform and its applications. In the last chapter we explain on what principle the D-Wave quantum computer works. In this thesis we compare classical and quantum computers in terms of algorithms and computational speed.