Classical Simulation of Quantum Circuits by Half Gauss Sums
Abstract We give an efficient algorithm to evaluate a certain class of exponential sums, namely the periodic, quadratic, multivariate half Gauss sums. We show that these exponential sums become $$\#{\mathsf {P}}$$ # P -hard to compute when we omit either the periodicity or quadraticity condition. We...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg,
2022-02-23T14:05:05Z.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Summary: | Abstract We give an efficient algorithm to evaluate a certain class of exponential sums, namely the periodic, quadratic, multivariate half Gauss sums. We show that these exponential sums become $$\#{\mathsf {P}}$$ # P -hard to compute when we omit either the periodicity or quadraticity condition. We apply our results about these exponential sums to the classical simulation of quantum circuits, and give an alternative proof of the Gottesman-Knill theorem. We also explore a connection between these exponential sums and the Holant framework. In particular, we generalize the existing definition of affine signatures to arbitrary dimensions, and use our results about half Gauss sums to show that the Holant problem for the set of affine signatures is tractable. |
|---|