pith. sign in

Pranab Sen

Identifiers

  • name variant Pranab Sen 0.60 · backfill

Papers (21)

  1. Efficiently estimating average fidelity of a quantum logic gate using few classical random bits quant-ph · 2019 · author #2
  2. Efficient quantum tensor product expanders and unitary t-designs via the zigzag product quant-ph · 2018 · author #1
  3. A quantum Johnson-Lindenstrauss lemma via unitary t-designs quant-ph · 2018 · author #1
  4. One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma quant-ph · 2017 · author #2
  5. One-shot Marton inner bound for classical-quantum broadcast channel cs.IT · 2014 · author #2
  6. Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding quant-ph · 2011 · author #1
  7. Quantum interference channels quant-ph · 2011 · author #4
  8. Classical communication over a quantum interference channel quant-ph · 2011 · author #4
  9. From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking quant-ph · 2010 · author #3
  10. Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity cs.DC · 2008 · author #2
  11. A theorem about relative entropy of quantum states with an application to privacy in quantum communication quant-ph · 2007 · author #3
  12. Random measurement bases, quantum state distinction and applications to the hidden subgroup problem quant-ph · 2005 · author #1
  13. A note on the power of quantum fingerprinting quant-ph · 2005 · author #2
  14. On divergence, relative entropy and the substate property quant-ph · 2005 · author #3
  15. Lower bounds for predecessor searching in the cell probe model cs.CC · 2003 · author #1
  16. A direct sum theorem in communication complexity via message compression cs.CC · 2003 · author #3
  17. A lower bound for bounded round quantum communication complexity of set disjointness quant-ph · 2003 · author #3
  18. Quantum testers for hidden group properties quant-ph · 2002 · author #4
  19. Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem cs.DM · 2001 · author #2
  20. Lower bounds in the quantum cell probe model quant-ph · 2001 · author #1
  21. The Quantum Complexity of Set Membership quant-ph · 2000 · author #2

Mentions

  • 1410.3248 #2 · backfill · confidence 0.70 Pranab Sen
  • 1109.0802 #1 · backfill · confidence 0.70 Pranab Sen
  • 1102.2955 #4 · backfill · confidence 0.70 Pranab Sen
  • 1102.2624 #4 · backfill · confidence 0.70 Pranab Sen
  • 1010.3007 #3 · backfill · confidence 0.70 Pranab Sen
  • 0807.1267 #2 · backfill · confidence 0.70 Pranab Sen
  • 0705.2437 #3 · backfill · confidence 0.70 Pranab Sen

Frequent Coauthors