Article

Free access

Analysis and synthesis of quantum circuits by using quantum decision diagrams

Authors:

Afshin Abdollahi,

Massoud PedramAuthors Info & Claims

DATE '06: Proceedings of the conference on Design, automation and test in Europe: Proceedings

Pages 317 - 322

Published: 06 March 2006 Publication History

Abstract

Quantum information processing technology is in its pioneering stage and no proficient method for synthesizing quantum circuits has been introduced so far. This paper introduces an effective analysis and synthesis framework for quantum logic circuits. The proposed synthesis algorithm and flow can generate a quantum circuit using the most basic quantum operators, i. e., the rotation and controlled-rotation primitives. The paper introduces the notion of quantum factored forms and presents a canonical and concise representation of quantum logic circuits in the form of quantum decision diagrams (QDD's), which are amenable to efficient manipulation and optimization including recursive unitary functional bi-decomposition. This paper concludes by presenting the QDD-based algorithm for automatic synthesis of quantum circuits.

References

[1]

http://www.itrs.net/Common/2004Update/2004Update.htm

[2]

R. P. Feynman, "Simulating Physics with Computers," Int'l Journal of Theoretical Physics, 21, 1982, pp. 467--488.

[3]

D. Deutsch, "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer," Royal Society, A, 400, 1985, pp. 97--117.

[4]

M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.

Digital Library

[5]

C. P. Williams, S. H. Clearwater, Explorations in Quantum Computing, Springer-Verlag, 1998.

Digital Library

[6]

M. Hirvensalo, Quantum Computing, Springer Verlag, 2001.

Digital Library

[7]

R. Landauer, "Irreversibility and Heat Generation in the Computational Process," IBM Journal of Research and Development, 5, 1961, pp. 183--191.

Digital Library

[8]

R. Keyes, R. Landauer, "Minimal Energy Dissipation in Logic," IBM Journal of Research and Development, 14, 1970, pp. 152--157.

Digital Library

[9]

P. A. M. Dirac, The Principles of Quantum Mechanics, Oxford University Press, 1st Edition, 1930.

[10]

J. von Neumann, Mathematical Foundations of Quantum Mechanics, Princeton Univ. Press, 1950.

[11]

K. Iwama, Y. Kambayashi, S. Yamashita, "Transformation Rules for Designing CNOT-Based Quantum Circuits," DAC, 2002, pp. 419--424.

Digital Library

[12]

A. Khlopotine, M. Perkowski, P. Kerntopf, "Reversible Logic Synthesis by Iterative Compositions," IWLS, 2002, pp. 261--266.

[13]

D. M. Miller, "Spectral and Two-Place Decomposition Techniques in Reversible Logic," Midwest Symp. on Circuits and Systems, CD-ROM, 2002.

[14]

M. Perkowski, et. al., "Regularity and Symmetry as a Base for Efficient Realization of Reversible Logic Circuits," IWLS, 2001, pp. 90--95.

[15]

T. Toffoli, Reversible Computing, Lab. for Computer Science, MIT, Cambridge, MA, Technical Memo. MIT/LCS/TM-151, 1980.

[16]

P. Kerntopf, "A Comparison of Logical Efficiency of Reversible and Conventional Gates," Intl. Workshop Logic Synthesis, 2000, pp. 261--269.

[17]

D. M. Miller, D. Maslov, G. W. Dueck, "A Transformation Based Algorithm for Reversible Logic Synthesis," Design Automation Conf. 2003, pp. 318--323.

Digital Library

[18]

V. V. Shende, A. K. Prasad, I. L. Markov, J. P. Hayes, "Synthesis of Reversible Logic Circuits," IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, vol. 22(6), 2003, pp. 710--722.

Digital Library

[19]

A. Agrawal, N. K. Jha, "Synthesis of Reversible Logic," Design Automation and Test in Europe, 2004, pp. 21384--21385.

Digital Library

[20]

A. Al-Rabadi, "Quantum Circuit Synthesis Using Classes of GF(3) Reversible Fast Spectral Transforms," Int'l Symp. on Multi Valued Logic, 2004, pp. 87--93.

Digital Library

[21]

V. V. Shende, S. S. Bullock, I. L. Markov, "Synthesis of Quantum Logic Circuits," A SP Design Automation Conf., 2005, pp. 272--275.

Digital Library

[22]

L. Storme et. al., "Group Theoretical Aspects of Reversible Logic Gates," Journal of Universal Computer Science 5, 1999, pp. 307--321.

[23]

A. De Vos et. al., "Generating the Group of Reversible Logic Gates," Journal of Physics A: Mathematical and General, 35, 2002, pp. 7063--7078.

[24]

W. Hung, X. Song, G. Yang, J. Yang, M. Perkowski, "Quantum Logic Synthesis by Symbolic Reachability Analysis," Design Automation Conference, 2004, pp. 838--841.

Digital Library

[25]

A. Al-Rabadi, L. Casperson and M. Perkowski, Multiple-valued quantum logic, Quantum Computers and Computing, Vol. 3, Number 1.

[26]

G. F. Viamontes, I. L. Markov and J. P. Hayes, "Improving Gate-Level Simulation of Quantum Circuits1," Quantum Information Processing, Vol. 2, No. 5, 2003

Digital Library

[27]

M. Lukac et. al, "Evolutionary Approach to Quantum and Reversible Circuits Synthesis," Artificial Intelligence in Logic Design, Kluwer Academic Publisher, 2004, pp. 361--417.

Digital Library

[28]

J. I. Cirac, P. Zoller, "Quantum Computation with Cold Trapped Ions," Physical Review, 74, Issue 20, 1995, pp. 4091--4094.

[29]

C. Monroe, et. al., "Simplified Quantum Logic with Trapped Ions," Physical Review A, 55, Issue 4, 1997, pp. 2489--2491.

[30]

R. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. on Computers, vol. 35, 1986, pp. 677--691.

Digital Library

[31]

K. Brace, R. Rudell, and R. Bryant, "Efficient Implementation of a BDD Package," Design Automation Conf., 1990, pp. 40--45.

Digital Library

[32]

Y.-T. Lai, M. Pedram, and S. Vrudhula, "EVBDD-Based Algorithms for Integer Linear Programming, Spectral Transformation, and Function Decomposition," IEEE Trans. on Computer-Aided Design, 8, 1994, pp. 959--975.

Digital Library

[33]

A. Barenco et. al., "Elementary Gates for Quantum Computation," Physical Review A, 52, 1995, pp. 3457--3467.

Cited By

Saeedi MZamani MSedighi MKyung CChoi KHa S(2008)Moving forwardProceedings of the 2008 Asia and South Pacific Design Automation Conference10.5555/1356802.1356822(83-88)Online publication date: 21-Jan-2008
https://dl.acm.org/doi/10.5555/1356802.1356822
Abdollahi AGielen G(2007)Probabilistic decision diagrams for exact probabilistic analysisProceedings of the 2007 IEEE/ACM international conference on Computer-aided design10.5555/1326073.1326128(266-272)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.5555/1326073.1326128
Zulehner AHillmich SMarkov IWille R(undefined)Approximation of Quantum States Using Decision Diagrams2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC)10.1109/ASP-DAC47756.2020.9045454(121-126)
https://dl.acm.org/doi/10.1109/ASP-DAC47756.2020.9045454

Recommendations

Binary superposed quantum decision diagrams

Binary superposed decision diagrams (BSQDDs) are a new type of quantum decision diagram that can be used for representing arbitrary quantum superpositions. One major advantage of BSQDDs is that they are dependent on the types of gates used in synthesis ...
Commuting quantum circuits: efficient classical simulations versus hardness results

The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine quantum effects ...
Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition

Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalization leads to quantum computing with hybrid qudits where two or more qudits ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

DATE '06: Proceedings of the conference on Design, automation and test in Europe: Proceedings

March 2006

1390 pages

ISBN:3981080106

General Chair:
Georges Gielen
KU Leuven, BE

Sponsors

EDAA: European Design Automation Association
The EDA Consortium
IEEE-CS\DATC: The IEEE Computer Society

Publisher

European Design and Automation Association

Leuven, Belgium

Publication History

Published: 06 March 2006

Qualifiers

Article

Acceptance Rates

DATE '06 Paper Acceptance Rate 267 of 834 submissions, 32%;

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
377
Total Downloads

Downloads (Last 12 months)71
Downloads (Last 6 weeks)17

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Saeedi MZamani MSedighi MKyung CChoi KHa S(2008)Moving forwardProceedings of the 2008 Asia and South Pacific Design Automation Conference10.5555/1356802.1356822(83-88)Online publication date: 21-Jan-2008
https://dl.acm.org/doi/10.5555/1356802.1356822
Abdollahi AGielen G(2007)Probabilistic decision diagrams for exact probabilistic analysisProceedings of the 2007 IEEE/ACM international conference on Computer-aided design10.5555/1326073.1326128(266-272)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.5555/1326073.1326128
Zulehner AHillmich SMarkov IWille R(undefined)Approximation of Quantum States Using Decision Diagrams2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC)10.1109/ASP-DAC47756.2020.9045454(121-126)
https://dl.acm.org/doi/10.1109/ASP-DAC47756.2020.9045454

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten