Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups

Details Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups

2004-12-08

arxiv.org/abs/quant-ph/0412067v2

Physics

Quantum Physics

24 pages, 5 figures, to appear in LMS JCM Updated on 9th August 2005 following the referees comments. Added: Overview of quest

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups 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 Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extending the Promise of the Deutsch--Jozsa--Hoyer Algorithm for Finite Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170157