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

Dianzi xuebao

Reversible Logic Circuit for One-Dimensional Quantum Walk Based on NCP Quantum Gates Library

Gang Zhou

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

The design proposal of reversible logic circuit for one-dimensional quantum walk based on NCP quantum gates library is presented.According to the features of the one-dimensional quantum walk,this circuit is divided to two parts,one part is quantum coin tossing and the other part is S operation.Besides the work above,this paper thoroughly analyses the one-dimensional quantum walk and builds a mathematical model of the one-dimensional quantum walk and uses controlled add-sub circuit to realize the S operation.At present the researches on quantum walk often limited to the mathematical theory and analysis.Depend on the primitive recursive,Mathematical expression of every step of the one-dimensional quantum walk is given in this paper;the circuit studied in this paper describes element operation of the one-dimensional quantum walk,and make this modular which contribute to the realization for the algorithm of one-dimensional quantum walk.

Related papers

Designing reversible arithmetic, logic circuit to implement micro-operation in quantum computation

Gunajit Kalita, Navajit Saikia

The futuristic computing is desired to be more power full with low-power consumption.That is why quantum computing has been a key area of research for quite some time and is getting more and more attention.Quantum logic being reversible, a significant amount of contributions has been reported on reversible logic in recent times.Reversible circuits are essential parts of quantum computers, and hence their designs are of great importance.In this paper, designs of reversible circuits are proposed using a recently proposed reversible gate for arithmetic and logic operations to implement various micro-operations (simple add and subtract, add with carry, subtract with borrow, transfer, incrementing, decrementing etc., and logic operations like XOR, XNOR, complementing etc.) in a reversible computer like quantum computer.The two new reversible designs proposed here for half adder and full adders are also used in the presented reversible circuits to implement various microoperations.The quantum costs of these designs are comparable.Many of the implemented micro-operations are not seen in previous literatures.The performances of the proposed circuits are compared with existing designs wherever available.

Journal of Physics Conference Series•Oct 1, 2016•1 citation

Revisiting one-dimensional discrete-time quantum walks with general coin

Mahesh N. Jayakody, Chandrakala Meena, Priodyuti Pradhan

Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator, constant in both space and time, and a localized initial state using numerical modeling. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study on general coin operators also includes the popular coins – Hadamard, Grover, and Fourier.

arXiv:2102.07207•Physics Open•Nov 10, 2023•15 citations

Quantum Circuits for Quantum Spatial Search on ddd-Dimensional Lattices

Rei Sato

We propose an explicit quantum circuit for quantum spatial search based on discrete-time quantum walks on $d$-dimensional lattices. In this algorithm, the flip-flop shift operator moves the walker to a neighboring site along the selected spatial direction and reverses the corresponding direction label after the move. By encoding each pair of opposite directions so that they differ only in the least significant qubit of the coin register, we implement the shift using coin-controlled modular increment and decrement operations on the position registers, together with a single $X$ gate that reverses the direction label. We verify that the proposed circuits reproduce the theoretical dynamics on two- and three-dimensional periodic lattices. We further extend the circuit construction to systems with position-dependent shift rules, such as non-periodic boundaries, and validate this extension on a two-dimensional lattice. The resource analysis shows logarithmic growth of the circuit width. For the two-dimensional lattice, the synthesized depth is consistent with $O(\sqrt{N}(\log N)^{3/2})$, while the three-dimensional depth empirically follows an $O(\sqrt{N})$ dependence over the investigated range. Under a CX-gate depolarizing noise model, CX-optimized circuits exhibit improved noise robustness. These results provide a practical framework for implementing quantum spatial search on regular lattices and extending it to defective and other irregular lattice structures.

quant-pharXiv:2607.19151•Jul 22, 2026•0 citations

Graphical Method of Reversible Circuits Synthesis

Andrzej Skorupski

Abstract This paper presents a new approach to designing reversible circuits. Reversible circuits can decrease energy dissipation theoretically to zero. This feature is a base to build quantum computers. The main problem of reversible logic is designing optimal reversible circuits i.e. circuits with minimal gates number implementing the given reversible function. There are many types of reversible gates. Most popular library is a set of three types of gates so called CNT (Control, NOT and Toffoli). The method presented in this paper is based only on the Toffoli gates. A graphical representation of the reversible function called s-maps is introduced in the paper. This representation allows to find optimal reversible circuits. The paper is organized as follows. Section 1 recalls basic concepts of reversible logic. In Section 2 a graphical representation of the reversible functions is presented. Section 3 describes the algorithm whereby all optimal solutions of the given function could be obtained.

International Journal of Electronics and Telecommunications•Aug 28, 2017•2 citations

Reversible Logic Synthesis

Hafiz Md. Hasan Babu

The main purposes of designing reversible logic circuits are to decrease quantum cost, depth of the circuits, and the number of garbage outputs. This chapter explains the basic reversible logic gates for more complex system, which may have reversible circuits as a primitive component and can execute complicated operations using quantum computers. It presents the information related to the primitive reversible gates and helps researchers in designing higher complex computing circuits using reversible gates. Reversible logic has unique mapping between input and output bit pattern. Constant inputs are the inputs of a reversible gate (or circuit) that are either set to 0 or 1. The quantum cost of a circuit is the total number of quantum primitives that are used to realize corresponding quantum circuit. The chapter presents some important design constraints for reversible logic circuits and discusses quantum analysis of different reversible logic gates.

Wiley eBooks•Aug 28, 2020•79 citations

Efficient Designs of Quantum Adder/Subtractor Using Universal Reversible Gate on IBM Q

Mohamed Osman, Khaled El-Wazan

Reversible arithmetic and logic unit (ALU) is a necessary part of quantum computing. In this work, we present improved designs of reversible half and full addition and subtraction circuits. The proposed designs are based on a universal one type gate (G gate library). The G gate library can generate all possible permutations of the symmetric group. The presented designs are multi-function circuits that are capable of performing additional logical operations. We achieve a reduction in the quantum cost, gate count, number of constant inputs, and delay with zero garbage, compared to relevant results obtained by others. The experimental results using IBM Quantum Experience (IBM Q) illustrate the success probability of the proposed designs.

Symmetry•Oct 2, 2021•6 citations
The design proposal of reversible logic circuit for one-dimensional quantum walk based on NCP quantum gates library is presented.According to the features of the one-dimensional quantum walk,this circuit is divided to two parts,one part is quantum coin tossing and the other part is S operation.Besides the work above,this paper thoroughly analyses the one-dimensional quantum walk and builds a mathematical model of the one-dimensional quantum walk and uses controlled add-sub circuit to realize the S operation.At present the researches on quantum walk often limited to the mathematical theory and analysis.Depend on the primitive recursive,Mathematical expression of every step of the one-dimensional quantum walk is given in this paper;the circuit studied in this paper describes element operation of the one-dimensional quantum walk,and make this modular which contribute to the realization for the algorithm of one-dimensional quantum walk.
The futuristic computing is desired to be more power full with low-power consumption.That is why quantum computing has been a key area of research for quite some time and is getting more and more attention.Quantum logic being reversible, a significant amount of contributions has been reported on reversible logic in recent times.Reversible circuits are essential parts of quantum computers, and hence their designs are of great importance.In this paper, designs of reversible circuits are proposed using a recently proposed reversible gate for arithmetic and logic operations to implement various micro-operations (simple add and subtract, add with carry, subtract with borrow, transfer, incrementing, decrementing etc., and logic operations like XOR, XNOR, complementing etc.) in a reversible computer like quantum computer.The two new reversible designs proposed here for half adder and full adders are also used in the presented reversible circuits to implement various microoperations.The quantum costs of these designs are comparable.Many of the implemented micro-operations are not seen in previous literatures.The performances of the proposed circuits are compared with existing designs wherever available.
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator, constant in both space and time, and a localized initial state using numerical modeling. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study on general coin operators also includes the popular coins – Hadamard, Grover, and Fourier.
We propose an explicit quantum circuit for quantum spatial search based on discrete-time quantum walks on ddd-dimensional lattices. In this algorithm, the flip-flop shift operator moves the walker to a neighboring site along the selected spatial direction and reverses the corresponding direction label after the move. By encoding each pair of opposite directions so that they differ only in the least significant qubit of the coin register, we implement the shift using coin-controlled modular increment and decrement operations on the position registers, together with a single XXX gate that reverses the direction label. We verify that the proposed circuits reproduce the theoretical dynamics on two- and three-dimensional periodic lattices. We further extend the circuit construction to systems with position-dependent shift rules, such as non-periodic boundaries, and validate this extension on a two-dimensional lattice. The resource analysis shows logarithmic growth of the circuit width. For the two-dimensional lattice, the synthesized depth is consistent with O(N(log⁡N)3/2)O(\sqrt{N}(\log N)^{3/2})O(N​(logN)3/2), while the three-dimensional depth empirically follows an O(N)O(\sqrt{N})O(N​) dependence over the investigated range. Under a CX-gate depolarizing noise model, CX-optimized circuits exhibit improved noise robustness. These results provide a practical framework for implementing quantum spatial search on regular lattices and extending it to defective and other irregular lattice structures.
Abstract This paper presents a new approach to designing reversible circuits. Reversible circuits can decrease energy dissipation theoretically to zero. This feature is a base to build quantum computers. The main problem of reversible logic is designing optimal reversible circuits i.e. circuits with minimal gates number implementing the given reversible function. There are many types of reversible gates. Most popular library is a set of three types of gates so called CNT (Control, NOT and Toffoli). The method presented in this paper is based only on the Toffoli gates. A graphical representation of the reversible function called s-maps is introduced in the paper. This representation allows to find optimal reversible circuits. The paper is organized as follows. Section 1 recalls basic concepts of reversible logic. In Section 2 a graphical representation of the reversible functions is presented. Section 3 describes the algorithm whereby all optimal solutions of the given function could be obtained.
The main purposes of designing reversible logic circuits are to decrease quantum cost, depth of the circuits, and the number of garbage outputs. This chapter explains the basic reversible logic gates for more complex system, which may have reversible circuits as a primitive component and can execute complicated operations using quantum computers. It presents the information related to the primitive reversible gates and helps researchers in designing higher complex computing circuits using reversible gates. Reversible logic has unique mapping between input and output bit pattern. Constant inputs are the inputs of a reversible gate (or circuit) that are either set to 0 or 1. The quantum cost of a circuit is the total number of quantum primitives that are used to realize corresponding quantum circuit. The chapter presents some important design constraints for reversible logic circuits and discusses quantum analysis of different reversible logic gates.
Reversible arithmetic and logic unit (ALU) is a necessary part of quantum computing. In this work, we present improved designs of reversible half and full addition and subtraction circuits. The proposed designs are based on a universal one type gate (G gate library). The G gate library can generate all possible permutations of the symmetric group. The presented designs are multi-function circuits that are capable of performing additional logical operations. We achieve a reduction in the quantum cost, gate count, number of constant inputs, and delay with zero garbage, compared to relevant results obtained by others. The experimental results using IBM Quantum Experience (IBM Q) illustrate the success probability of the proposed designs.