M. Grassl, A. Klappenecker and M. Rotteler, “Graphs, Quadratic Forms, and Quantum Codes,” Proceedings of 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, p. 45. http://dx.doi.org/10.1109/ISIT.2002.1023317

has been cited by the following article:

• TITLE: Entanglement and Closest Product States of Graph States with 9 to 11 Qubits

  AUTHORS: Cuifeng Wang, Lizhen Jiang, Lei Wang

  KEYWORDS: Graph State; Entanglement; Closest Product State

  JOURNAL NAME: Journal of Applied Mathematics and Physics, Vol.1 No.4, November 6, 2013

  ABSTRACT: The numbers of local complimentary inequivalent graph states for 9, 10 and 11 qubit systems are 440, 3132, 40457, respectively. We calculate the entanglement, the lower and upper bounds of the entanglement and obtain the closest product states for all these graph states. New patterns of closest product states are analyzed.