Physics – Quantum Physics
Scientific paper
1999-01-13
Physics
Quantum Physics
5 pages, no figures
Scientific paper
Suppose we are given two graphs on $n$ vertices. We define an observable in
the Hilbert space $\Co[(S_n \wr S_2)^m]$ which returns the answer ``yes'' with
certainty if the graphs are isomorphic and ``no'' with probability at least
$1-n!/2^m$ if the graphs are not isomorphic. We do not know if this observable
is efficiently implementable.
Ettinger Mark
Hoyer Peter
No associations
LandOfFree
A Quantum Observable for the Graph Isomorphism Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Quantum Observable for the Graph Isomorphism Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Quantum Observable for the Graph Isomorphism Problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-229861