You are currently offline. Some features of the site may not work correctly.

Corpus ID: 15700980

Quantum Algorithms for Tree Isomorphism and State Symmetrization

@article{Rosenbaum2010QuantumAF,
title={Quantum Algorithms for Tree Isomorphism and State Symmetrization},
author={David J. Rosenbaum},
journal={ArXiv},
year={2010},
volume={abs/1011.4138}
}

The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An interesting open problem is whether quantum computers can solve the graph isomorphism problem in polynomial time. In this paper, an algorithm is shown which can decide if two rooted trees are isomorphic in polynomial time. Although this problem is easy to… Expand