Search Mailing List Archives

Limit search to: Subject & Body Subject Author
Sort by: Reverse Sort
Limit to: All This Week Last Week This Month Last Month
Select Date Range     through    

[theory-seminar] Fwd: Spring school on quantum computation at UCSD, March 19-22 2018

Moses Charikar moses at
Mon Dec 4 12:38:04 PST 2017

FYI ... 4 day winter school on quantum computation at UCSD that could be
interest to some folks on this list.


---------- Forwarded message ----------
From: Thomas Vidick <vidick at>
Date: Mon, Dec 4, 2017 at 11:35 AM
Subject: Spring school on quantum computation at UCSD, March 19-22 2018
To: Moses Charikar <moses at>

Dear Moses,

As you may now 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

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.


Spring school on Quantum Computation
March 19-22, 2018
University of California, San Diego

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).
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: poster.pdf
Type: application/pdf
Size: 1357228 bytes
Desc: not available
URL: <>

More information about the theory-seminar mailing list