Abstract
Reversible computation has received significant attention in recent years as an alternative computation paradigm which can be beneficial e.g. for encoder circuits, low power design, adiabatic circuits, verification—just to name a few examples. Aside from those applications in the design of (conventional) integrated circuits, reversible logic components are also a key ingredient in many quantum algorithms, i.e. in the field of quantum computing which by itself emerged as a very promising computing paradigm that, particularly these days, gains more and more relevance. All that led to a steadily increasing demand for methods that allow for an efficient and correct design of corresponding circuits. Decision diagrams play an important role in the design of conventional circuitry. In the recent years, also their benefits for the design of the newly emerging reversible and quantum logic circuits become evident. In this overview paper, we review and illustrate previous and ongoing work on decision diagrams for such circuits and sketch corresponding design methods relying on them. By this, we demonstrate how broadly decision diagrams can be employed in this area and how they empower the design flow for these emerging technologies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This work is an extended version of Wille et al. (2018) and also takes into account most recent developments in the field.
- 2.
For a comprehensive overview of these diagrams we refer to Niemann and Wille (2017, Chap. 3).
- 3.
Note that this approach can also be generalized for multiple-valued reversible and quantum functionality as demonstrated in Niemann et al. (2014b).
- 4.
This also does not come with a surprise since, if simulating quantum circuits would be trivial on a conventional machine, there would be no need for a quantum circuit in the first place.
References
A. Abdollahi, M. Pedram, Analysis and synthesis of quantum circuits by using quantum decision diagrams, in Design, Automation and Test in Europe (2006), pp. 317–322
L.G. Amarù, P. Gaillardon, R. Wille, G.D. Micheli, Exploiting inherent characteristics of reversible circuits for faster combinational equivalence checking, in Design, Automation and Test in Europe (2016), pp. 175–180
M. Amy, D. Maslov, M. Mosca, M. Roetteler, A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. CAD 32(6), 818–830 (2013)
W.C. Athas, L.J. Svensson, Reversible logic issues in adiabatic CMOS, in Proceedings Workshop on Physics and Computation, PhysComp’94 (1994), pp. 111–118. https://doi.org/10.1109/PHYCMP.1994.363692
C. Bennett, Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973)
A. Berut, A. Arakelyan, A. Petrosyan, S. Ciliberto, R. Dillenschneider, E. Lutz, Experimental verification of Landauer’s principle linking information and thermodynamics. Nature 483, 187–189 (2012)
R.E. Bryant, Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comp. 35(8), 677–691 (1986)
R.E. Bryant, Y. Chen, Verification of arithmetic circuits with binary moment diagrams, in Design Automation Conference (1995), pp. 535–541. https://doi.org/10.1145/217474.217583. http://doi.acm.org/10.1145/217474.217583
L. Burgholzer, R. Wille, Improved DD-based equivalence checking of quantum circuits, in ASP Design Automation Conference (2020)
R. Drechsler, B. Becker, Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of boolean functions. IEEE Trans. CAD 17(10), 965–973 (1998)
R. Drechsler, J. Shi, G. Fey, Synthesis of fully testable circuits from BDDs. IEEE Trans. CAD 23(3), 440–443 (2004)
R. Drechsler, R. Wille, From truth tables to programming languages: progress in the design of reversible circuits, in International Symposium on Multiple-Valued Logic (2011), pp. 78–85. https://doi.org/10.1109/ISMVL.2011.40
D. Goodman, M.A. Thornton, D.Y. Feinstein, D.M. Miller, Quantum logic circuit simulation based on the QMDD data structure, in International Reed-Muller Workshop (2007)
L.K. Grover, A fast quantum mechanical algorithm for database search, in Symposium on the Theory of Computing (1996), pp. 212–219. https://doi.org/10.1145/237814.237866. http://doi.acm.org/10.1145/237814.237866
P. Gupta, A. Agrawal, N.K. Jha, An algorithm for synthesis of reversible logic circuits. IEEE Trans. CAD 25(11), 2317–2330 (2006)
S. Hillmich, A. Zulehner, R. Wille, Concurrency in DD-based quantum circuit simulation, in ASP Design Automation Conference (2020)
D. Janzing, P. Wocjan, T. Beth, Non-identity check is QMA-complete. Int. J. Quantum Inf. 03(03), 463–473 (2005)
R. Landauer, Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183–191 (1961)
G. Li, Y. Ding, Y. Xie, Tackling the qubit mapping problem for NISQ-era quantum devices, in ASPLOS (2019), pp. 1001–1014
S. Malik, A. Wang, R. Brayton, A. Sangiovanni-Vincentelli, Logic verification using binary decision diagrams in a logic synthesis environment, in International Conference on CAD (1988), pp. 6–9
D. Maslov, G.W. Dueck, D.M. Miller, Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Des. Autom. Electron. Syst. 12(4) (2007)
D.M. Miller, D. Maslov, G.W. Dueck, A transformation based algorithm for reversible logic synthesis, in Design Automation Conference (2003), pp. 318–323
D.M. Miller, R. Wille, Z. Sasanian, Elementary quantum gate realizations for multiple-control Toffoli gates, in International Symposium on Multiple-Valued Logic (2011), pp. 288–293
A. Montanaro, Quantum algorithms: an overview. NPJ Quantum Inf. 2, 15,023 (2016)
M. Nielsen, I. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2000)
P. Niemann, R. Wille, Compact Representations for the Design of Quantum Logic (Springer, 2017)
P. Niemann, R. Wille, R. Drechsler, Efficient synthesis of quantum circuits implementing Clifford group operations, in ASP Design Automation Conference (2014a), pp. 483–488
P. Niemann, R. Wille, R. Drechsler, Equivalence checking in multi-level quantum systems, in Conference on Reversible Computation (2014b), pp. 201–215
P. Niemann, R. Wille, R. Drechsler, Improved synthesis of Clifford+T quantum functionality, in Design, Automation and Test in Europe (2018)
P. Niemann, R. Wille, D.M. Miller, M.A. Thornton, R. Drechsler, QMDDs: efficient quantum function representation and manipulation. IEEE Trans. CAD 35(1), 86–99 (2016)
A. Rauchenecker, T. Ostermann, R. Wille, Exploiting reversible logic design for implementing adiabatic circuits, in 2017 MIXDES-24th International Conference on Mixed Design of Integrated Circuits and Systems (IEEE, 2017), pp. 264–270
M. Saeedi, M. Arabzadeh, M.S. Zamani, M. Sedighi, Block-based quantum-logic synthesis. Quantum Inf. Comput. 11(3 & 4), 262–277 (2011a)
M. Saeedi, R. Wille, R. Drechsler, Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Inf. Process. 10(3), 355–377 (2011b)
M. Saeedi, I.L. Markov, Synthesis and optimization of reversible circuits: a survey. ACM Comput. Surv. 45(2), 21 (2013)
V.V. Shende, S.S. Bullock, I.L. Markov, Synthesis of quantum-logic circuits. IEEE Trans. CAD 25(6), 1000–1010 (2006)
V.V. Shende, A.K. Prasad, I.L. Markov, J.P. Hayes, Reversible logic circuit synthesis, in International Conference on CAD (2002), pp. 353–360
P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)
M. Smelyanskiy, N.P.D. Sawaya, A. Aspuru-Guzik, qHiPSTER: the quantum high performance software testing environment. CoRR (2016), arXiv:1601.07195
M. Soeken, R. Wille, C. Hilken, N. Przigoda, R. Drechsler, Synthesis of reversible circuits with minimal lines for large functions, in ASP Design Automation Conference (2012), pp. 85–92
T. Toffoli, Reversible computing, in Automata, Languages and Programming, ed. by W. de Bakker, J. van Leeuwen (Springer, 1980), p. 632. Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci
G. Viamontes, I. Markov, J.P. Hayes, High-performance QuIDD-based simulation of quantum circuits, in Design, Automation and Test in Europe (2004), pp. 1354–1355
G. Viamontes, I. Markov, J.P. Hayes, Checking equivalence of quantum circuits and states, in International Conference on CAD (2007), pp. 69–74
G. Viamontes, I. Markov, J.P. Hayes, Quantum Circuit Simulation (Springer, 2009)
S.A. Wang, C.Y. Lu, I.M. Tsai, S.Y. Kuo, An XQDD-based verification method for quantum circuits. IEICE Trans. 91-A(2), 584–594 (2008)
D. Wecker, K.M. Svore, LIQUi\(\vert \)>: a software design architecture and domain-specific language for quantum computing. CoRR (2014), arXiv:1402.4467
R. Wille, R. Drechsler, C. Osewold, A.G. Ortiz, Automatic design of low-power encoders using reversible circuit synthesis, in Design, Automation and Test in Europe (2012), pp. 1036–1041. https://doi.org/10.1109/DATE.2012.6176648
R. Wille, D. Große, D.M. Miller, R. Drechsler, Equivalence checking of reversible circuits, in International Symposium on Multiple-Valued Logic (2009), pp. 324–330
R. Wille, O. Keszocze, S. Hillmich, M. Walter, A.G. Ortiz, Synthesis of approximate coders for on-chip interconnects using reversible logic, in Design, Automation and Test in Europe (2016), pp. 1140–1143
R. Wille, P. Niemann, A. Zulehner, R. Drechsler, Decision diagrams for the design of reversible and quantum circuits, in International Symposium on Devices, Circuits and Systems (ISDCS) (2018), pp. 1–6. https://doi.org/10.1109/ISDCS.2018.8379626
A. Zulehner, P. Niemann, R. Drechsler, R. Wille, Accuracy and compactness in decision diagrams for quantum computation, in Design, Automation and Test in Europe (2019a), pp. 280–283. https://doi.org/10.23919/DATE.2019.8715040
A. Zulehner, A. Paler, R. Wille, An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(7), 1226–1236 (2019b)
A. Zulehner, R. Wille, Advanced simulation of quantum computations. CoRR (2017a), arXiv:1707.00865
A. Zulehner, R. Wille, Improving synthesis of reversible circuits: exploiting redundancies in paths and nodes of QMDDs, in Conference on Reversible Computation (2017b), pp. 232–247
A. Zulehner, R. Wille, Make it reversible: efficient embedding of non-reversible functions, in Design, Automation and Test in Europe (2017c), pp. 458–463
A. Zulehner, R. Wille, Taking one-to-one mappings for granted: advanced logic design of encoder circuits, in Design, Automation and Test in Europe (2017d), pp. 818–823
A. Zulehner, R. Wille, Exploiting coding techniques for logic synthesis of reversible circuits, in ASP Design Automation Conference (2018a), pp. 670–675
A. Zulehner, R. Wille, One-pass design of reversible circuits: combining embedding and synthesis for reversible logic. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2018b)
A. Zulehner, R. Wille, Matrix-vector vs. matrix-matrix multiplication: potential in DD-based simulation of quantum computations, in Design, Automation and Test in Europe (2019), pp. 90–95
Acknowledgements
We sincerely thank all co-authors and collaborators who worked with us in the past in this exciting area. This work has partially been supported by the European Union through the COST Action IC1405 as well as the LIT Secure and Correct Systems Lab funded by the State of Upper Austria.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Wille, R., Niemann, P., Zulehner, A., Drechsler, R. (2023). Empowering the Design of Reversible and Quantum Logic with Decision Diagrams. In: Aly, M.M.S., Chattopadhyay, A. (eds) Emerging Computing: From Devices to Systems. Computer Architecture and Design Methodologies. Springer, Singapore. https://doi.org/10.1007/978-981-16-7487-7_11
Download citation
DOI: https://doi.org/10.1007/978-981-16-7487-7_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-7486-0
Online ISBN: 978-981-16-7487-7
eBook Packages: EngineeringEngineering (R0)