نوع مقاله : مقاله پژوهشی
نویسندگان
1 استادیار گروه علوم پایه دانشگاه فرهنگیان، تهران، ایران.
2 گروه فیزیک نظری و اخترفیزیک، دانشگاه تبریز، تبریز، ایران.
3 معاونت درمان دانشگاه علوم پزشکی، تبریز، ایران.
4 دبیر فیزیک آموزش و پرورش ناحیه یک، تبریز، ایران
5 دبیر کامپیوترآموزش و پرورش، مرند، ایران
چکیده
کلیدواژهها
عنوان مقاله [English]
نویسندگان [English]
The entanglement classification of quantum states is nearly related to the positive
homogeneous function that is invariant under stochastic local operations and classical
communication (SLOCC) transformations. In this paper, first we give a general scheme
to measure the N-tangle as an entanglement measure of an arbitrary odd-N qubit pure
state. Then we develop a classification algorithm that is based on the integration between
competitive learning and the computational power of quantum computing. Using this
algorithm the entanglement measure we classify an input into one of two binary classes
even if the input pattern is incomplete.The entanglement quantification and classification of quantum states of a large number of
particles becomes quickly complex. This major challenge was raised within the quantum information science regarding the physical phenomenon of entanglement as a key resource. During
the past years, the polynomial invariants such as concurrence for two-qubit states and
three-tangle for pure three-qubit states was defined
کلیدواژهها [English]
)