Matching Tag: quantum-query-complexity
For each n n n , let X = F 2 n X=\mathbb{F}_2^n X = F 2 n and N = ∣ X ∣ = 2 n N=|X|=2^n N = ∣ X ∣ = 2 n . Let r = ( r x ) x ∈ X r=(r_x)_{x\in X} r = ( r x ) x ∈ X be a fixed table of n n n -bit strings, and define f h , r : X → X × X × { 0 , 1 } n f_{h,r}:X\to X\times X\times\{0,1\}^n f h , r : X → X × X × { 0 , 1 } n by…
Let B N B_N B N be the hyperoctahedral group and let V = V ( ( N − 1 ) , ( 1 ) ) V=V_{((N-1),(1))} V = V (( N − 1 ) , ( 1 )) be its natural representation. Let T ( B N , V ) T(B_N,V) T ( B N , V ) be the tensor product graph, let I ( V ) I(V) I ( V ) denote its identity represe…
Let p : { − 1 , 1 } n → R p:\{-1,1\}^n\to\mathbb{R} p : { − 1 , 1 } n → R be a polynomial of degree at most d d d . Its Fourier completely bounded d d d -norm is denoted by ∥ p ∥ fcb , d \|p\|_{\operatorname{fcb},d} ∥ p ∥ fcb , d , and…