Which graph states are useful for quantum information processing?

To appear in Lecture Notes in Computer Science (LNCS) - Paper session: Quantum Algorithms II - http://gcc.ls.fi.upm.es/tqc2011/

Data and Resources

Additional Info

Field Value
Source Proceedings of the 6th Conference on Theory of Quantum Computation, Communication and Cryptography (TQC)
Author Mhalla, Mehdi, Murao, Mio, Perdrix, Simon, Someya, Masato, Turner, Peter S.
Maintainer CCSD
Last Updated May 7, 2026, 09:15 (UTC)
Created May 7, 2026, 09:15 (UTC)
Identifier hal-00932374
Language en
contributor Calculs algorithmes programmes et preuves (CAPP) ; Laboratoire d'Informatique de Grenoble (LIG) ; Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)
coverage Madrid, Spain
creator Mhalla, Mehdi
date 2011-05-24T00:00:00
harvest_object_id a6836392-7f24-4827-ae8b-9a1ff6fcd795
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-02-07T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/1006.2616
set_spec type:COMM