Improved BDD Algorithms for the Simulation of Quantum Circuits
In this paper we develop novel algorithms for the simulation of quantum circuits on classical computers. The most efficient techniques previously studied, represent both quantum state vectors and quantum operator matrices as Multi-Terminal Binary Decision Diagrams (MTBDDS). This paper shows how to avoid representing quantum operators as matrices. Instead, we introduce a class of quantum operators that can be represented more compactly using a symbolic, BDD-based representation. We propose algorithms that apply operators on quantum states, using the symbolic representation. Our algorithms are shown to have superior performance over previous techniques, both asymptotically and experimentally.
Unable to display preview. Download preview PDF.
- 1.Abdollahi, A., Pedram, M.: Analysis and synthesis of quantum circuits by using quantum decision diagrams. In: DATE 2006: Proc. of the Conf. on Design, Automation and Test in Europe, 3001 Leuven, Belgium, pp. 317–322. European Design and Automation Association (2006)Google Scholar
- 6.Koufogiannakis, C.: Techniques for simulating quantum computers. Master’s thesis, Technical U. of Crete (2004)Google Scholar
- 7.Miller, D.M., Thornton, M.A., Goodman, D.: Qmdd: A decision diagram structure for reversible and quantum circuits. In: IEEE Int’l Symp. on Multiple-Valued Logic (ISMVL), pp. 30–30 (2006)Google Scholar
- 12.Viamontes, G.F.: Gate-level simulation of quantum circuits. In: Proc. of the 6th Intl. Conference on Quantum Communication, Measurement, and Computing, pp. 311–314 (2002)Google Scholar
- 13.Viamontes, G.F.: Efficient Quantum Circuit Simulation. PhD thesis, University of Michigan (2007)Google Scholar