ﻻ يوجد ملخص باللغة العربية
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.
We study lattice wave functions obtained from the SU(2)$_1$ Wess-Zumino-Witten conformal field theory. Following Moore and Reads construction, the Kalmeyer-Laughlin fractional quantum Hall state is defined as a correlation function of primary fields.
An analytical expression for the von Neumann entropy of the Laughlin wave function is obtained for any possible bipartition between the particles described by this wave function, for filling fraction nu=1. Also, for filling fraction nu=1/m, where m i
We study numerically the geometric entanglement in the Laughlin wave function, which is of great importance in condensed matter physics. The Slater determinant having the largest overlap with the Laughlin wave function is constructed by an iterative
In this paper we used the Fredholm method in Schroedingers integral equation in the investigation of the scattering effect near the center of it between a stationary quantum wave function and an electrostatic potential. Two potentials are studied one
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the Hamiltoni