Reordering decision diagrams for quantum computing is harder than you might think

DOI10.1007/978-3-031-09005-9_7OpenAlexW4293210668MaRDI QIDQ2097418

Florian Stögmüller, Robert Wille, Lukas Burgholzer, Stefan Hillmich

Publication date: 11 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09005-9_7

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Uses Software

• QMDD
• QuIDDPro
• GNU parallel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient manipulation of decision diagrams
• Quantum Circuit Simulation
• Graph-Based Algorithms for Boolean Function Manipulation
• Quantum algorithms and the Fourier transform
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The Theory of Quantum Information
• Finding the optimal variable ordering for binary decision diagrams

This page was built for publication: Reordering decision diagrams for quantum computing is harder than you might think