Quantum algorithm for the Laughlin wave function

Abstract

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.

4 pages, 5 figures

References in corpus (8)

• Many-Body Physics with Ultracold Gases
• Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
• A toolbox for lattice spin models with polar molecules
• Atomic quantum simulator for lattice gauge theories and ring exchange models
• Quantum circuits for strongly correlated quantum systems
• Quantum simulation of the single-particle Schrodinger equation
• Entropy and Exact Matrix Product Representation of the Laughlin Wave Function
• KLM quantum computation as a measurement based computation

Cited by in corpus (3)

• Dirac Equation For Cold Atoms In Artificial Curved Spacetimes
• Simulation of gauge transformations on systems of ultracold atoms
• Roadmap for quantum simulation of the fractional quantum Hall effect