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

Pomiary Automatyka Kontrola

Decompositions of reversible logic circuits

Marek Szyprowski, Paweł Kerntopf

Published Jan 1, 2009• 2 citations
OpenAlex

Related papers

A Reversible Logical Circuit Synthesis Algorithm Based on Decomposition of Cycle Representations of Permutations

Weijun Zhu, Zhiqiang Li, Gaoman Zhang +2 more

International Journal of Theoretical Physics•May 15, 2018•9 citations

Reversible Logic Circuits

WORLD SCIENTIFIC eBooks•Sep 1, 2011•0 citations

The decomposition of an arbitrary reversible logic circuit

Alexis De Vos, Yvan Van Rentergem, Koen De Keyser

The (2 w )! reversible logic circuits of width w , i.e. reversible logic circuits with w inputs and w outputs, together with the action of cascading, form a group G , isomorphic to the symmetric group . We define two conjugate subgroups G 1 and G 2 . Together they partition the group G into 2 w −1 + 1 double cosets. These allow us to decompose an arbitrary member of G into a cascade of three simpler members. This decomposition is a far relative of the well-known LU decomposition of a square matrix.

Journal of Physics A Mathematical and General•Apr 19, 2006•7 citations

Synthesis of reversible logic

Md. Mazder Rahman

•Jan 1, 2014•1 citation

Implementation and Analysis of Spin-Torque-Based Reversible D-Latch

Anant Aravind Kulkarni, Brajesh Kumar Kaushik, Željko Žilić

Quantum computing due to its ability of inherent parallel processing is emerged as one of the solutions to the complex computing problems. In connection with this, several proposals have been given for the quantum circuits-based design of the reversible combinational and sequential circuits. However, the implementation of the reversible sequential logic is challenging in comparison to the reversible combinational logic. Spin-torque-based reconfigurable architecture could be utilized to realize the quantum circuits. However, the architecture needs the optimized decomposition of the quantum circuits utilized for the reversible sequential logic due to required number of single qubit rotations and two-qubit entanglements. In this paper, the elementary decomposition of the quantum circuits representing the reversible D-Latch is optimized with the help of elementary quantum library$\{R_{\mathrm{y}}(\theta),\ R_{\mathrm{z}}(\theta),\ \sqrt{\text{SWAP}}\}$. The number of elementary operations required to realize the D-Latch over 5 clock cycles is reduced by 43.56%. The average fidelity of the D-Latch considered for the implementation and analysis is obtained at the end of each clock cycle is well above 97%. The fidelity is further improved by approximating the present state output utilized for the next state input.

Conference proceedings - Canadian Conference on Electrical and Computer Engineering•May 1, 2018•1 citation

Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements

Jia Lee, Ya-Hui Ye, Xin Huang +1 more

Theoretical Computer Science•Jan 20, 2020•8 citations
The (2 w )! reversible logic circuits of width w , i.e. reversible logic circuits with w inputs and w outputs, together with the action of cascading, form a group G , isomorphic to the symmetric group . We define two conjugate subgroups G 1 and G 2 . Together they partition the group G into 2 w −1 + 1 double cosets. These allow us to decompose an arbitrary member of G into a cascade of three simpler members. This decomposition is a far relative of the well-known LU decomposition of a square matrix.
Quantum computing due to its ability of inherent parallel processing is emerged as one of the solutions to the complex computing problems. In connection with this, several proposals have been given for the quantum circuits-based design of the reversible combinational and sequential circuits. However, the implementation of the reversible sequential logic is challenging in comparison to the reversible combinational logic. Spin-torque-based reconfigurable architecture could be utilized to realize the quantum circuits. However, the architecture needs the optimized decomposition of the quantum circuits utilized for the reversible sequential logic due to required number of single qubit rotations and two-qubit entanglements. In this paper, the elementary decomposition of the quantum circuits representing the reversible D-Latch is optimized with the help of elementary quantum library{Ry(θ), Rz(θ), SWAP}\{R_{\mathrm{y}}(\theta),\ R_{\mathrm{z}}(\theta),\ \sqrt{\text{SWAP}}\}{Ry​(θ), Rz​(θ), SWAP​}. The number of elementary operations required to realize the D-Latch over 5 clock cycles is reduced by 43.56%. The average fidelity of the D-Latch considered for the implementation and analysis is obtained at the end of each clock cycle is well above 97%. The fidelity is further improved by approximating the present state output utilized for the next state input.