Controlling bipartite entanglement in multi-qubit systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F04%3A00010791" target="_blank" >RIV/00216224:14330/04:00010791 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21340/04:04103014
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Controlling bipartite entanglement in multi-qubit systems
Original language description
Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper, we utilize a concept of entangled graphs with weighted edges in order to analyse pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph, while the presence of bipartite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition, we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits.
Czech name
Kontrola dvoustranneho provazani ve vicequbitovych systemech
Czech description
V tomto clanku jsme analyzovali dvoustranne provazani ve vicequbitovych systemech pomoci tzv. entangled grafu.

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GA201%2F01%2F0413" target="_blank" >GA201/01/0413: Quantum information processing</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)