REVIEW 2 cited by
Quantum computing and polynomial equations over the finite field Z₂
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum computing and polynomial equations over the finite field Z₂
read the original abstract
What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field Z_2. This connection allows simple proofs to be given for two known relationships between quantum and classical complexity classes.
Forward citations
Cited by 2 Pith papers
-
Bra-ket entanglement, an indicator bridging entanglement, magic, and coherence
Bra-ket entanglement indicates a shift from coherence-dominated to magic-dominated entanglement generation as its value increases.
-
Parallelizable Exact Synthesis of Quantum Circuits via Semi-Tensor Product
STP factorization of undirected CNOT topologies yields a parallel exact synthesizer that is often much faster than SAT on small instances and about 1.9× faster median in a QASMBench peephole workflow.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.