Classical Simulation of Quantum Circuits by Half Gauss Sums
- 31 January 2022
- journal article
- research article
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 390 (2) , 471-500
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- John Templeton Foundation (TRT0159)
- National Science Foundation (CCF-1729369)
This publication has 32 references indexed in Scilit:
- The Complexity of Weighted Boolean #CSPSIAM Journal on Computing, 2009
- On counting homomorphisms to directed acyclic graphsJournal of the ACM, 2007
- Incomplete higher-order Gauss sumsJournal of Mathematical Analysis and Applications, 2003
- Quantum computations: algorithms and error correctionRussian Mathematical Surveys, 1997
- Quantum ComputabilitySIAM Journal on Computing, 1997
- Complexity of Generalized Satisfiability Counting ProblemsInformation and Computation, 1996
- Elementary gates for quantum computationPhysical Review A, 1995
- Half Gauss sumsMathematische Annalen, 1980
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- Incomplete Gauss sumsMathematika, 1976