{
  "id": "1702.03493",
  "version": "v1",
  "published": "2017-02-12T06:16:04.000Z",
  "updated": "2017-02-12T06:16:04.000Z",
  "title": "Centrality measure based on continuous-time quantum walks and experimental realization",
  "authors": [
    "Josh A. Izaac",
    "Xiang Zhan",
    "Zhihao Bian",
    "Kunkun Wang",
    "ian Li",
    "Jingbo B. Wang",
    "Peng Xue"
  ],
  "comment": "To appear in Physical Review A",
  "categories": [
    "quant-ph"
  ],
  "abstract": "Network centrality has important implications well beyond its role in physical and information transport analysis; as such, various quantum walk-based algorithms have been proposed for measuring network vertex centrality. In this work, we propose a continuous-time quantum walk algorithm for determining vertex centrality, and show that it generalizes to arbitrary graphs via a statistical analysis of randomly generated scale-free and Erd\\H{o}s-R\\'enyi networks. As a proof of concept, the algorithm is detailed on a 4-vertex star graph and physically implemented via linear optics, using spatial and polarization degrees of freedoms of single photons. This paper reports the first successful physical demonstration of a quantum centrality algorithm.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-02-12T06:16:04.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "experimental realization",
      "centrality measure",
      "continuous-time quantum walk algorithm",
      "quantum centrality algorithm",
      "measuring network vertex centrality"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}