Classical simulation of quantum circuits by half Gauss sums

DOI10.1007/S00220-022-04320-1MaRDI QIDQ2113488zbMATH OpenOpenAlexWikidataFDO

Authors Kaifeng Bu, Dax Enshan Koh

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)

Recommendations

• Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
• Clifford gates in the Holant framework
• Simulating quantum computers with probabilistic methods
• Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
• Matchgates and classical simulation of quantum circuits

Cites work

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

Cited in

(5)

• Complexity of quantum circuits via sensitivity, magic, and coherence
• Classically simulating quantum circuits with local depolarizing noise
• Classical simulation of quantum circuits by half Gauss sums
• 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)