On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems

Details On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems

2005-10-25

arxiv.org/abs/quant-ph/0510185v1

Quantum Information and Computation, Vol. 7, No. 5-6 (2007) 504-521

Physics

Quantum Physics

19 pages

Scientific paper

We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism problems) by solving a nonabelian hidden shift problem on a quantum computer using the standard method. Such an approach is arguably more natural than viewing the problem as a hidden subgroup problem. We prove that the hidden shift approach to rigid graph isomorphism is hard in two senses. First, we prove that Omega(n) copies of the hidden shift states are necessary to solve the problem (whereas O(n log n) copies are sufficient). Second, we prove that if one is restricted to single-register measurements, an exponential number of hidden shift states are required.

Affiliated with

Also associated with

No associations

Rating

On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems 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 On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-430386