Corpus ID: 15700980

Quantum Algorithms for Tree Isomorphism and State Symmetrization

  title={Quantum Algorithms for Tree Isomorphism and State Symmetrization},
  author={David J. Rosenbaum},
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
2 Citations
Quantum Computation and Isomorphism Testing
  • 2
Uselessness for an Oracle model with internal randomness
  • 9
  • PDF


Polynomial-time algorithms for permutation groups
  • 284
  • PDF
Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID)
  • 5
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
  • 4,983
  • PDF
Adiabatic quantum state generation and statistical zero knowledge
  • 276
  • PDF
Initializing the Amplitude Distribution of a Quantum State
  • 60
  • PDF
Group-Theoretic Algorithms and Graph Isomorphism
  • C. Hoffmann
  • Mathematics, Computer Science
  • Lecture Notes in Computer Science
  • 1982
  • 232
  • PDF
Graph Isomorphism is in the Low Hierarchy
  • U. Schöning
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1988
  • 166
Quantum fingerprinting.
  • 574
  • PDF
The Design and Analysis of Computer Algorithms
  • 9,245
  • PDF