The following pages link to Anurag Anshu (Q298944):
Displaying 12 items.
- A lower bound on the crossing number of uniform hypergraphs (Q298946) (← links)
- Entanglement subvolume law for 2D frustration-free spin systems (Q2149071) (← links)
- On the rectilinear crossing number of complete uniform hypergraphs (Q2362105) (← links)
- New One Shot Quantum Protocols With Application to Communication Complexity (Q2976478) (← links)
- (Q5111154) (← links)
- A Composition Theorem for Randomized Query Complexity (Q5136299) (← links)
- Lower Bound on Expected Communication Cost of Quantum Huffman Coding (Q5278344) (← links)
- (Q5874391) (← links)
- On query-to-communication lifting for adversary bounds (Q6115393) (← links)
- (Q6126227) (← links)
- Improved thermal area law and quasi-linear time algorithm for quantum Gibbs states (Q6345593) (← links)
- Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations (Q6409884) (← links)
