Hidden symmetry detection on a quantum computer
| dc.creator | Schützhold, R. | |
| dc.creator | Unruh, W. G. | |
| dc.date | 2003-04-12 | |
| dc.date | 2006-06-19 | |
| dc.date.accessioned | 2026-07-07T06:36:27Z | |
| dc.date.available | 2026-07-07T06:36:27Z | |
| dc.description | 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. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0304090 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0304090 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/100085 | |
| dc.subject | Quantum Physics | |
| dc.title | Hidden symmetry detection on a quantum computer | |
| dc.type | text |