Classical simulation of quantum circuits by half Gauss sums

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

Quantum Computability
Title not available (Why is that?)
The Heisenberg representation of quantum computers
On counting homomorphisms to directed acyclic graphs
The Complexity of Weighted Boolean #CSP
The Complexity of Enumeration and Reliability Problems
Quantum computations: algorithms and error correction
A Complexity Dichotomy for Partition Functions with Mixed Signs
Automata, Languages and Programming
The Complexity of the Counting Constraint Satisfaction Problem
Complexity of generalized satisfiability counting problems
Title not available (Why is that?)
Title not available (Why is that?)
On tractable exponential sums
The complexity of complex weighted Boolean \#CSP
Title not available (Why is that?)
Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
Reflection positive doubles
Planar para algebras, reflection positivity
Holographic software for quantum networks
Incomplete higher-order Gauss sums
Incomplete Gauss sums
Half Gauss sums
Exponential sums and coding theory: A review
Title not available (Why is that?)
Title not available (Why is that?)
An ideal characterization of the Clifford operators
Constructive simulation and topological design of protocols
Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$
Title not available (Why is that?)
Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
Title not available (Why is that?)
Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?

Cited In (5)

Complexity of quantum circuits via sensitivity, magic, and coherence
Classical simulation of quantum circuits by half Gauss sums
Classically simulating quantum circuits with local depolarizing noise
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Matchgates and classical simulation of quantum circuits

This page was built for publication: Classical simulation of quantum circuits by half Gauss sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113488)