Forwarded message (from Thomas Vidick).
As you may know Shachar Lovett has been organizing a "Trends in Theory"
workshop/winter school at UCSD in the past few years. Last year's school
was given by Boaz Barak and David Steurer, on Sum of Squares.
The next workshop will be on Quantum Computation, March 19-22, 2018. The
lecturers are Dorit Aharonov (Hebrew University), David Gosset (IBM),
and myself.
I am copying below a short description, including a link to the website,
that I'd really appreciate if you could forward to the appropriate
mailing list. I am also attaching a poster - it would be fantastic if
you could print that out and display it somewhere!
The school is aimed at graduate students, postdocs and faculty in TCS at
large (no quantum information background required). Pleas encourage any
graduate students you know who could be interested! We have (very
limited) support for a a few students to attend.
Thanks,
Thomas
---------
Spring school on Quantum Computation
March 19-22, 2018
University of California, San Diego
http://cseweb.ucsd.edu/~slovett/workshops/quantum-computation-2018/
Registration: Registration is free but is required. The deadline is
February 1st, 2018.
Travel support: We have limited financial support available for
students. Please see the website.
Overview: The 3.5-day Spring school will bring TCS researchers up to
speed on the current excitement in quantum computing. What are the
theoretical models for such devices, and what are their prospects? Can
they be classically simulated, and if not, can they accomplish
algorithmic speed-ups? What are the obstacles to full-blown
fault-tolerant quantum computation? And what does all this tell us about
complexity theory, cryptography, and quantum information?
Target audience: The school is oriented towards graduate students,
postdocs and faculty alike. We expect participants to have a background
in computer science (complexity and algorithms), as well as a working
familiarity with linear algebra, but no prior exposure to quantum
information is needed.
Topics covered: Emphasis will be put on interesting open algorithmic and
computational complexity questions which are of appeal to theoretical
computer scientists. The following topics will be discussed:
• Basics of quantum mechanics, entanglement, the quantum circuit model,
the complexity class BQP, the notion of a local Hamiltonian, and the
class QMA (the quantum analog of NP).
• Restricted models of quantum computation, such as low-depth circuits
and adiabatic computation
• Quantum error correcting codes and multiparticle entanglement
• Quantum interactive proofs with one or more provers and their
connection to cryptography (delegating quantum computations) and
complexity (the quantum PCP conjecture).
--------------
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip