Contraction Heuristics for Tensor Decision Diagrams
Author Information
Author(s): Larsen Christian Bøgh, Olsen Simon Brun, Larsen Kim Guldstrand, Schilling Christian
Primary Institution: Department of Computer Science, Aalborg University
Hypothesis
Can new contraction heuristics improve the efficiency of tensor decision diagrams for checking the equivalence of quantum circuits?
Conclusion
The proposed contraction heuristics for tensor decision diagrams outperform existing methods in checking the equivalence of quantum circuits.
Supporting Evidence
- The new heuristics were shown to outperform existing state-of-the-art methods.
- The study provides a framework for checking the equivalence of quantum circuits using tensor networks.
- Experimental results indicate that the counting heuristic is more efficient than the lookahead heuristic.
Takeaway
This study introduces new methods to help computers check if two quantum circuits are the same, making it faster and easier to do so.
Methodology
The study integrates contraction heuristics into tensor decision diagrams to improve the efficiency of equivalence checking for quantum circuits.
Limitations
The heuristics may not perform equally well across all types of quantum circuits and are currently implemented in a sequential manner without parallelization.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website