Quantum algorithm for the Laughlin wave function

Details Quantum algorithm for the Laughlin wave function Quantum algorithm for the Laughlin wave function

2009-02-27

arxiv.org/abs/0902.4797v1

Physics

Quantum Physics

4 pages, 5 figures

Scientific paper

We construct a quantum algorithm that creates the Laughlin state for an arbitrary number of particles $n$ in the case of filling fraction one. This quantum circuit is efficient since it only uses $n(n-1)/2$ local qudit gates and its depth scales as $2n-3$. We further prove the optimality of the circuit using permutation theory arguments and we compute exactly how entanglement develops along the action of each gate. Finally, we discuss its experimental feasibility decomposing the qudits and the gates in terms of qubits and two qubit-gates as well as the generalization to arbitrary filling fraction.

Affiliated with

Also associated with

No associations

Rating

Quantum algorithm for the Laughlin wave function 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 Quantum algorithm for the Laughlin wave function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum algorithm for the Laughlin wave function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572203