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

arXiv:quant-ph/0101054

A Lecture on Quantum Logic Gates

Kazuyuki Fujii

Published Jan 13, 2001• 5 citations
arXivHTMLPDF

Abstract

In this note we make a short review of constructions of n-repeated controlled unitary gates in quantum logic gates.
DOI
10.48550/arxiv.quant-ph/0101054

Related papers

A Lecture on Quantum Logic Gates

一幸 藤井

横浜市立大学論叢 自然科学系列•Oct 1, 2002•0 citations

Brief Introduction to Quantum Computing for Undergraduate Students: Lecture Three — Quantum Gates, Quantum Circuits, and Simple Quantum Algorithms

Li Chen

This lecture continues Lectures One and Two, where we introduced the basic concepts of quantum computing and reviewed the essential linear algebra background for undergraduate students. In this lecture, we focus on the basic computational units of quantum computation, known as quantum gates. Quantum gates play a central role in quantum algorithms, as each quantum algorithm can be implemented as a sequence of quantum gate operations. This idea has a close analogy with classical computing, where computations can be represented by Boolean circuits constructed from elementary logic gates. In principle, classical algorithms can be implemented through combinations of such logic gates. To establish this connection, we first review several fundamental logic gates in classical computing, including the AND, OR, and NOT gates. These elementary Boolean gates provide a useful foundation for understanding quantum gates and how classical computational concepts are extended into the quantum domain. In general, a quantum processing unit (QPU), which executes quantum gate operations, can be viewed as the quantum counterpart of a classical central processing unit (CPU), where computations are carried out through logical operations and circuits. This lecture establishes the foundation for understanding the quantum circuit model and for designing and analyzing quantum algorithms in subsequent lectures. To provide a smooth transition to the topics that follow, we also introduce several tiny quantum algorithms and examples in this lecture. These examples illustrate how quantum gates can be combined to perform meaningful computational tasks and prepare students for the more advanced quantum algorithms discussed later.

ACM SIGACT News•Sep 22, 2026•0 citations

Optimal quantum circuit synthesis from controlled-unitary gates (6 pages)

Jiří Vala, Jiang Zhang, Shankar Sastry +1 more

Physical Review A•Jan 1, 2004•1 citation

Lecture Notes: Introduction to random unitary circuits and the measurement-induced entanglement phase transition

Brian J. Skinner

These are lecture notes compiled for a short lecture series at the 2023 Condensed Matter Summer School at the University of Minnesota. They are designed to be conversational and fun, and not to take the place of review articles that do a serious job of stating things precisely and citing literature thoroughly. The goal of the notes is to introduce some central ideas underlying the study of entanglement dynamics in random unitary circuits and the measurement-induced entanglement phase transition. A particular focus is the concept of the "minimal cut" and its associated stat mech mappings.

arXiv:2307.02986•Jul 6, 2023•5 citations

Quantum circuits with uniformly controlled one-qubit gates (7 pages)

Ville Bergholm, Juha J. Vartiainen

Physical Review A•Jan 1, 2005•1 citation

Construction of a Polarization Multiphoton Controlled One‐Photon Unitary Gate Assisted by the Spatial and Temporal Degrees of Freedom

Xiao‐Ming Xiu, Xue Geng, Sen‐Lin Wang +4 more

Abstract In order to fulfill quantum information processing tasks such as quantum computation and scalable quantum networks, quantum logic gates are indispensable parts. A multiqubit logic gate can efficiently reduce the cost of physical resources and complicated operations that are necessary in the combination of fewer‐qubit (e.g., two‐qubit) logic gates to fulfill the same tasks. However, the construction of multiphoton quantum logic gates is a large challenge. Assisted by spatial and temporal degrees of freedom, a polarization multiphoton controlled one‐photon unitary gate is proposed, which can be realized with three processes including the control‐path process based on weak cross‐Kerr nonlinearities, the unitary transformation process, and the output process. In the control‐path process, the control‐path modules are applied, where the entanglement between polarization, spatial and temporal degrees of freedom is generated by beam splitters, time delayers, and nonlinear interaction in cross‐Kerr media. The scheme presented here, assisted by spatial and temporal degrees of freedom reduces the experimental complexity of the schemes assisted by only spatial degree of freedom. Moreover, it will also be a useful reference in optimally constructing multiqubit quantum logic gates with other multiple degrees of freedom in many physical systems.

Advanced Quantum Technologies•Jul 9, 2019•16 citations
This lecture continues Lectures One and Two, where we introduced the basic concepts of quantum computing and reviewed the essential linear algebra background for undergraduate students. In this lecture, we focus on the basic computational units of quantum computation, known as quantum gates. Quantum gates play a central role in quantum algorithms, as each quantum algorithm can be implemented as a sequence of quantum gate operations. This idea has a close analogy with classical computing, where computations can be represented by Boolean circuits constructed from elementary logic gates. In principle, classical algorithms can be implemented through combinations of such logic gates. To establish this connection, we first review several fundamental logic gates in classical computing, including the AND, OR, and NOT gates. These elementary Boolean gates provide a useful foundation for understanding quantum gates and how classical computational concepts are extended into the quantum domain. In general, a quantum processing unit (QPU), which executes quantum gate operations, can be viewed as the quantum counterpart of a classical central processing unit (CPU), where computations are carried out through logical operations and circuits. This lecture establishes the foundation for understanding the quantum circuit model and for designing and analyzing quantum algorithms in subsequent lectures. To provide a smooth transition to the topics that follow, we also introduce several tiny quantum algorithms and examples in this lecture. These examples illustrate how quantum gates can be combined to perform meaningful computational tasks and prepare students for the more advanced quantum algorithms discussed later.
These are lecture notes compiled for a short lecture series at the 2023 Condensed Matter Summer School at the University of Minnesota. They are designed to be conversational and fun, and not to take the place of review articles that do a serious job of stating things precisely and citing literature thoroughly. The goal of the notes is to introduce some central ideas underlying the study of entanglement dynamics in random unitary circuits and the measurement-induced entanglement phase transition. A particular focus is the concept of the "minimal cut" and its associated stat mech mappings.
Abstract In order to fulfill quantum information processing tasks such as quantum computation and scalable quantum networks, quantum logic gates are indispensable parts. A multiqubit logic gate can efficiently reduce the cost of physical resources and complicated operations that are necessary in the combination of fewer‐qubit (e.g., two‐qubit) logic gates to fulfill the same tasks. However, the construction of multiphoton quantum logic gates is a large challenge. Assisted by spatial and temporal degrees of freedom, a polarization multiphoton controlled one‐photon unitary gate is proposed, which can be realized with three processes including the control‐path process based on weak cross‐Kerr nonlinearities, the unitary transformation process, and the output process. In the control‐path process, the control‐path modules are applied, where the entanglement between polarization, spatial and temporal degrees of freedom is generated by beam splitters, time delayers, and nonlinear interaction in cross‐Kerr media. The scheme presented here, assisted by spatial and temporal degrees of freedom reduces the experimental complexity of the schemes assisted by only spatial degree of freedom. Moreover, it will also be a useful reference in optimally constructing multiqubit quantum logic gates with other multiple degrees of freedom in many physical systems.