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

Computer Engineering and Science

Comparison of Classical Logic Gates with Quantum Logic Gates

Liang Liu

Published Jan 1, 2005• 0 citations
OpenAlex

Abstract

In this article,we describe the differences between classical logic gates and quantum logic gates,and explain the characteristics of quantum computation,the strong power of the quantum algorithm,and the problem of the realization of quantum logic gates.

Related papers

An Introduction to Logical Operations on Classical and Quantum Bits

Xavier Sigaud

This article is a short review on the concept of information. We show the strong relation between Information Theory and Physics, and the differences between classical and quantum information, with emphasis in their manipulation through logical gates.This paper is intended to be read by non-specialists and undergraduate students of Computer Science, Mathematics and Physics, with knowledge in Linear Algebra and Quantum Mechanics.

•Jan 1, 2004•0 citations

An Introduction to Logical Operations on Classical and Quantum Bits

Franklin de Lima Marquezino, Junior, R. R. Mello

This article is a short review on the concept of information. We show the strong relation between Information Theory and Physics, and the differences between classical and quantum information, with emphasis in their manipulation through logical gates. This paper is intended to be read by non-specialists and undergraduate students of Computer Science, Mathematics and Physics, with knowledge in Linear Algebra and Quantum Mechanics.

arXiv:physics/0404134•Apr 28, 2004•2 citations

Quantum Gates and Circuits

Kolla Bhanu Prakash

Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.

Wiley eBooks•Aug 17, 2026•0 citations

Traditional Computing

Alice Flarend, Bob Hilborn

Abstract Alice and Bob explain the difference between classical (traditional) computing and quantum computing, deploying a gentle introduction to classical binary digits (bits) beginning with a brief history of the development of quantum mechanics and computer architecture. The abstract backbone of classical computing is logic gates, which represent changes to input bits under specific rules. These rules, governed by Boolean, logic can be summarized in truth tables, giving the output values for specific input values. The most common classical gates—NOT, AND, NAND, and XOR gates—are introduced. The vocabulary of classical computing provides the basis for understanding quantum computing.

Oxford University Press eBooks•Apr 15, 2022•0 citations

Universality in Quantum Computation

David Deutsch, Adriano Barenco, Artur Ekert

We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates. Introduction It has been known for several years that the theory of quantum computers --- i.e. machines that rely on characteristically quantum phenomena to perform computations [1] --- is substantially different from the classical theory of computation, which is essentially the theory of the universal Turing machine. We may identify three important differences. Firstly, the properties of quantum computers are not postulated in abstracto but are deduced entirely from the laws of physics. Logically, this was already true of the classical theory, as Landauer [2] has pointed out, but the intuitive nature of the classically-available computational operations, and the millennia-long history of their study, allowed pioneers such as Turing, Chu...

•May 24, 1995•322 citations

Overview of Quantum Computing

Cheng Hsiao Wu

The difference between a classical sequential computer, using Boolean operations and implemented by transistor logic gates, and the new quantum parallel computer is described at the fundamental level. Why the new quantum computing must use nonlocal operator–state relations is explained to move the readers into a new frontier of science.

CRC Press eBooks•Nov 21, 2025•0 citations
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
Abstract Alice and Bob explain the difference between classical (traditional) computing and quantum computing, deploying a gentle introduction to classical binary digits (bits) beginning with a brief history of the development of quantum mechanics and computer architecture. The abstract backbone of classical computing is logic gates, which represent changes to input bits under specific rules. These rules, governed by Boolean, logic can be summarized in truth tables, giving the output values for specific input values. The most common classical gates—NOT, AND, NAND, and XOR gates—are introduced. The vocabulary of classical computing provides the basis for understanding quantum computing.
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates. Introduction It has been known for several years that the theory of quantum computers --- i.e. machines that rely on characteristically quantum phenomena to perform computations [1] --- is substantially different from the classical theory of computation, which is essentially the theory of the universal Turing machine. We may identify three important differences. Firstly, the properties of quantum computers are not postulated in abstracto but are deduced entirely from the laws of physics. Logically, this was already true of the classical theory, as Landauer [2] has pointed out, but the intuitive nature of the classically-available computational operations, and the millennia-long history of their study, allowed pioneers such as Turing, Chu...