Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (Q2969880): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2951887194 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58478259 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1607.08473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-optical proof that the permanent is # <b>P</b> -hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporally unstructured quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Mechanics of Dimers on a Plane Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer problem in statistical mechanics-an exact result / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3172431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computing and quadratically signed weight enumerators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial quantum algorithm for approximating the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating Quantum Computation by Contracting Tensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365127 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:34, 13 July 2024

scientific article
Language Label Description Also known as
English
Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$
scientific article

    Statements

    Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (English)
    0 references
    0 references
    23 March 2017
    0 references
    quantum computing
    0 references
    quantum circuits
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers