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

Microelectronic Technology

Prospect of Quantum computer:Quantum Gate and Circuit Model

Shi Jiao-fang

Published Jan 1, 2002• 0 citations
OpenAlex

Abstract

An introduction is given to the background and advantages of quantum computers.The basic structure of quantum gate is discussed in details. The emphasis is placed on the quantum one-bit gate and the quantum XOR or controlled NOT as the fundamental two-bit gate for quantum computation.

Related papers

Quantum Gates and Circuits

A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates.I highlight the quantum XOR or controlled NOT as the fundamental two-bit gate for quantum computation.This gate plays a central role in networks for quantum error correction.

The MIT Press eBooks•Mar 19, 2019•2 citations

Quantum Gates and Circuits

A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates.I highlight the quantum XOR or controlled NOT as the fundamental two-bit gate for quantum computation.This gate plays a central role in networks for quantum error correction.

CRC Press eBooks•Jul 21, 2015•0 citations

Quantum Gates and Circuits

David Peter Divincenzo

A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental two-bit gate for quantum computation. This gate plays a central role in networks for quantum error correction.

•Jan 1, 1997•90 citations

Quantum gates and circuits

David Peter Divincenzo

A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental two–bit gate for quantum computation. This gate plays a central role in networks for quantum error correction.

arXiv:quant-ph/9705009•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jan 8, 1998•134 citations

Quantum Logic Gate–Based Circuit Design for Computing Applications

Joy Bhattacharjee, Arpan Deyasi

Quantum computing, which is the most famed topic in this era, a combination of quantum mechanics from the 1900s and the computing point of view, takes a huge place in the quantum realm. Starting from the foundation of abacus since 2700–2300 BC, we humans have always been trying to compute in different ways, and the most modern way of doing it comes with the binary system. Bit is the smallest unit of a binary system and can be in two states, either 0 or 1. On the contrary, quantum computing deals with the “quantum bit” or “qubit”; possible outcomes from the qubits are neither 0 nor 1. It will always be a combination of 0 and 1, which is based on the superposition principle from quantum physics. In this chapter, details of quantum logic gates are discussed for the circuit design perspective, which will be achievable for future realization of quantum computers. Architecture and corresponding formation of basic quantum circuits are discussed, along with the methods of quantum computing. How the technique differs from conventional approaches is also highlighted. The work may be directed toward future hardware realization of quantum information processing.

CRC Press eBooks•Mar 26, 2024•1 citation

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 computing, which is the most famed topic in this era, a combination of quantum mechanics from the 1900s and the computing point of view, takes a huge place in the quantum realm. Starting from the foundation of abacus since 2700–2300 BC, we humans have always been trying to compute in different ways, and the most modern way of doing it comes with the binary system. Bit is the smallest unit of a binary system and can be in two states, either 0 or 1. On the contrary, quantum computing deals with the “quantum bit” or “qubit”; possible outcomes from the qubits are neither 0 nor 1. It will always be a combination of 0 and 1, which is based on the superposition principle from quantum physics. In this chapter, details of quantum logic gates are discussed for the circuit design perspective, which will be achievable for future realization of quantum computers. Architecture and corresponding formation of basic quantum circuits are discussed, along with the methods of quantum computing. How the technique differs from conventional approaches is also highlighted. The work may be directed toward future hardware realization of quantum information processing.
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.