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

Optical and Quantum Electronics

An elementary optical logic circuit for quantum computing: a review

Ankur Saharia, Ravi Kumar Maddila, Jalil Ali, Preecha P. Yupapin, Ghanshyam K. Singh

Published Jun 22, 2019• 20 citations
Publisher
DOI
10.1007/s11082-019-1944-3

Related papers

Small quantum circuits for optical quantum computing

Till J. Weinhold, Jeremy L. O’Brien, Geoff J. Pryde +1 more

•Jan 30, 2005•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

A review on reversible logic gates

Bahijja Yahaya Galadima, Garba Shehu Musa Galadanci, Tijjani Abdulrazak +1 more

In recent years, reversible logic circuits have applications in the emerging field of digital signal processing, optical information processing, quantum computing and nano technology. Reversibility plays an important role when computations with minimal energy dissipation are considered. The main purpose of designing reversible logic is to decrease the number of reversible gates, garbage outputs, constant inputs, quantum cost, area, power, delay and hardware complexity of the reversible circuits. This paper reveals a comparative review on various reversible logic gates. This paper provides some reversible logic gates, which can be used in designing more complex systems having reversible circuits and can execute more complicated operations using quantum computers. Future digital technology will use reversible logic gates in order to reduce the power consumption and propagation delay as it effectively provides negligible loss of information in the circuit. Keywords: Garbage output, Power dissipation, quantum cost, Reversible Gate, Reversible logic,

Bayero Journal of Pure and Applied Sciences•Apr 15, 2020•7 citations

An Optical Approach to Quantum Computing

J. D. Franson, T. B. Pittman

Lecture notes in computer science•Jan 1, 1999•2 citations

Optical Qubits and Quantum Logic Operations

Sintayehu Tesfa

Lecture notes in physics•Jan 1, 2020•0 citations

A Synthesis Method of Quantum Reversible Logic Circuit Based on Elementary Qutrit Quantum Logic Gates

Fuyou Fan, Guowu Yang, Gang Yang +1 more

Because ternary computer has more superiority than other d-ary number systems, we focus on the investigation of ternary elementary quantum gates and the synthesis algorithm of ternary quantum logic circuits. Above all, Pauli operators and their matrices on qutrit are introduced. Then eight qutrit operators are selected as elementary operators and eight qutrit quantum logic gates are defined. Permutation groups are introduced to characterize the quantum gates and quantum logic circuits. Some important qutrit quantum logic gates are defined also, such as QNOT, QKCXi, EQKCXi, QSwap, QCNOT and EQCNOT. Based on these elementary gates, we prove two very important theorems: (1) all qutrit quantum reversible logic circuit can be generated by Xi gate and QKCXi gate; (2) all qutrit quantum reversible logic circuits can be generated by Xi gate and QCNOT gate. The two theorems indicate that any complicated qutrit quantum reversible circuit can be constructed by the simplest ternary quantum gate. This will greatly simplify the implementation difficulty of quantum circuit. Subsequently, we propose a synthesis algorithm for qutrit quantum reversible logic circuit, which is verified through simulation experiment by the computer program we have designed.

Journal of Circuits Systems and Computers•Jul 2, 2015•14 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.
In recent years, reversible logic circuits have applications in the emerging field of digital signal processing, optical information processing, quantum computing and nano technology. Reversibility plays an important role when computations with minimal energy dissipation are considered. The main purpose of designing reversible logic is to decrease the number of reversible gates, garbage outputs, constant inputs, quantum cost, area, power, delay and hardware complexity of the reversible circuits. This paper reveals a comparative review on various reversible logic gates. This paper provides some reversible logic gates, which can be used in designing more complex systems having reversible circuits and can execute more complicated operations using quantum computers. Future digital technology will use reversible logic gates in order to reduce the power consumption and propagation delay as it effectively provides negligible loss of information in the circuit. Keywords: Garbage output, Power dissipation, quantum cost, Reversible Gate, Reversible logic,
Because ternary computer has more superiority than other d-ary number systems, we focus on the investigation of ternary elementary quantum gates and the synthesis algorithm of ternary quantum logic circuits. Above all, Pauli operators and their matrices on qutrit are introduced. Then eight qutrit operators are selected as elementary operators and eight qutrit quantum logic gates are defined. Permutation groups are introduced to characterize the quantum gates and quantum logic circuits. Some important qutrit quantum logic gates are defined also, such as QNOT, QKCXi, EQKCXi, QSwap, QCNOT and EQCNOT. Based on these elementary gates, we prove two very important theorems: (1) all qutrit quantum reversible logic circuit can be generated by Xi gate and QKCXi gate; (2) all qutrit quantum reversible logic circuits can be generated by Xi gate and QCNOT gate. The two theorems indicate that any complicated qutrit quantum reversible circuit can be constructed by the simplest ternary quantum gate. This will greatly simplify the implementation difficulty of quantum circuit. Subsequently, we propose a synthesis algorithm for qutrit quantum reversible logic circuit, which is verified through simulation experiment by the computer program we have designed.