Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems
arXiv:1409.3208
Abstract
[1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems with a standard basis labeled by the elements of a finite Abelian group . Normalizer gates implement operations associated with the group and can be of three types: quantum Fourier transforms, group automorphism gates and quadratic phase gates. In this work, we extend the normalizer formalism [1,2] to infinite dimensions, by allowing normalizer gates to act on systems of the form : each factor has a standard basis labeled by , and a Fourier basis labeled by , elements of the circle group . Normalizer circuits become hybrid quantum circuits acting both on continuous- and discrete-variable systems. We show that infinite-dimensional normalizer circuits can be efficiently simulated classically with a generalized for Hilbert spaces associated with groups of the form . We develop new techniques to track stabilizer-groups based on normal forms for group automorphisms and quadratic functions. We use our normal forms to reduce the problem of simulating normalizer circuits to that of finding general solutions of systems of mixed real-integer linear equations [3] and exploit this fact to devise a robust simulation algorithm: the latter remains efficient even in pathological cases where stabilizer groups become infinite, uncountable and non-compact. The techniques developed in this paper might find applications in the study of fault-tolerant quantum computation with superconducting qubits [4,5].
arXiv comment54 pages + appendices. The discussion has been extended in this version
References in corpus (31)
- Quantum information with continuous variables
- Encoding a qubit in an oscillator
- Improved Simulation of Stabilizer Circuits
- Quantum Computing with Very Noisy Devices
- Quantum computation over continuous variables
- Universal Quantum Computation with Continuous-Variable Cluster States
- Positive Wigner functions render classical simulation of quantum computation efficient
- Efficient Classical Simulation of Continuous Variable Quantum Information Processes
- Overhead and noise threshold of fault-tolerant quantum error correction
- Negative Quasi-Probability as a Resource for Quantum Computation
- Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
- Randomizing quantum states: Constructions and applications
- Quantum Computing with Continuous-Variable Clusters
- Cluster States for Continuous-Variable Multipartite Entanglement
- An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
- Bell Inequalities for Graph States
- Error correction for continuous quantum variables
- Protected gates for superconducting qubits
- The role of the rigged Hilbert space in Quantum Mechanics
- Analog quantum error correction
- Efficient Classical Simulation of Optical Quantum Circuits
- The Hidden Subgroup Problem - Review and Open Problems
- Orbital angular momentum in phase space
- Wigner function for a particle in an infinite lattice
- A monomial matrix formalism to describe quantum many-body states
- Non-negative Wigner functions for orbital angular momentum states
- Stabilizer Codes for Continuous-variable Quantum Error Correction
- Commuting quantum circuits: efficient classical simulations versus hardness results
- The computational power of normalizer circuits over black-box groups
- Decomposition of phase space and classification of Heisenberg groups
- Software Pauli Tracking for Quantum Computation