Dear quanta,
Joel Klassen is visiting from now through Oct 5, and will speak this Friday
at the group meeting.
Urmila Mahadev is visiting from Oct 23-26 and is giving two talks in the CS
department.
Joel's talk this Friday:
Title: When is a Hamiltonian Stoquastic?
Abstract: I will discuss a class of Hamiltonians called stoquastic
Hamiltonians. Systems with Hamiltonians of this form avoid the sign problem
and thus typically lend themselves well to quantum Monte Carlo methods.
Understanding when a Hamiltonian is stoquastic is a non-trivial task, since
the property is only manifest in a correctly chosen basis. Here I review
work done, in collaboration with Barbara Terhal, to construct algorithms
for deciding when a Hamiltonian is stoquastic, and for producing the
correct choice of basis.
Urmila's first talk is the ToC colloquium (4pm , Oct 23, 32-G449)
https://toc.csail.mit.edu/node/1254
Classical verification of quantam computation
Abstract: We present the first protocol allowing a classical computer to
interactively verify the result of an efficient quantum computation. We
achieve this by constructing a measurement protocol, which enables a
classical verifier to use a quantum prover as a trusted measurement device.
The protocol forces the prover to behave as follows: the prover must
construct an n qubit state of his choice, measure each qubit in the
Hadamard or standard basis as directed by the verifier, and report the
measurement results to the verifier. The soundness of this protocol is
enforced based on the assumption that the learning with errors problem is
computationally intractable for efficient quantum machines.
Her second talk is in the crypto seminar series (10:30-12pm, Oct 26,
32-G882)
https://toc.csail.mit.edu/node/1253
Classical homomorphic encryption for quantum circuits
Abstract: We present the first leveled fully homomorphic encryption scheme
for quantum circuits with classical keys. The scheme allows a classical
client to blindly delegate a quantum computation to a quantum server: an
honest server is able to run the computation while a malicious server is
unable to learn any information about the computation. We show that it is
possible to construct such a scheme directly from a quantum secure
classical homomorphic encryption scheme with certain properties. Finally,
we show that a classical homomorphic encryption scheme with the required
properties can be constructed from the learning with errors problem.
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip