Approximate span programs (Q2414858): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Efficient Quantum Walks for 3-Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Span programs for functions with constant-sized 1-certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Query Complexity of State Conversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Span-program-based quantum algorithm for evaluating formulas / rank
 
Normal rank

Revision as of 07:04, 19 July 2024

scientific article
Language Label Description Also known as
English
Approximate span programs
scientific article

    Statements

    Identifiers