{"id":{"repo_id":"calgary","oai_identifier":"oai:ucalgary.scholaris.ca:1880/114283"},"canonical_url":"https://search.dev.ndltd.org/etd/calgary/oai:ucalgary.scholaris.ca:1880/114283","repository":{"repo_id":"calgary","name":"University of Calgary","base_url":"https://ucalgary.scholaris.ca/server/oai/request"},"display":{"title":"Graph Representation of Topological Stabilizer States","abstract":"Topological quantum states, especially these in topological stabilizer quantum error correction codes, are currently the focus of intense activity because of their potential for fault-tolerant operations. While every stabilizer state maps to a graph state under local Clifford operations, the graphs associated with topological stabilizer codes remain unknown. In this thesis, I show that the toric code graph is composed of only two kinds of subgraphs: star graphs and half graphs. The topological order of the toric code is identified with the existence of multiple star graphs, which reveals a nice connection between repetition codes and the toric code. The graph structure readily yields a log-depth and a constant-depth (including ancillae) circuit for state preparation. Next, I derive the necessary and sufficient conditions for a family of graph states to be in TQO-1, a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits. Using these criteria, I consider a number of specific graph families, including the star and complete graphs, and the line graphs of complete and completely bipartite graphs, and discuss which are topologically ordered and how to construct the codewords. The formalism is then employed to construct several codes with macroscopic distance, including a three-dimensional topological code generated by local stabilizers that also has a macroscopic number of encoded logical qubits. Last, the connection between the characterization of topological order using graph theory and the hierarchy of topological order is analyzed.","abstract_html":"Topological quantum states, especially these in topological stabilizer quantum error correction codes, are currently the focus of intense activity because of their potential for fault-tolerant operations. While every stabilizer state maps to a graph state under local Clifford operations, the graphs associated with topological stabilizer codes remain unknown. In this thesis, I show that the toric code graph is composed of only two kinds of subgraphs: star graphs and half graphs. The topological order of the toric code is identified with the existence of multiple star graphs, which reveals a nice connection between repetition codes and the toric code. The graph structure readily yields a log-depth and a constant-depth (including ancillae) circuit for state preparation. Next, I derive the necessary and sufficient conditions for a family of graph states to be in TQO-1, a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits. Using these criteria, I consider a number of specific graph families, including the star and complete graphs, and the line graphs of complete and completely bipartite graphs, and discuss which are topologically ordered and how to construct the codewords. The formalism is then employed to construct several codes with macroscopic distance, including a three-dimensional topological code generated by local stabilizers that also has a macroscopic number of encoded logical qubits. Last, the connection between the characterization of topological order using graph theory and the hierarchy of topological order is analyzed.","abstract_has_math":false,"creators":["Liao, Pengcheng"],"institution":"Science","degree_name":"Master of Science (MSc)","degree_level":null,"degree_discipline":"Physics & Astronomy","degree_department":null,"school":null,"contributors":[],"advisors":["Feder, David","Sanders, Barry"],"committee_chairs":[],"committee_members":["Barzanjeh, Shabir","Simon, Christoph","Høyer, Peter"],"year":2022,"date_issued":"2022-01","date_published":"2022-01","updated_at":"2026-07-24T01:30:13Z","subjects":["topological order","graph states","quantum error correction"],"languages":["eng"],"rights":["University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["http://dx.doi.org/10.11575/PRISM/39498"],"render_values":[{"text":"http://dx.doi.org/10.11575/PRISM/39498","href":"http://dx.doi.org/10.11575/PRISM/39498","code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/1880/114283","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Feder, David","Sanders, Barry"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Barzanjeh, Shabir","Simon, Christoph","Høyer, Peter"]},{"key":"dc:creator","label":"Author","values":["Liao, Pengcheng"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-02"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-01-17T16:59:34Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-01-17T16:59:34Z"]},{"key":"dc:date.issued","label":"Date","values":["2022-01"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Calgary"]},{"key":"dc:type","label":"Dc Type","values":["master thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Physics & Astronomy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MSc)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Calgary"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["topological order","graph states","quantum error correction"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["http://dx.doi.org/10.11575/PRISM/39498"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1880/114283"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Topological quantum states, especially these in topological stabilizer quantum error correction codes, are currently the focus of intense activity because of their potential for fault-tolerant operations. While every stabilizer state maps to a graph state under local Clifford operations, the graphs associated with topological stabilizer codes remain unknown. In this thesis, I show that the toric code graph is composed of only two kinds of subgraphs: star graphs and half graphs. The topological order of the toric code is identified with the existence of multiple star graphs, which reveals a nice connection between repetition codes and the toric code. The graph structure readily yields a log-depth and a constant-depth (including ancillae) circuit for state preparation. Next, I derive the necessary and sufficient conditions for a family of graph states to be in TQO-1, a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits. Using these criteria, I consider a number of specific graph families, including the star and complete graphs, and the line graphs of complete and completely bipartite graphs, and discuss which are topologically ordered and how to construct the codewords. The formalism is then employed to construct several codes with macroscopic distance, including a three-dimensional topological code generated by local stabilizers that also has a macroscopic number of encoded logical qubits. Last, the connection between the characterization of topological order using graph theory and the hierarchy of topological order is analyzed."]},{"key":"dc:title","label":"Title","values":["Graph Representation of Topological Stabilizer States"]}]}],"canonical_facts":{"dc:contributor.advisor":["Feder, David","Sanders, Barry"],"dc:contributor.committeemember":["Barzanjeh, Shabir","Simon, Christoph","Høyer, Peter"],"dc:creator":["Liao, Pengcheng"],"dc:date":["2022-02"],"dc:date.accessioned":["2022-01-17T16:59:34Z"],"dc:date.available":["2022-01-17T16:59:34Z"],"dc:date.issued":["2022-01"],"dc:description.abstract":["Topological quantum states, especially these in topological stabilizer quantum error correction codes, are currently the focus of intense activity because of their potential for fault-tolerant operations. While every stabilizer state maps to a graph state under local Clifford operations, the graphs associated with topological stabilizer codes remain unknown. In this thesis, I show that the toric code graph is composed of only two kinds of subgraphs: star graphs and half graphs. The topological order of the toric code is identified with the existence of multiple star graphs, which reveals a nice connection between repetition codes and the toric code. The graph structure readily yields a log-depth and a constant-depth (including ancillae) circuit for state preparation. Next, I derive the necessary and sufficient conditions for a family of graph states to be in TQO-1, a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits. Using these criteria, I consider a number of specific graph families, including the star and complete graphs, and the line graphs of complete and completely bipartite graphs, and discuss which are topologically ordered and how to construct the codewords. The formalism is then employed to construct several codes with macroscopic distance, including a three-dimensional topological code generated by local stabilizers that also has a macroscopic number of encoded logical qubits. Last, the connection between the characterization of topological order using graph theory and the hierarchy of topological order is analyzed."],"dc:identifier.doi":["http://dx.doi.org/10.11575/PRISM/39498"],"dc:identifier.uri":["http://hdl.handle.net/1880/114283"],"dc:language.iso":["eng"],"dc:publisher.institution":["University of Calgary"],"dc:rights":["University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission."],"dc:subject":["topological order","graph states","quantum error correction"],"dc:title":["Graph Representation of Topological Stabilizer States"],"dc:type":["master thesis"],"thesis:degree_discipline":["Physics & Astronomy"],"thesis:degree_name":["Master of Science (MSc)"],"thesis:institution_name":["University of Calgary"]},"updated_at":"2026-07-24T01:30:13Z"}