Quantum Query Algorithms are Completely Bounded Forms. (Q4993266): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Quantum Query Algorithms are Completely Bounded Forms.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forrelation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials, quantum query complexity, and Grothendieck's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in query complexity using cheat sheets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds for the collision and the element distinctness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Cut-Norm via Grothendieck's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by quantum arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial degree vs. quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Walk Algorithm for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in Query Complexity Based on Pointer Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / 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: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grothendieck Constant is Strictly Smaller than Krivine's Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Schatten spaces endowed with the Schur product are \(Q\)-algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit lower and upper bounds on the entangled value of multiplayer XOR games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of completely bounded multilinear operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Notes: An Elementary Proof of the Russo-Dye Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3239535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3605723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query Complexity in Expectation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grothendieck-Type Inequalities in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Query Complexity of State Conversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search via Quantum Walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonadaptive quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “maximal” tensor product of operator spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey on nonlocal games and operator space theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilinear maps and tensor norms on operator systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded violation of tripartite Bell inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grothendieck’s Theorem, past and present / 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: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely Bounded Multilinear Maps and Grothendieck's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5388761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum analogues of the Bell inequalities. The case of two spatially separated domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Quantum Query and Communication Complexities / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/8338/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971753965 / rank
 
Normal rank
Property / title
 
Quantum Query Algorithms are Completely Bounded Forms. (English)
Property / title: Quantum Query Algorithms are Completely Bounded Forms. (English) / rank
 
Normal rank

Latest revision as of 09:05, 30 July 2024

scientific article; zbMATH DE number 7359340
Language Label Description Also known as
English
Quantum Query Algorithms are Completely Bounded Forms.
scientific article; zbMATH DE number 7359340

    Statements

    0 references
    0 references
    0 references
    15 June 2021
    0 references
    quantum query algorithms
    0 references
    operator space theory
    0 references
    polynomial method
    0 references
    approximate degree.
    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
    Quantum Query Algorithms are Completely Bounded Forms. (English)
    0 references

    Identifiers