Symmetric functions of qubits in an unknown basis

Details Symmetric functions of qubits in an unknown basis Symmetric functions of qubits in an unknown basis

2009-03-31

arxiv.org/abs/0903.5466v2

Phys. Rev. A 79, 062316 (2009)

Physics

Quantum Physics

6 pages, 3 figures; v2: improved results, essentially published version

Scientific paper

10.1103/PhysRevA.79.062316

Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state with Hamming weight |x| at most n/2, it is possible to reconstruct |x| with success probability 1 - |x|/(n-|x|+1), and thus to compute any symmetric function of x. We give explicit algorithms for computing whether or not |x| is at least t for some t, and for computing the parity of x, and show that these are essentially optimal. These results can be seen as generalisations of the swap test for comparing quantum states.

Affiliated with

Also associated with

No associations

Rating

Symmetric functions of qubits in an unknown basis 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 Symmetric functions of qubits in an unknown basis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetric functions of qubits in an unknown basis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-20662