Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups
| dc.creator | Batty, Michael | |
| dc.creator | Braunstein, Samuel L. | |
| dc.creator | Duncan, Andrew J. | |
| dc.date | 2004-12-08 | |
| dc.date | 2005-08-09 | |
| dc.date.accessioned | 2026-07-07T06:11:44Z | |
| dc.date.available | 2026-07-07T06:11:44Z | |
| dc.description | Hoyer has given a generalisation of the Deutsch--Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one) or constant, with certainty, and using a single quantum query. Here, we show that this algorithm (which we call the Deutsch--Jozsa--Hoyer algorithm) can in fact deal with a broader range of promises, which we define in terms of the irreducible representations of G. | |
| dc.description | 24 pages, 5 figures, to appear in LMS JCM Updated on 9th August 2005 following the referees comments. Added: Overview of questions surrounding the Fourier transform; Appendix on group representations. Corrected typos and improved notation | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0412067 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0412067 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/92572 | |
| dc.subject | Quantum Physics | |
| dc.title | Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups | |
| dc.type | text |