ON THE RELATION BETWEEN A GRAPH CODE AND A GRAPH STATE

作     者：Hwang, Yongsoo Heo, Jun 

作者机构：Korea Univ Sch Elect Engn Seoul 136713 South Korea 

出 版 物：《QUANTUM INFORMATION & COMPUTATION》 (Quantum Inf. Comput.)

年 卷 期：2016年第16卷第3-4期

页      面：237-250页

核心收录：

学科分类：07[理学] 070201[理学-理论物理] 0702[理学-物理学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Basic Science Research Program through the National Research Foundation of Korea (NRF) - Ministry of Education [2014R1A6A3A01009674] MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) [IITP-2015-R0992-15-1017] ICT R&D program of MSIP/IITP [R0190-15-2030] 

主　　题：graph code graph state local complementation stabilizer formalism 

摘      要：A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a superposition of logical qubits of the related graph code. By using the relation, we first discuss that a local complementation which has been used for a graph state can be useful for searching locally equivalent stabilizer codes, and second provide a method to find a stabilizer group of a graph code.