Learning and Testing Algorithms for the Clifford Group

Details Learning and Testing Algorithms for the Clifford Group Learning and Testing Algorithms for the Clifford Group

2009-07-16

arxiv.org/abs/0907.2833v1

Phys. Rev. A Vol 80, 052314 (2009)

Physics

Quantum Physics

7 pages

Scientific paper

10.1103/PhysRevA.80.052314

Given oracle access to an unknown unitary C from the Clifford group and its conjugate, we give an exact algorithm for identifying C with O(n) queries, which we prove is optimal. We then extend this to all levels of the Gottesman-Chuang hierarchy (also known as the C_k hierarchy). Further, for unitaries not in the hierarchy itself but known to be close to an element of the hierarchy, we give a method of finding this close element. We also present a Clifford testing algorithm that decides whether a given black-box unitary is close to a Clifford or far from every Clifford.

Affiliated with

Also associated with

No associations

Rating

Learning and Testing Algorithms for the Clifford Group 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 Learning and Testing Algorithms for the Clifford Group, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning and Testing Algorithms for the Clifford Group will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-621898