Classical simulations of Abelian-group normalizer circuits with intermediate measurements
Juan Bermejo-Vega, Maarten Van den Nest

TL;DR
This paper demonstrates that normalizer circuits over finite Abelian groups, even with intermediate measurements and adaptive operations, can be efficiently simulated classically, extending the Gottesman-Knill theorem beyond qubits.
Contribution
It generalizes classical simulation techniques for quantum circuits to include Abelian-group normalizer circuits with intermediate measurements and adaptivity.
Findings
Efficient classical algorithms for sampling measurement distributions.
Efficient computation of state amplitudes during normalizer circuits.
Generalization of the stabilizer formalism for arbitrary finite Abelian groups.
Abstract
Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits [arXiv:1201.4867]: a normalizer circuit over a finite Abelian group is composed of the quantum Fourier transform (QFT) over G, together with gates which compute quadratic functions and automorphisms. In [arXiv:1201.4867] it was shown that every normalizer circuit can be simulated efficiently classically. This result provides a nontrivial example of a family of quantum circuits that cannot yield exponential speed-ups in spite of usage of the QFT, the latter being a central quantum algorithmic primitive. Here we extend the aforementioned result in several ways. Most importantly, we show that normalizer circuits supplemented with intermediate measurements can also be simulated efficiently classically, even when the computation proceeds adaptively. This yields a generalization of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
