Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0902.4797 · Physical Review A

Quantum algorithm for the Laughlin wave function

José Ignacio Latorre, Vicent Picó, Arnau Riera

Published Jun 30, 2010• 4 citations
arXivHTMLPDF

Abstract

We construct a quantum algorithm that creates the Laughlin state for an arbitrary number $n$ of particles for a filling fraction of one. This quantum circuit is efficient since it only uses $n(n\ensuremath{-}1)/2$ local qudit gates and its depth scales as $2n\ensuremath{-}3$. Furthermore, we 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 by decomposing the qudits and the gates in terms of qubits and two qubit-gates, as well as its generalization to arbitrary filling fraction.

DOI
10.1103/physreva.81.060309

Related papers

Creating and Manipulating a Laughlin-Type ν=1/3 Fractional Quantum Hall State on a Quantum Computer with Linear Depth Circuits

Armin Rahmani, Kevin J. Sung, Harald Putterman +3 more

Here, we present an efficient quantum algorithm to generate a many-body state equivalent to Laughlin's ν = 1/3 fractional quantum Hall state on a digitized quantum computer.Our algorithm only uses quantum gates acting on neighboring qubits in a quasi-one-dimensional (1D) setting and its circuit depth is linear in the number of qubits, i.e., the number of Landau orbitals in the second quantized picture.We identify correlation functions that serve as signatures of the Laughlin state and discuss how to obtain them on a quantum computer.We also discuss a generalization of the algorithm for creating quasiparticles in the Laughlin state.This paves the way for several important studies, including quantum simulation of nonequilibrium dynamics and braiding of quasiparticles in quantum Hall states.

arXiv:2005.02399•PRX Quantum•Nov 3, 2020•36 citations

Optimal design of two-qubit quantum circuits

Farrokh Vatan, Colin P. Williams

In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to nderstand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.

•Jan 5, 2004•0 citations

Preparation of Fractional Quantum Hall States on Quantum Computers

Hao Wu, Lei-Yi-Nan Liu, Zhao-Xin Pei +4 more

The realization of fractional quantum Hall (FQH) states, characterized by fractional charge and intrinsic topological order, on quantum computers represents a central challenge at the interface of condensed matter physics and quantum information science. Current methods are grouped into two types: methods based on (quasi-)adiabatic evolution of complex parent Hamiltonians to yield target states, and circuit-based approaches for direct state preparation, which are confined to effectively one-dimensional systems near the thin cylinder or torus limit. We introduce a complementary scheme relying on direct quantum circuit construction, which works for arbitrary geometries. Specifically, we present a method to precisely prepare the $ν=1/3$ Laughlin state on the sphere geometry and demonstrate that it significantly reduces the required number of two-qubit gates and circuit depth, compared to variational quantum circuit approaches. In addition, we employ optimal control techniques to design control pulses for both superconducting and Rydberg atom platforms, identifying experimentally feasible protocols for state preparation. Our results provide an efficient and hardware-relevant pathway for realizing generic FQH states on both noisy intermediate-scale and fault-tolerant quantum devices.

quant-pharXiv:2606.16548•Jun 16, 2026•3 citations

Efficient circuits for exact-universal computation with qudits

Gavin K. Brennen, Stephen S. Bullock, Dianne Prost O’Leary

This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, $\CINC$, is exact-universal. A recent paper [S.Bullock, D.O'Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state-synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.

arXiv:quant-ph/0509161•Quantum Information and Computation•Jul 1, 2006•39 citations

Optimal quantum circuits for general two-qubit gates

Farrokh Vatan, Colin P. Williams

In order to demonstrate nontrivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 controlled-NOT (CNOT) gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requries at most 2 CNOT and 12 one-qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, $y$-rotation, $z$-rotation, and phase gates.

arXiv:quant-ph/0308006•Physical Review A•Mar 22, 2004•478 citations

An arbitrary two-qubit computation in 23 elementary gates or less

Stephen S. Bullock, Igor L. Markov

Quantum circuits currently constitute a dominant model for quantum computation according to M. Nielsen and I. Chuang (2000). Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and a small number of elementary quantum gates by A. Barenco et al. (1995) and G. Song and A. Klappenecker (2003) as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound to 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previous known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm according to G. Cybenko (2001) has a worst case of 61 gates of which 18 may be CNOTs. Our technique rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of two-qubit gate with respect to the "magic basis" of phase-shifted Bell states by N. Khaneja et al. (2001) and M. Lewenstein et al. (2001). We extend this decomposition in terms of elementary gates for quantum computation.

ACM/IEEE Design Automation Conference (DAC)•Mar 1, 2004•7 citations
We construct a quantum algorithm that creates the Laughlin state for an arbitrary number nnn of particles for a filling fraction of one. This quantum circuit is efficient since it only uses n(n\ensuremath−1)/2n(n\ensuremath{-}1)/2n(n\ensuremath−1)/2 local qudit gates and its depth scales as 2n\ensuremath−32n\ensuremath{-}32n\ensuremath−3. Furthermore, we 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 by decomposing the qudits and the gates in terms of qubits and two qubit-gates, as well as its generalization to arbitrary filling fraction.
Here, we present an efficient quantum algorithm to generate a many-body state equivalent to Laughlin's ν = 1/3 fractional quantum Hall state on a digitized quantum computer.Our algorithm only uses quantum gates acting on neighboring qubits in a quasi-one-dimensional (1D) setting and its circuit depth is linear in the number of qubits, i.e., the number of Landau orbitals in the second quantized picture.We identify correlation functions that serve as signatures of the Laughlin state and discuss how to obtain them on a quantum computer.We also discuss a generalization of the algorithm for creating quasiparticles in the Laughlin state.This paves the way for several important studies, including quantum simulation of nonequilibrium dynamics and braiding of quasiparticles in quantum Hall states.
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to nderstand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.
The realization of fractional quantum Hall (FQH) states, characterized by fractional charge and intrinsic topological order, on quantum computers represents a central challenge at the interface of condensed matter physics and quantum information science. Current methods are grouped into two types: methods based on (quasi-)adiabatic evolution of complex parent Hamiltonians to yield target states, and circuit-based approaches for direct state preparation, which are confined to effectively one-dimensional systems near the thin cylinder or torus limit. We introduce a complementary scheme relying on direct quantum circuit construction, which works for arbitrary geometries. Specifically, we present a method to precisely prepare the ν=1/3ν=1/3ν=1/3 Laughlin state on the sphere geometry and demonstrate that it significantly reduces the required number of two-qubit gates and circuit depth, compared to variational quantum circuit approaches. In addition, we employ optimal control techniques to design control pulses for both superconducting and Rydberg atom platforms, identifying experimentally feasible protocols for state preparation. Our results provide an efficient and hardware-relevant pathway for realizing generic FQH states on both noisy intermediate-scale and fault-tolerant quantum devices.
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, $\CINC$, is exact-universal. A recent paper [S.Bullock, D.O'Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state-synthesis circuit in much greater detail and prove that it is correct. Also, the (n-2)/(d-2) ancillas required in the original algorithm may be removed without changing the asymptotics. Further, we present a new algorithm for unitary synthesis, inspired by the QR matrix decomposition, which is also asymptotically optimal.
In order to demonstrate nontrivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 controlled-NOT (CNOT) gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requries at most 2 CNOT and 12 one-qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, yyy-rotation, zzz-rotation, and phase gates.
Quantum circuits currently constitute a dominant model for quantum computation according to M. Nielsen and I. Chuang (2000). Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and a small number of elementary quantum gates by A. Barenco et al. (1995) and G. Song and A. Klappenecker (2003) as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound to 23 elementary gates, of which at most 4 (CNOTs) entail multi-qubit interactions. Our analysis shows that previous known synthesis algorithms, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm according to G. Cybenko (2001) has a worst case of 61 gates of which 18 may be CNOTs. Our technique rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis. They are related to the canonical decomposition of two-qubit gate with respect to the "magic basis" of phase-shifted Bell states by N. Khaneja et al. (2001) and M. Lewenstein et al. (2001). We extend this decomposition in terms of elementary gates for quantum computation.