Access the full text.
Sign up today, get DeepDyve free for 14 days.
D Pérez-García (2007)
Quantum Inf. Comput. 8, 650 (2008); N. Schuch et al.Phys. Rev. Lett., 98
F. Verstraete, M. Wolf, D. Pérez-García, J. Cirac (2006)
Criticality, the area law, and the computational power of projected entangled pair states.Physical review letters, 96 22
D. Bruß, C. Macchiavello (2010)
Multipartite entanglement in quantum algorithmsPhysical Review A, 83
D. Gottesman (1996)
Class of quantum error-correcting codes saturating the quantum Hamming bound.Physical review. A, Atomic, molecular, and optical physics, 54 3
R. Ionicioiu, T. Spiller (2011)
Encoding graphs into quantum states: An axiomatic approachPhysical Review A, 85
R Horodecki (2009)
Quantum entanglementRev. Mod. Phys., 81
Sébastien Perseguers, M. Lewenstein, A. Ac'in, J. Cirac (2009)
Quantum random networksNature Physics, 6
M. Hein, J. Eisert, H. Briegel, H. Briegel (2003)
Multiparty entanglement in graph statesPhysical Review A, 69
Shengjun Wu, J. Anandan (2003)
What is quantum entanglement
J. Eisert, H. Briegel (2000)
Schmidt measure as a tool for quantifying multiparticle entanglementPhysical Review A, 64
R. Raussendorf, Jim Harrington, Kovid Goyal (2005)
A fault-tolerant one-way quantum computerAnnals of Physics, 321
D. Gottesman (1997)
Theory of fault-tolerant quantum computationPhysical Review A, 57
Ri Qu, Juan Wang, Zong-shang Li, Yanru Bao (2012)
Encoding hypergraphs into quantum statesPhysical Review A, 87
Guifré Vidal (1998)
Entanglement monotonesJournal of Modern Optics, 47
S. Looi, Li Yu, Vlad Gheorghiu, R. Griffiths (2007)
Quantum-error-correcting codes using qudit graph statesPhysical Review A, 78
H. Briegel, R. Raussendorf (2000)
Persistent entanglement in arrays of interacting particles.Physical review letters, 86 5
H. Aschauer, W. Dür, H. Briegel (2004)
Multiparticle entanglement purification for two-colorable graph statesPhysical Review A, 71
Ri Qu, Zong-shang Li, Juan Wang, Yanru Bao (2013)
Multipartite entanglement and hypergraph states of three qubitsPhysical Review A, 87
N. Menicucci, S. Flammia, P. Loock (2010)
Graphical calculus for Gaussian pure statesPhysical Review A, 83
Ri Qu, Yi-ping Ma, Bo Wang, Yanru Bao (2013)
Relationship among locally maximally entangleable states, W states, and hypergraph states under local unitary transformationsPhysical Review A, 87
C. Kruszynska, B. Kraus (2009)
Local entanglability and multipartite entanglementPhysical Review A, 79
R. Raussendorf, D. Browne, H. Briegel (2003)
Measurement-based quantum computation on cluster statesPhysical Review A, 68
Yazhen Wang (2012)
Quantum Computation and Quantum InformationStatistical Science, 27
(2007)
Quantum Inf
R Raussendorf, HJ Briegel (2001)
A one-way quantum computerPhys. Rev. Lett., 86
We investigate some properties of the entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing local entropic measure on qubit $$t$$ t of a hypergraph state by using the Hamming weight of the so-called $$t$$ t -adjacent subhypergraph. Then, we quantify and characterize the entanglement of hypergraph states in terms of local entropic measures obtained by using the above approach. Our results show that full-rank hypergraph states of more than two qubits can not be converted into any graph state under local unitary transformations.
Quantum Information Processing – Springer Journals
Published: Oct 1, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.