On Classical Simulation of Quantum Circuits Composed of Clifford Gates

Abstract

The Gottesman-Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby allowing for a structured simulation process using classical computations. In this work, we break down the step-by-step procedure of the Gottesman-Knill theorem in a beginner-friendly manner, leveraging concepts such as matrix products, tensor products, commutation, anti-commutation, eigenvalues, and eigenvectors of quantum mechanical operators. Through detailed examples illustrating superposition and entanglement phenomena, we aim to provide a clear understanding of the classical simulation of Clifford gate-based quantum circuits. While we do not provide a formal proof of the theorem, we offer intuitive physical insights at each stage where necessary, empowering readers to grasp the fundamental principles underpinning this intriguing aspect of quantum computation.

arXiv commentPublisher version: http://doi.org/10.12743/quanta.v13i1.265

References in corpus (8)

• Improved Simulation of Stabilizer Circuits
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Fast simulation of stabilizer circuits using a graph state representation
• Experimental demonstration of continuous quantum error correction
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Clifford algebras and universal sets of quantum gates
• Clifford algebras, Spin groups and qubit trees
• Linear Cross Entropy Benchmarking with Clifford Circuits