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: | Bu, Kaifeng (Author), Koh, Dax E. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg,
2022-02-23T14:05:05Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
On the classical Gauss sum and the recursive properties
by: Hui Bai, et al.
Published: (2018-10-01) -
A Note on the Classical Gauss Sums
by: Tingting Wang, et al.
Published: (2018-12-01) -
On Classical Gauss Sums and Some of Their Properties
by: Li Chen
Published: (2018-11-01) -
Classical simulation complexity of restricted models of quantum computation
by: Koh, Dax Enshan.
Published: (2019) -
On the fourth-order linear recurrence formula related to classical Gauss sums
by: Zhuoyu Chen, et al.
Published: (2017-10-01)