• DocumentCode
    527731
  • Title

    Entanglement of 10-qubit graph states

  • Author

    Chen, Guo-wei ; Chen, Xiao-yu

  • Author_Institution
    Coll. of Inf. & Electron. Eng., Zhejiang Gongshang Univ., Hangzhou, China
  • Volume
    6
  • fYear
    2010
  • fDate
    10-12 Aug. 2010
  • Firstpage
    2970
  • Lastpage
    2974
  • Abstract
    The number of inequivalent classes of 10-qubit graph states is 3132. All 3132 local inequivalent graphs are classified as two categories: graphs with equal bound, graphs with unequal bounds. We will use different methods to calculate the entanglement of graph states of ten qubits for the different categories. For graph states with different entanglement bounds, the closest product states are given, and they have different structural characters.
  • Keywords
    graph theory; quantum entanglement; 10-qubit graph states; entanglement; local inequivalent graphs; Algorithm design and analysis; Computers; Equations; Iterative algorithm; Iterative methods; Mathematical model; Quantum computing; closest product state; entanglement; graph states; iterative algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation (ICNC), 2010 Sixth International Conference on
  • Conference_Location
    Yantai, Shandong
  • Print_ISBN
    978-1-4244-5958-2
  • Type

    conf

  • DOI
    10.1109/ICNC.2010.5583975
  • Filename
    5583975
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=527731