Hidden symmetry detection on a quantum computer

Details Hidden symmetry detection on a quantum computer Hidden symmetry detection on a quantum computer

2003-04-12

arxiv.org/abs/quant-ph/0304090v4

Physics

Quantum Physics

8 pages

Scientific paper

The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries {$V\{f(x),f(U[x])\}=0$} by a quantum algorithm can also admit an exponential speed-up. E.g., one member of this class of symmetries {$V\{f(x),f(U[x])\}=0$} is discrete self-similarity (or discrete scale invariance). PACS: 03.67.Lx, 89.70.+c.

Affiliated with

Also associated with

No associations

Rating

Hidden symmetry detection on a quantum computer 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 Hidden symmetry detection on a quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hidden symmetry detection on a quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462482