#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2014

2017

- This year (3)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Random Access Codes is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an n-bit string x, and wishes to encode x into a quantum state ρx, such that Bob, when receiving the state ρx, can choose any bit i ∈ [n] and recover the input bit xi with high probability. Here we… (More)

- Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay
- Electronic Colloquium on Computational Complexity
- 2017

We show that for any (partial) query function f : {0, 1} → {0, 1}, the randomized communication complexity of f composed with Indexm (with m = poly(n)) is at least the randomized query complexity of f times log n. Here Indexm : [m] × {0, 1} → {0, 1} is defined as Indexm(x, y) = yx (the xth bit of y). Our proof follows on the lines of Raz and Mckenzie [RM99]… (More)

- Anurag Anshu, Dmitry Gavinsky, +5 authors Swagato Sanyal
- Electronic Colloquium on Computational Complexity
- 2017

Let the randomized query complexity of a relation for error probability ǫ be denoted by Rǫ(·). We prove that for any relation f ⊆ {0, 1} × R and Boolean function g : {0, 1} → {0, 1}, R1/3(f ◦g ) = Ω(R4/9(f) ·R1/2−1/n4(g)), where f ◦g n is the relation obtained by composing f and g. We also show that R1/3 (

- Dmitry Gavinsky, Rahul Jain, +5 authors Jevgenijs Vihrovs
- Electronic Colloquium on Computational Complexity
- 2017

Let f : {0, 1} → {0, 1} be a Boolean function. The certificate complexity C(f) is a complexity measure that is quadratically tight for the zero-error randomized query complexity R0(f): C(f) ≤ R0(f) ≤ C(f) . In this paper we study a new complexity measure that we call expectational certificate complexity EC(f), which is also a quadratically tight bound on… (More)

- ‹
- 1
- ›