EXTENDING THE GRAPH FORMALISM TO HIGHER-ORDER GATES

被引：0
|
作者：
Khesin A. [1 ]
Ren K. [1 ]
机构：
[1] MIT, 77 Massachusetts Ave, Cambridge, 02139, MA
来源：
Quantum Information and Computation | 2023年 / 23卷 / 13-14期
关键词：
clifford hierarchy; clifford states; graph state; pauli; stabilizer rank;
D O I：
10.26421/QIC23.13-14-5
中图分类号：
学科分类号：
摘要：
We present an algorithm for efficiently simulating a quantum circuit in the graph for-malism. In the graph formalism, we present states as a linear combination of graphs with Clifford operations on their vertices. We show how a C3 gate such as the Toffoli gate orπ gate acting on a stabilizer state splits it into two stabilizer states. We also 8 describe conditions for merging two stabilizer states into one. We discuss applications of our algorithm to circuit identities and finding low stabilizer rank presentations of magic states. © Rinton Press.
引用
收藏
页码：1128 / 1141
页数：13
相关论文
共 50 条
  • [1] A KERNEL SPECIFICATION FORMALISM WITH HIGHER-ORDER PARAMETERIZATION
    SANNELLA, D
    TARLECKI, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 534 : 274 - 296
  • [2] On Higher-Order Wave Equations in GUP Formalism
    Zarrinkamar, S.
    Panahi, H.
    Khorram-Hosseini, S. A.
    [J]. FEW-BODY SYSTEMS, 2018, 59 (01)
  • [3] Pfaffian Formalism for Higher-Order Topological Insulators
    Li, Heqiu
    Sun, Kai
    [J]. PHYSICAL REVIEW LETTERS, 2020, 124 (03)
  • [4] On Higher-Order Wave Equations in GUP Formalism
    S. Zarrinkamar
    H. Panahi
    S. A. Khorram-Hosseini
    [J]. Few-Body Systems, 2018, 59
  • [5] EXTENDING THE IMAGE METHOD TO HIGHER-ORDER REFLECTIONS
    KRISTIANSEN, UR
    KROKSTAD, A
    FOLLESTAD, T
    [J]. APPLIED ACOUSTICS, 1993, 38 (2-4) : 195 - 206
  • [6] ON THE HIGHER-ORDER EDGE TOUGHNESS OF A GRAPH
    CHEN, CC
    KOH, KM
    PENG, YH
    [J]. DISCRETE MATHEMATICS, 1993, 111 (1-3) : 113 - 123
  • [7] Extending SMT Solvers to Higher-Order Logic
    Barbosa, Haniel
    Reynolds, Andrew
    El Ouraoui, Daniel
    Tinelli, Cesare
    Barrett, Clark
    [J]. AUTOMATED DEDUCTION, CADE 27, 2019, 11716 : 35 - 54
  • [8] A Higher-Order Calculus for Graph Transformation
    Department of Computer Science, King's College, Strand, London WC2R 2LS, United Kingdom
    不详
    [J]. Electron. Notes Theor. Comput. Sci., 2007, 1 SPEC. ISS. (45-58):
  • [9] Local Higher-Order Graph Clustering
    Yin, Hao
    Benson, Austin R.
    Leskovec, Jure
    Gleich, David F.
    [J]. KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, : 555 - 564
  • [10] Second class constraints in a higher-order Lagrangian formalism
    Batalin, IA
    Bering, K
    Damgaard, PH
    [J]. PHYSICS LETTERS B, 1997, 408 (1-4) : 235 - 240
12345