Universal quantum computation with unlabeled qubits

Details Universal quantum computation with unlabeled qubits Universal quantum computation with unlabeled qubits

2006-01-11

arxiv.org/abs/quant-ph/0601078v3

J. Physics A: Math. Gen. 39 (2006) 8507-8515.

Physics

Quantum Physics

6 pages

Scientific paper

10.1088/0305-4470/39/26/016

We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a non-local phase-flip (for a fixed but arbitrary coefficient), can do universal quantum computation on n qubits. A quantum computation, making use of n qubits and based on these operations, is then a word of variable length, but whose letters are always taken from an alphabet of cardinality three. Therefore, in contrast with other universal sets, no choice of qubit lines is needed for the application of the operations described here. A quantum algorithm based on this set can be interpreted as a discrete diffusion of a quantum particle on a de Bruijn graph, corrected on-the-fly by auxiliary modifications of the phases associated to the arcs.

Affiliated with

Also associated with

No associations

Rating

Universal quantum computation with unlabeled qubits 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 Universal quantum computation with unlabeled qubits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal quantum computation with unlabeled qubits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-495430