2023/11/01 by Andrey Boris Khesin, Kui Ren · 1 voice · 1 citation
Computer Science · #Computability, Logic, AI Algorithms #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography
paper · doi:10.26421/qic23.13-14-5
openalex created_date 2021/08/16 · openalex publication_date 2023/11/01 · openalex updated_date 2026/07/28
We present an algorithm for efficiently simulating a quantum circuit in the graph formalism. In the graph formalism, we present states as a linear combination of graphs with Clifford operations on their vertices. We show how a \calC3 gate such as the Toffoli gate or \fracπ8 gate acting on a stabilizer state splits it into two stabilizer states. We also 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.