Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Banerjee, A. Pathak (2007)
On the Synthesis of Sequential Reversible CircuitarXiv: Quantum Physics
H. Thapliyal, Saurabh Kotiyal, M. Srinivas (2006)
Novel BCD adders and their reversible logic implementation for IEEE 754r format19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06)
Majid Mohammadi, M. Eshghi (2008)
Heuristic methods to use don’t cares in automated design of reversible and quantum logic circuitsQuantum Information Processing, 7
Daniel Große, Xiaobo Chen, G. Dueck, R. Drechsler (2007)
Exact sat-based toffoli network synthesis
Soonchil Lee, S. Lee, Taegon Kim, Jae-Seung Lee, J. Biamonte, M. Perkowski (2006)
The Cost of Quantum Gate PrimitivesJ. Multiple Valued Log. Soft Comput., 12
A. Barenco, C. Bennett, R. Cleve, D. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, H. Weinfurter (1995)
Elementary gates for quantum computation.Physical review. A, Atomic, molecular, and optical physics, 52 5
Konrad Walus, Graham Jullien, V. Dimitrov (2003)
Computer arithmetic structures for quantum cellular automataThe Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, 2
(2007)
Design of reduced quantum cost reversible BCD adder
J. Smolin, D.P. DiVincenzo (1996)
Five two-qubit gates are sufficient to implement the quantum Fredkin gatePhys. Rev. A, 53
Tommaso Toffoli (1980)
Reversible Computing
M. Haghparast, K. Navi (2008)
A Novel Reversible BCD Adder For Nanotechnology Based SystemsAmerican Journal of Applied Sciences, 5
H. Thapliyal, M. Srinivas (2006)
A New Reversible TSG Gate and Its Application For Designing Efficient Adder CircuitsArXiv, abs/cs/0603091
G. Milburn (2007)
An Introduction to Quantum Computing
Pallav Gupta, Abhinav Agrawal, N. Jha (2006)
An Algorithm for Synthesis of Reversible Logic CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 25
Min-Lun Chuang, Chun-Yao Wang (2007)
Synthesis of Reversible Sequential Elements2007 Asia and South Pacific Design Automation Conference
Min-Lun Chuang, Chun-Yao Wang (2006)
Reversible Sequential Element Designs
Y. Rentergem, A. Vos (2005)
Optimal Design of a Reversible Full AdderInt. J. Unconv. Comput., 1
D. DiVincenzo (2004)
Quantum Computing: A Short Course from Theory to Experiment
Harold Ollivier, J. Tillich (2004)
Quantum convolutional codes: fundamentalsarXiv: Quantum Physics
A. Peres (1985)
Reversible logic and quantum computers.Physical review. A, General physics, 32 6
E. Fredkin, T. Toffoli (2002)
Conservative logicInternational Journal of Theoretical Physics, 21
D. Maslov, G. Dueck (2003)
GARBAGE IN REVERSIBLE DESIGN OF MULTIPLE OUTPUT FUNCTIONS
J. Smolin, D. DiVincenzo (1996)
Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate.Physical review. A, Atomic, molecular, and optical physics, 53 4
H. Thapliyal, H. Arabnia (2006)
Reversible Programmable Logic Array (RPLA) using Fredkin & Feynman Gates for Industrial Electronics and ApplicationsArXiv, abs/cs/0609029
R. Landauer (1961)
Irreversibility and heat generation in the computing processIBM J. Res. Dev., 5
P. Kerntopf (2004)
A new heuristic algorithm for reversible logic synthesisProceedings. 41st Design Automation Conference, 2004.
D. Miller, D. Maslov, Gerhard, Dueck (2003)
A transformation based algorithm for reversible logic synthesisProceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
M. Lukac, M. Perkowski, Hilton Goi, Mikhail Pivtoraiko, C. Yu, Kyusik Chung, Hyunkoo Jeech, Byung-Guk Kim, Yong Kim (2003)
Evolutionary Approach to Quantum and Reversible Circuits SynthesisArtificial Intelligence Review, 20
Five figures of merit including number of gates, quantum cost, number of constant inputs, number of garbage outputs, and delay are used casually in the literature to compare the performance of different reversible or quantum logic circuits. In this paper we propose new definitions and enhancements, and identify similarities between these figures of merit. We evaluate these measures to show their strength and weakness. Instead of the number of gates, we introduce the weighted number of gates, where a weighting factor is assigned to each quantum or reversible gate, based on its type, size and technology. We compare the quantum cost with weighted number of gates of a circuit and show three major differences between these measures. It is proved that it is not possible to define a universal reversible logic gate without adding constant inputs. We prove that there is an optimum value for number of constant inputs to obtain a circuit with minimum quantum cost. Some reversible logic benchmarks have been synthesized using Toffoli and Fredkin gates to obtain their optimum values of number of constant inputs. We show that the garbage outputs can also be used to decrease the quantum cost of the circuit. A new definition of delay in quantum and reversible logic circuits is proposed for music line style representation. We also propose a procedure to calculate the delay of a circuit, based on the quantum cost and the depth of the circuit. The results of this research show that to achieve a fair comparison among designs, figures of merit should be considered more thoroughly.
Quantum Information Processing – Springer Journals
Published: Feb 19, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.