Efficient classical simulation of quantum computation beyond Wigner positivity

2024/07/14 by Michael Zurel, Zurel, Michael, Arne Heimendahl +1 · 3 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2407.10349

openalex publication_date 2024/07/14 · openalex created_date 2024/07/17 · openalex updated_date 2026/08/01

Abstract

We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits. By introducing new CNC-type phase space point operators, we construct a quasiprobability representation for quantum computation which is covariant with respect to the Clifford group and positivity preserving under Pauli measurements, and whose nonnegative sector strictly contains the subtheory of quantum theory described by nonnegative Wigner functions. This allows for a broader class of magic state quantum circuits to be efficiently classically simulated than those covered by the stabilizer formalism and Wigner function methods.

Cited by

• Further improvements to stabilizer simulation theory: classical rewriting of CSS-preserving stabilizer circuits, quadratic form expansions of stabilizer operations, and framed hidden variable models
• Polyhedral Classical Simulators for Quantum Computation
• Kirkwood-Dirac Nonpositivity is a Necessary Resource for Quantum Computing

Related

• Simulation of quantum computation with magic states via Jordan-Wigner transformations
• Qudit Quantum Programming with Projective Cliffords
• Kirkwood-Dirac Nonpositivity is a Necessary Resource for Quantum Computing
• Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
• Phase space tableau simulation for quantum computation