Bipartite entanglement and hypergraph states
Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special s...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Qu, Ri [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media New York 2014 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Quantum information processing - Springer US, 2002, 14(2014), 2 vom: 30. Nov., Seite 547-558 |
|---|---|
| Übergeordnetes Werk: |
volume:14 ; year:2014 ; number:2 ; day:30 ; month:11 ; pages:547-558 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11128-014-0890-z |
|---|
| Katalog-ID: |
OLC2075145709 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2075145709 | ||
| 003 | DE-627 | ||
| 005 | 20230504015115.0 | ||
| 007 | tu | ||
| 008 | 200820s2014 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11128-014-0890-z |2 doi | |
| 035 | |a (DE-627)OLC2075145709 | ||
| 035 | |a (DE-He213)s11128-014-0890-z-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 33.23$jQuantenphysik |2 bkl | ||
| 084 | |a 54.10$jTheoretische Informatik |2 bkl | ||
| 100 | 1 | |a Qu, Ri |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Bipartite entanglement and hypergraph states |
| 264 | 1 | |c 2014 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media New York 2014 | ||
| 520 | |a Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. | ||
| 650 | 4 | |a Hypergraph states | |
| 650 | 4 | |a Bipartite entanglement | |
| 650 | 4 | |a Concurrence | |
| 700 | 1 | |a Shang, Bing-jian |4 aut | |
| 700 | 1 | |a Wang, Juan |4 aut | |
| 700 | 1 | |a Bao, Yan-ru |4 aut | |
| 700 | 1 | |a Li, Zong-shang |4 aut | |
| 700 | 1 | |a Ma, Yi-ping |4 aut | |
| 700 | 1 | |a Song, Da-wei |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Quantum information processing |d Springer US, 2002 |g 14(2014), 2 vom: 30. Nov., Seite 547-558 |w (DE-627)489255752 |w (DE-600)2191523-4 |w (DE-576)9489255750 |x 1570-0755 |7 nnns |
| 773 | 1 | 8 | |g volume:14 |g year:2014 |g number:2 |g day:30 |g month:11 |g pages:547-558 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11128-014-0890-z |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 936 | b | k | |a 33.23$jQuantenphysik |q VZ |0 106407910 |0 (DE-625)106407910 |
| 936 | b | k | |a 54.10$jTheoretische Informatik |q VZ |0 106418815 |0 (DE-625)106418815 |
| 951 | |a AR | ||
| 952 | |d 14 |j 2014 |e 2 |b 30 |c 11 |h 547-558 | ||
| author_variant |
r q rq b j s bjs j w jw y r b yrb z s l zsl y p m ypm d w s dws |
|---|---|
| matchkey_str |
article:15700755:2014----::iattetnlmnadyeg |
| hierarchy_sort_str |
2014 |
| bklnumber |
33.23$jQuantenphysik 54.10$jTheoretische Informatik |
| publishDate |
2014 |
| allfields |
10.1007/s11128-014-0890-z doi (DE-627)OLC2075145709 (DE-He213)s11128-014-0890-z-p DE-627 ger DE-627 rakwb eng 004 VZ 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik bkl Qu, Ri verfasserin aut Bipartite entanglement and hypergraph states 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. Hypergraph states Bipartite entanglement Concurrence Shang, Bing-jian aut Wang, Juan aut Bao, Yan-ru aut Li, Zong-shang aut Ma, Yi-ping aut Song, Da-wei aut Enthalten in Quantum information processing Springer US, 2002 14(2014), 2 vom: 30. Nov., Seite 547-558 (DE-627)489255752 (DE-600)2191523-4 (DE-576)9489255750 1570-0755 nnns volume:14 year:2014 number:2 day:30 month:11 pages:547-558 https://doi.org/10.1007/s11128-014-0890-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 33.23$jQuantenphysik VZ 106407910 (DE-625)106407910 54.10$jTheoretische Informatik VZ 106418815 (DE-625)106418815 AR 14 2014 2 30 11 547-558 |
| spelling |
10.1007/s11128-014-0890-z doi (DE-627)OLC2075145709 (DE-He213)s11128-014-0890-z-p DE-627 ger DE-627 rakwb eng 004 VZ 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik bkl Qu, Ri verfasserin aut Bipartite entanglement and hypergraph states 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. Hypergraph states Bipartite entanglement Concurrence Shang, Bing-jian aut Wang, Juan aut Bao, Yan-ru aut Li, Zong-shang aut Ma, Yi-ping aut Song, Da-wei aut Enthalten in Quantum information processing Springer US, 2002 14(2014), 2 vom: 30. Nov., Seite 547-558 (DE-627)489255752 (DE-600)2191523-4 (DE-576)9489255750 1570-0755 nnns volume:14 year:2014 number:2 day:30 month:11 pages:547-558 https://doi.org/10.1007/s11128-014-0890-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 33.23$jQuantenphysik VZ 106407910 (DE-625)106407910 54.10$jTheoretische Informatik VZ 106418815 (DE-625)106418815 AR 14 2014 2 30 11 547-558 |
| allfields_unstemmed |
10.1007/s11128-014-0890-z doi (DE-627)OLC2075145709 (DE-He213)s11128-014-0890-z-p DE-627 ger DE-627 rakwb eng 004 VZ 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik bkl Qu, Ri verfasserin aut Bipartite entanglement and hypergraph states 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. Hypergraph states Bipartite entanglement Concurrence Shang, Bing-jian aut Wang, Juan aut Bao, Yan-ru aut Li, Zong-shang aut Ma, Yi-ping aut Song, Da-wei aut Enthalten in Quantum information processing Springer US, 2002 14(2014), 2 vom: 30. Nov., Seite 547-558 (DE-627)489255752 (DE-600)2191523-4 (DE-576)9489255750 1570-0755 nnns volume:14 year:2014 number:2 day:30 month:11 pages:547-558 https://doi.org/10.1007/s11128-014-0890-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 33.23$jQuantenphysik VZ 106407910 (DE-625)106407910 54.10$jTheoretische Informatik VZ 106418815 (DE-625)106418815 AR 14 2014 2 30 11 547-558 |
| allfieldsGer |
10.1007/s11128-014-0890-z doi (DE-627)OLC2075145709 (DE-He213)s11128-014-0890-z-p DE-627 ger DE-627 rakwb eng 004 VZ 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik bkl Qu, Ri verfasserin aut Bipartite entanglement and hypergraph states 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. Hypergraph states Bipartite entanglement Concurrence Shang, Bing-jian aut Wang, Juan aut Bao, Yan-ru aut Li, Zong-shang aut Ma, Yi-ping aut Song, Da-wei aut Enthalten in Quantum information processing Springer US, 2002 14(2014), 2 vom: 30. Nov., Seite 547-558 (DE-627)489255752 (DE-600)2191523-4 (DE-576)9489255750 1570-0755 nnns volume:14 year:2014 number:2 day:30 month:11 pages:547-558 https://doi.org/10.1007/s11128-014-0890-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 33.23$jQuantenphysik VZ 106407910 (DE-625)106407910 54.10$jTheoretische Informatik VZ 106418815 (DE-625)106418815 AR 14 2014 2 30 11 547-558 |
| allfieldsSound |
10.1007/s11128-014-0890-z doi (DE-627)OLC2075145709 (DE-He213)s11128-014-0890-z-p DE-627 ger DE-627 rakwb eng 004 VZ 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik bkl Qu, Ri verfasserin aut Bipartite entanglement and hypergraph states 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. Hypergraph states Bipartite entanglement Concurrence Shang, Bing-jian aut Wang, Juan aut Bao, Yan-ru aut Li, Zong-shang aut Ma, Yi-ping aut Song, Da-wei aut Enthalten in Quantum information processing Springer US, 2002 14(2014), 2 vom: 30. Nov., Seite 547-558 (DE-627)489255752 (DE-600)2191523-4 (DE-576)9489255750 1570-0755 nnns volume:14 year:2014 number:2 day:30 month:11 pages:547-558 https://doi.org/10.1007/s11128-014-0890-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 33.23$jQuantenphysik VZ 106407910 (DE-625)106407910 54.10$jTheoretische Informatik VZ 106418815 (DE-625)106418815 AR 14 2014 2 30 11 547-558 |
| language |
English |
| source |
Enthalten in Quantum information processing 14(2014), 2 vom: 30. Nov., Seite 547-558 volume:14 year:2014 number:2 day:30 month:11 pages:547-558 |
| sourceStr |
Enthalten in Quantum information processing 14(2014), 2 vom: 30. Nov., Seite 547-558 volume:14 year:2014 number:2 day:30 month:11 pages:547-558 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Hypergraph states Bipartite entanglement Concurrence |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Quantum information processing |
| authorswithroles_txt_mv |
Qu, Ri @@aut@@ Shang, Bing-jian @@aut@@ Wang, Juan @@aut@@ Bao, Yan-ru @@aut@@ Li, Zong-shang @@aut@@ Ma, Yi-ping @@aut@@ Song, Da-wei @@aut@@ |
| publishDateDaySort_date |
2014-11-30T00:00:00Z |
| hierarchy_top_id |
489255752 |
| dewey-sort |
14 |
| id |
OLC2075145709 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2075145709</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504015115.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11128-014-0890-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2075145709</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11128-014-0890-z-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">33.23$jQuantenphysik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10$jTheoretische Informatik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Qu, Ri</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Bipartite entanglement and hypergraph states</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypergraph states</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bipartite entanglement</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrence</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shang, Bing-jian</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Juan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bao, Yan-ru</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Zong-shang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ma, Yi-ping</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Song, Da-wei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Quantum information processing</subfield><subfield code="d">Springer US, 2002</subfield><subfield code="g">14(2014), 2 vom: 30. Nov., Seite 547-558</subfield><subfield code="w">(DE-627)489255752</subfield><subfield code="w">(DE-600)2191523-4</subfield><subfield code="w">(DE-576)9489255750</subfield><subfield code="x">1570-0755</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:14</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:2</subfield><subfield code="g">day:30</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:547-558</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11128-014-0890-z</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">33.23$jQuantenphysik</subfield><subfield code="q">VZ</subfield><subfield code="0">106407910</subfield><subfield code="0">(DE-625)106407910</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.10$jTheoretische Informatik</subfield><subfield code="q">VZ</subfield><subfield code="0">106418815</subfield><subfield code="0">(DE-625)106418815</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">14</subfield><subfield code="j">2014</subfield><subfield code="e">2</subfield><subfield code="b">30</subfield><subfield code="c">11</subfield><subfield code="h">547-558</subfield></datafield></record></collection>
|
| author |
Qu, Ri |
| spellingShingle |
Qu, Ri ddc 004 bkl 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik misc Hypergraph states misc Bipartite entanglement misc Concurrence Bipartite entanglement and hypergraph states |
| authorStr |
Qu, Ri |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)489255752 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1570-0755 |
| topic_title |
004 VZ 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik bkl Bipartite entanglement and hypergraph states Hypergraph states Bipartite entanglement Concurrence |
| topic |
ddc 004 bkl 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik misc Hypergraph states misc Bipartite entanglement misc Concurrence |
| topic_unstemmed |
ddc 004 bkl 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik misc Hypergraph states misc Bipartite entanglement misc Concurrence |
| topic_browse |
ddc 004 bkl 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik misc Hypergraph states misc Bipartite entanglement misc Concurrence |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Quantum information processing |
| hierarchy_parent_id |
489255752 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Quantum information processing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)489255752 (DE-600)2191523-4 (DE-576)9489255750 |
| title |
Bipartite entanglement and hypergraph states |
| ctrlnum |
(DE-627)OLC2075145709 (DE-He213)s11128-014-0890-z-p |
| title_full |
Bipartite entanglement and hypergraph states |
| author_sort |
Qu, Ri |
| journal |
Quantum information processing |
| journalStr |
Quantum information processing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
txt |
| container_start_page |
547 |
| author_browse |
Qu, Ri Shang, Bing-jian Wang, Juan Bao, Yan-ru Li, Zong-shang Ma, Yi-ping Song, Da-wei |
| container_volume |
14 |
| class |
004 VZ 33.23$jQuantenphysik bkl 54.10$jTheoretische Informatik bkl |
| format_se |
Aufsätze |
| author-letter |
Qu, Ri |
| doi_str_mv |
10.1007/s11128-014-0890-z |
| normlink |
106407910 106418815 |
| normlink_prefix_str_mv |
106407910 (DE-625)106407910 106418815 (DE-625)106418815 |
| dewey-full |
004 |
| title_sort |
bipartite entanglement and hypergraph states |
| title_auth |
Bipartite entanglement and hypergraph states |
| abstract |
Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. © Springer Science+Business Media New York 2014 |
| abstractGer |
Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. © Springer Science+Business Media New York 2014 |
| abstract_unstemmed |
Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled. © Springer Science+Business Media New York 2014 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
2 |
| title_short |
Bipartite entanglement and hypergraph states |
| url |
https://doi.org/10.1007/s11128-014-0890-z |
| remote_bool |
false |
| author2 |
Shang, Bing-jian Wang, Juan Bao, Yan-ru Li, Zong-shang Ma, Yi-ping Song, Da-wei |
| author2Str |
Shang, Bing-jian Wang, Juan Bao, Yan-ru Li, Zong-shang Ma, Yi-ping Song, Da-wei |
| ppnlink |
489255752 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11128-014-0890-z |
| up_date |
2024-07-04T00:30:33.099Z |
| _version_ |
1803606329236914176 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2075145709</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504015115.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11128-014-0890-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2075145709</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11128-014-0890-z-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">33.23$jQuantenphysik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10$jTheoretische Informatik</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Qu, Ri</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Bipartite entanglement and hypergraph states</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using the so-called Hamming weights of several special subhypergraphs of the corresponding hypergraph. Then, we quantify and characterize bipartite entanglement between each qubit pair of several special hypergraph states in terms of the concurrence obtained by using the above approach. Our main result includes that a graph g has a component with the vertex set $$\{i,j\}$$ if and only if the qubit pair labeled by $$\{i,j\}$$ of the graph state $$|g\rangle $$ is entangled.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypergraph states</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bipartite entanglement</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrence</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shang, Bing-jian</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Juan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bao, Yan-ru</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Zong-shang</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ma, Yi-ping</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Song, Da-wei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Quantum information processing</subfield><subfield code="d">Springer US, 2002</subfield><subfield code="g">14(2014), 2 vom: 30. Nov., Seite 547-558</subfield><subfield code="w">(DE-627)489255752</subfield><subfield code="w">(DE-600)2191523-4</subfield><subfield code="w">(DE-576)9489255750</subfield><subfield code="x">1570-0755</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:14</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:2</subfield><subfield code="g">day:30</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:547-558</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11128-014-0890-z</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">33.23$jQuantenphysik</subfield><subfield code="q">VZ</subfield><subfield code="0">106407910</subfield><subfield code="0">(DE-625)106407910</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.10$jTheoretische Informatik</subfield><subfield code="q">VZ</subfield><subfield code="0">106418815</subfield><subfield code="0">(DE-625)106418815</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">14</subfield><subfield code="j">2014</subfield><subfield code="e">2</subfield><subfield code="b">30</subfield><subfield code="c">11</subfield><subfield code="h">547-558</subfield></datafield></record></collection>
|
| score |
7.39931 |