Classical simulation of quantum circuits by half Gauss sums

DOI10.1007/s00220-022-04320-1OpenAlexW2902892742WikidataQ114230926 ScholiaQ114230926MaRDI QIDQ2113488

Dax Enshan Koh, Kaifeng Bu

Publication date: 14 March 2022

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.00224

Mathematics Subject Classification ID

Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Finite fields and commutative rings (number-theoretic aspects) (11Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of complex weighted Boolean \#CSP
• Reflection positive doubles
• Planar para algebras, reflection positivity
• Half Gauss sums
• Exponential sums and coding theory: A review
• Incomplete higher-order Gauss sums
• Holographic software for quantum networks
• Complexity of generalized satisfiability counting problems
• An ideal characterization of the Clifford operators
• Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$
• The Complexity of the Counting Constraint Satisfaction Problem
• On counting homomorphisms to directed acyclic graphs
• On Tractable Exponential Sums
• The Complexity of Weighted Boolean #CSP
• The Complexity of Enumeration and Reliability Problems
• Incomplete Gauss sums
• Quantum computations: algorithms and error correction
• Quantum Computability
• A Complexity Dichotomy for Partition Functions with Mixed Signs
• Automata, Languages and Programming
• Constructive simulation and topological design of protocols
• Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?