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 |