Trapped ions as a quantum spin glass annealer
Lunch served at 12:00
Solving spin glass models is a complex, often NP-hard, task. In this talk, I will discuss a strategy to attack this problem using trapped ions as a flexible emulator of spin Hamiltonians. Studying its dynamics in a slowly decaying magnetic field, such system can be used as a quantum annealer which might be capable of solving hard optimization problems in polynomial time.
Patterned Complexity in Atomic Scattering
Free lunch served at 12:00
Partial breakdown of quantum thermalization in a Hubbard-like model
Lunch served at 12:00
What does the effective resistance of electrical circuits have to do with quantum algorithms?
Free lunch served at 12:00 pm
I will answer the question in the title. I will also describe a new quantum algorithm for Boolean formula evaluation and an improved analysis of an existing quantum algorithm for st-connectivity. Joint work with Stacey Jeffery.
Nonlinear looped band structure of Bose-Einstein condensates in an optical lattice
Free lunch served at 12:00
Zero-knowledge proof systems for QMA
Zero-knowledge (ZK) proof systems are fundamental in modern cryptography. Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness assumptions for quantum computations, these proof systems can be made secure against quantum attacks.
A Landauer formulation of photon transport in driven systems
Free lunch served at 12:00pm
Surface code error correction on a defective lattice
The yield of physical qubits fabricated in the laboratory is much lower than that of classical transistors in production semiconductor fabrication. Actual implementations of quantum computers will be susceptible to loss in the form of physically faulty qubits. Though these physical faults must negatively affect the computation, we can deal with them by adapting error correction schemes.