Jiahui Liu

@jiahuiteddy

PhD student in Theoretical CS at UT Austin.

USA
Vrijeme pridruživanja: lipanj 2019.

Tweetovi

Blokirali ste korisnika/cu @jiahuiteddy

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @jiahuiteddy

  1. proslijedio/la je Tweet
    1. velj

    Videos of talks now available for the quantum wave in computing boot camp

    Poništi
  2. proslijedio/la je Tweet
    29. sij

    Can graph properties have exponential quantum speedup?

    Poništi
  3. proslijedio/la je Tweet
    21. sij

    Slides and videos for the talks are now online at

    Poništi
  4. proslijedio/la je Tweet
    26. sij
    Poništi
  5. proslijedio/la je Tweet
    28. sij

    omg, this was the other problem scott suggested to me in undergrad (alongside quantum recommendation systems)! from abstract: "... this means that no graph property testing problems can have super-polynomial quantum speedups"

    Poništi
  6. proslijedio/la je Tweet
    24. sij
    Poništi
  7. proslijedio/la je Tweet
    15. sij

    It’s still hard for me to believe that such a result could be true. Scott Aaronson wrote a nice post about why this result is so surprising (assuming no error is found).

    Poništi
  8. proslijedio/la je Tweet
    14. sij

    ITCS 2020, Reflections

    Poništi
  9. proslijedio/la je Tweet
    14. sij
    Poništi
  10. proslijedio/la je Tweet
    11. sij
    Poništi
  11. proslijedio/la je Tweet
    9. sij

    Mithuna Yoganathan () concludes a refreshingly nontechnical talk (about a rather technical result) with an assignment for the quantum computing community

    Poništi
  12. proslijedio/la je Tweet
    6. sij
    Poništi
  13. proslijedio/la je Tweet
    6. sij

    At , explains a fast quantum algorithm for estimating volumes of convex bodies using quantum simulated annealing, a quantum Chebyshev inequality, and continuous-space quantum walks.

    Poništi
  14. proslijedio/la je Tweet
    28. pro 2019.

    Quantum School Lecture notes, videos and more (guest post by Dorit Aharonov)

    Poništi
  15. proslijedio/la je Tweet
    31. pro 2019.

    Obviously, this paper is about crypto as in crypto currencies, right ?

    Poništi
  16. proslijedio/la je Tweet
    24. pro 2019.

    Happy to share that our paper Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof () was accepted by IEEE S&P 2020 ! We propose a new transparent zero knowledge proof scheme with very fast prover time.

    Poništi
  17. proslijedio/la je Tweet
    5. pro 2019.

    Postdoctoral Fellow at The University of Texas at Austin (apply by January 15, 2020)

    Poništi
  18. proslijedio/la je Tweet
    2. pro 2019.

    The timetable for is now available. Lots of great talks on the schedule!

    Poništi
  19. proslijedio/la je Tweet
    30. stu 2019.

    We have a new website: You can find all the papers and talks from CFAIL 2019 there. Info about CFAIL 2020 coming soon!

    Poništi
  20. proslijedio/la je Tweet
    29. stu 2019.
    Odgovor korisniku/ci

    I’ve seen this happen in academia...someone retires, window office with better view is available and then there are 5-6 office changes.

    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·