A linearized stabilizer formalism for systems of finite dimension

Abstract

The stabilizer formalism is a scheme, generalizing well-known techniques developed by Gottesman [quant-ph/9705052] in the case of qubits, to efficiently simulate a class of transformations ("stabilizer circuits", which include the quantum Fourier transform and highly entangling operations) on standard basis states of d-dimensional qudits. To determine the state of a simulated system, existing treatments involve the computation of cumulative phase factors which involve quadratic dependencies. We present a simple formalism in which Pauli operators are represented using displacement operators in discrete phase space, expressing the evolution of the state via linear transformations modulo D <= 2d. We thus obtain a simple proof that simulating stabilizer circuits on n qudits, involving any constant number of measurement rounds, is complete for the complexity class coMod_{d}L and may be simulated by O(log(n)^2)-depth boolean circuits for any constant d >= 2.

25 pages, 3 figures. Reorganized to collect complexity results; some corrections and elaborations of technical results. Differs slightly from the version to be published (fixed typos, changes of wording to accommodate page breaks for a different article format). To appear as QIC vol 13 (2013), pp.73--115

References in corpus (3)

• Standard Form of Qudit Stabilizer Groups
• Location of quantum information in additive graph codes
• On the complexity of solving linear congruences and computing nullspaces modulo a constant

Cited by in corpus (19)

• Enhanced fault-tolerant quantum computing in $d$-level systems
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Contextuality as a resource for measurement-based quantum computation beyond qubits
• Stabilizer information inequalities from phase space distributions
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
• Low rank matrix recovery from Clifford orbits
• Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
• The vacuum provides quantum advantage to otherwise simulatable architectures
• A Graphical Calculus for Lagrangian Relations
• Quantum linear network coding for entanglement distribution in restricted architectures
• Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
• Normalizer Circuits and Quantum Computation
• Abelian Hypergroups and Quantum Computation
• No quantum solutions to linear constraint systems in odd dimension from Pauli group and diagonal Cliffords
• Bounding the quantum capacity with flagged extensions
• The Parity Flow Formalism: Tracking Quantum Information Throughout Computation
• Characterization of non-adaptive Clifford channels
• Qudit Noisy Stabilizer Formalism
• Blind quantum computing with different qudit resource state architectures