pith. sign in

Mario Szegedy

Identifiers

  • name variant Mario Szegedy 0.60 · backfill

Papers (15)

  1. Explicit lower bounds on strong simulation of quantum circuits in terms of $T$-gate count quant-ph · 2019 · author #3
  2. Explicit lower bounds on strong quantum simulation quant-ph · 2018 · author #3
  3. A Graph-based Model for GPU Caching Problems cs.DC · 2016 · author #5
  4. An $O(n^{0.4732})$ upper bound on the complexity of the GKS communication game cs.CC · 2015 · author #1
  5. Impossibility Theorems and the Universal Algebraic Toolkit cs.CC · 2015 · author #1
  6. Local tests of global entanglement and a counterexample to the generalized area law quant-ph · 2014 · author #5
  7. A simplified proof of a Lee-Yang type theorem math-ph · 2014 · author #2
  8. The Garden Hose Complexity for the Equality Function quant-ph · 2013 · author #2
  9. Classical simulation of entanglement swapping with bounded communication quant-ph · 2012 · author #8
  10. Quantum query complexity of state conversion quant-ph · 2010 · author #5
  11. On the variance of subset sum estimation cs.DS · 2007 · author #1
  12. The quantum adversary method and classical formula size lower bounds quant-ph · 2005 · author #3
  13. Spectra of Quantized Walks and a $\sqrt{\delta\epsilon}$ rule quant-ph · 2004 · author #1
  14. Quantum Algorithms for the Triangle Problem quant-ph · 2003 · author #3
  15. On the Quantum Query Complexity of Detecting Triangles in Graphs quant-ph · 2003 · author #1

Mentions

  • 1410.0951 #5 · backfill · confidence 0.70 Mario Szegedy
  • 1407.5991 #2 · backfill · confidence 0.70 Mario Szegedy
  • 1312.7222 #2 · backfill · confidence 0.70 Mario Szegedy
  • 1203.0445 #8 · backfill · confidence 0.70 Mario Szegedy
  • 1011.3020 #5 · backfill · confidence 0.70 Mario Szegedy

Frequent Coauthors