Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits

2018 ◽  
Vol 13 (1) ◽  
pp. 1-125 ◽  
Author(s):  
Alexis De Vos ◽  
Stijn De Baerdemacker ◽  
Yvan Van Rentergem
2010 ◽  
Vol 10 (9&10) ◽  
pp. 721-734
Author(s):  
Shigeru Yamashita ◽  
Igor L. Markov

We perform formal verification of quantum circuits by integrating several techniques specialized to particular classes of circuits. Our verification methodology is based on the new notion of a reversible miter that allows one to leverage existing techniques for simplification of quantum circuits. For reversible circuits which arise as runtime bottlenecks of key quantum algorithms, we develop several verification techniques and empirically compare them. We also combine existing quantum verification tools with the use of SAT-solvers. Experiments with circuits for Shor's number-factoring algorithm, containing thousands of gates, show improvements in efficiency by four orders of magnitude.


Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1025
Author(s):  
Mariam Gado ◽  
Ahmed Younes

The synthesis and optimization of quantum circuits are essential for the construction of quantum computers. This paper proposes two methods to reduce the quantum cost of 3-bit reversible circuits. The first method utilizes basic building blocks of gate pairs using different Toffoli decompositions. These gate pairs are used to reconstruct the quantum circuits where further optimization rules will be applied to synthesize the optimized circuit. The second method suggests using a new universal library, which provides better quantum cost when compared with previous work in both cost015 and cost115 metrics; this proposed new universal library “Negative NCT” uses gates that operate on the target qubit only when the control qubit’s state is zero. A combination of the proposed basic building blocks of pairs of gates and the proposed Negative NCT library is used in this work for synthesis and optimization, where the Negative NCT library showed better quantum cost after optimization compared with the NCT library despite having the same circuit size. The reversible circuits over three bits form a permutation group of size 40,320 (23!), which is a subset of the symmetric group, where the NCT library is considered as the generators of the permutation group.


2011 ◽  
Vol 24 (3) ◽  
pp. 423-435 ◽  
Author(s):  
Claudio Moraga

White dots have been used in the schematic representation of reversible circuits to indicate that a control variable has to be inverted to become active. The present paper argues that the use of negated control signals may also offer advantages for the realization, by reducing the number of elementary components. In the case of quantum circuits, this contributes to reduce the quantum cost. It is shown that mixed polarity Reed Muller expressions, possibly extended with Boolean disjunctions, are very helpful to design quantum computing circuits including negated control signals.


2005 ◽  
Vol 95 (14) ◽  
Author(s):  
V. T. Petrashov ◽  
K. G. Chua ◽  
K. M. Marshall ◽  
R. Sh. Shaikhaidarov ◽  
J. T. Nicholls

2014 ◽  
Vol 16 (9) ◽  
pp. 093026 ◽  
Author(s):  
Mateus Araújo ◽  
Adrien Feix ◽  
Fabio Costa ◽  
Časlav Brukner
Keyword(s):  

2021 ◽  
Vol 103 (2) ◽  
Author(s):  
Lucas Kocia ◽  
Mohan Sarovar

Sign in / Sign up

Export Citation Format

Share Document