Complexity of Graph State Preparation

@inproceedings{Mhalla2004ComplexityOG,
  title={Complexity of Graph State Preparation},
  author={Mehdi Mhalla and Simon Perdrix},
  year={2004}
}
This work presents new interesting results in both areas of graph theory and quantum computation. It analyzes the complexity of preparation of some quantum states called graph states, and investigates the evolution of the minimal degree of a graph by a combinatorial operation introduced by Bouchet [5] called local complementation, characterizing this minimal degree using local properties and using a game introduced by Sutner [20] in relation with cellular automata and called σ-game. Then it… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…