Understanding the computational power of quantum computers
IQC Alum Lecture Series: Robin Kothari, Microsoft Quantum
Join alum Robin Kothari as he shares his career journey and talks about current research.
Join alum Robin Kothari as he shares his career journey and talks about current research.
In optical quantum communication and information protocols, it is important to have access to a high dimensional Hilbert space. The energy-time degree of freedom of photons may be used to access such a Hilbert space, as long as accurate measures of frequency and time of single photons are possible. With ultrafast timescales, it is known how to measure the phase of an electric field as a function of time, but new techniques are required for the low power, single photon regime.
I will talk about the quantum algorithms developed by block-encoding techniques for solving linear system of equations. We will see what sorts of speed-ups have been proved or could be expected, while exploiting a quantum linear solver as a subroutine, for tasks ranging from solving PDEs to sampling from Gibbs distributions.
Join the seminar on Zoom or in QNC 1201!
Meeting link: IQC Student Seminar
Students joining will be divided into groups and discuss each other's current work using the whiteboard.
Join the seminar in QNC 1201!
Add event to calendar
The possibility for quantum computers to outcompete classical high-performance computers at their own game looms tantalizingly on the horizon. The main obstacle to performing large-scale computations remains the cascade of small inaccuracies on individual components throughout large quantum circuits. Since the 1990s, techniques have been invented for suppressing these errors, principally within academia.
Communication networks are an essential part of our world today, used in transactions from banking to education, global business exchanges to defence. What happens when our private information is no longer private? Powerful quantum computers will have the ability to crack the encryption of public keys that we currently use to secure our data, putting our privacy at risk.
Very often, in theory, device and implementation imperfections are assumed to be ideal to make the theory simpler. However, before we can practically use these devices, these assumptions must either be removed or justified. I will talk about some techniques to rigorously deal with imperfect detectors within the context of QKD.
The Institute for Quantum Computing (IQC) alum Galit Anikeeva will talk about her research since IQC, at Stanford, MIT, and beyond - at first focusing on quantum error correction, and then most recently on tentative connections between chaos and Hamiltonian simulation. She will also highlight how lessons from her time at IQC have shaped her path through undergraduate research and into graduate school, especially welcoming questions from younger students.
Quantum Max Cut (QMC) is a QMA-hard instance of 2-Local Hamiltonian (2-LH) that is closely related to the well-studied antiferromagnetic Heisenberg model (AFHM). Finding maximal energy states of QMC is equivalent to finding ground states of AFHM; however, the approximability of the former is related to the classical Max Cut problem.
The tunneling time problem – the question on how long a particle spends inside a forbidden region, has puzzled physicists since the inception of quantum mechanics.