Access the full text.
Sign up today, get DeepDyve free for 14 days.
T Toffoli (1980)
Elementary gates for quantum computationLecture Notes Comput. Sci., 85
Lov Grover (1996)
A fast quantum mechanical algorithm for database search
R. Wille, Daniel Große, Lisa Teuber, G. Dueck, R. Drechsler (2008)
RevLib: An Online Resource for Reversible Functions and Reversible Circuits38th International Symposium on Multiple Valued Logic (ismvl 2008)
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
Mozammel Khan (2008)
Cost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean CircuitsEng. Lett., 16
Mehdi Saeedi, R. Wille, R. Drechsler (2011)
Synthesis of quantum circuits for linear nearest neighbor architecturesQuantum Information Processing, 10
Abhoy Kole, K. Datta (2017)
Improved NCV Gate Realization of Arbitrary Size Toffoli Gates2017 30th International Conference on VLSI Design and 2017 16th International Conference on Embedded Systems (VLSID)
M. Rahman, G. Dueck (2015)
Synthesis of Linear Nearest Neighbor Quantum CircuitsArXiv, abs/1508.05430
A. Chakrabarti, S. Sur-Kolay (2007)
Nearest Neighbour based Synthesis of Quantum Boolean CircuitsEng. Lett., 15
P. Shor (1994)
Algorithms for quantum computation: discrete logarithms and factoringProceedings 35th Annual Symposium on Foundations of Computer Science
Chia-Chun Lin, S. Sur-Kolay, N. Jha (2015)
PAQCS: Physical Design-Aware Fault-Tolerant Quantum Circuit SynthesisIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 23
K. Datta, I. Sengupta, H. Rahaman (2015)
A Post-Synthesis Optimization Technique for Reversible Circuits Exploiting Negative Control LinesIEEE Transactions on Computers, 64
Mathias Soeken, R. Wille, Christoph Hilken, Nils Przigoda, R. Drechsler (2012)
Synthesis of reversible circuits with minimal lines for large functions17th Asia and South Pacific Design Automation Conference
D. Maslov, G. Dueck, D. Miller (2006)
Techniques for the synthesis of reversible Toffoli networksACM Trans. Design Autom. Electr. Syst., 12
Aaron Lye, R. Wille, R. Drechsler (2015)
Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuitsThe 20th Asia and South Pacific Design Automation Conference
Massoud Pedram, A. Shafaei (2016)
Layout Optimization for Quantum Circuits with Linear Nearest Neighbor ArchitecturesIEEE Circuits and Systems Magazine, 16
Yazhen Wang (2012)
Quantum Computation and Quantum InformationStatistical Science, 27
D. Miller, R. Wille, Zahra Sasanian (2011)
Elementary Quantum Gate Realizations for Multiple-Control Toffoli Gates2011 41st IEEE International Symposium on Multiple-Valued Logic
R. Wille, R. Drechsler (2009)
BDD-based synthesis of reversible logic for large functions2009 46th ACM/IEEE Design Automation Conference
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
In recent years, quantum computing research has been attracting more and more attention, but few studies on the limited interaction distance between quantum bits (qubit) are deeply carried out. This paper presents a mapping method for transforming multiple-control Toffoli (MCT) circuits into linear nearest neighbor (LNN) quantum circuits instead of traditional decomposition-based methods. In order to reduce the number of inserted SWAP gates, a novel type of gate with the optimal LNN quantum realization was constructed, namely NNTS gate. The MCT gate with multiple control bits could be better cascaded by the NNTS gates, in which the arrangement of the input lines was LNN arrangement of the MCT gate. Then, the communication overhead measurement model on inserted SWAP gate count from the original arrangement to the new arrangement was put forward, and we selected one of the LNN arrangements with the minimum SWAP gate count. Moreover, the LNN arrangement-based mapping algorithm was given, and it dealt with the MCT gates in turn and mapped each MCT gate into its LNN form by inserting the minimum number of SWAP gates. Finally, some simplification rules were used, which can further reduce the final quantum cost of the LNN quantum circuit. Experiments on some benchmark MCT circuits indicate that the direct mapping algorithm results in fewer additional SWAP gates in about 50%, while the average improvement rate in quantum cost is 16.95% compared to the decomposition-based method. In addition, it has been verified that the proposed method has greater superiority for reversible circuits cascaded by MCT gates with more control bits.
Quantum Information Processing – Springer Journals
Published: May 29, 2018
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.