Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Monday, June 29, 2020 2:30 pm - 2:30 pm EDT (GMT -04:00)

The Impossibility of Efficient Quantum Weak Coin-Flipping

Colloquium featuring Carl Alexander Miller - QuICS and NIST

How can two parties carry out a fair coin flip across a noiseless quantum channel? In 2007, Carlos Mochon proved a tantalizing result: he showed that fair quantum coin flipping is possible in principle, but he used a protocol that required a huge (exponential) number of communication rounds. In the twelve years since, despite some continued deep theoretical work on the problem, no improvements to the efficiency of Mochon's protocol have been made.

Monday, November 16, 2020 2:30 pm - 2:30 pm EST (GMT -05:00)

The power of adiabatic quantum computation with no sign problem

IQC Colloquium - Matthew Hastings, Microsoft Research

Interference is an essential part of quantum mechanics. However, an important class of Hamiltonians considered are those with "no sign problem", where all off-diagonal matrix elements of the Hamiltonian are non-negative. This means that the ground state wave function can be chosen to have all amplitudes real and positive.

Wednesday, November 25, 2020 2:00 pm - 2:00 pm EST (GMT -05:00)

Quantum simulators for nuclear and particle physics: progress, challenges, and future

Joint PI/IQC Colloquium featuring Zohreh Davoudi University of Maryland, College Park

A vibrant program has formed in recent years in various scientific disciplines to take advantage of near-term and future quantum-simulation and quantum-computing hardware to study complex quantum many-body systems, building upon the vision of Richard Feynman for quantum simulation.

Monday, December 7, 2020 2:30 pm - 2:30 pm EST (GMT -05:00)

Grand unification of quantum algorithms

Colloquium featuring Isaac Chuang - MIT

The three main branches of quantum algorithms, for simulation, search, and factoring, hold historically disparate origins. Today, we can now understand and appreciate all of these as being instances of the quantum singular value transformation algorithm of Gilyen, Su, Low, and Weibe. This unified framework, and the surprisingly universal role of single-qubit dynamics, open doors to many new quantum algorithms and opportunities for quantum advantage.

The recording is now available online.

Monday, April 5, 2021 2:30 pm - 2:30 pm EDT (GMT -04:00)

The Power of Parametric Effects in Engineered Quantum Systems

Colloquium speaker: Anja Metelmann, Free University Berlin

Parametric couplings offers the exciting possibility to manipulate and control interactions between engineered quantum systems. Such systems are artificial mesoscopic systems whose dynamics are governed by the laws of quantum mechanics. Prominent examples of these mesoscopic systems are ultracold trapped atoms and ions, superconducting circuits and electro/optomechanical systems.

Monday, May 17, 2021 2:30 pm - 2:30 pm EDT (GMT -04:00)

Fluxonium qubits for ultra-high-fidelity and scalable quantum processors

IQC Colloquium - Chunqing Deng, Quantum Scientist and Head of the Experimental Group Alibaba Quantum Laboratory

The success of superconducting quantum computing (SQC) has so far been largely built upon the transmon qubit. Finding an alternative qubit that drastically outperforms transmon represents one of the most fundamental and exciting frontiers of SQC. The fluxonium qubit stands out as a promising candidate, due to its long coherence times and large anharmonicity. Furthermore, fluxonium can be directly integrated into the existing circuit-QED schemes for scaling.

Thursday, May 20, 2021 12:00 pm - 12:00 pm EDT (GMT -04:00)

Quantum Today: New algorithm uses a hologram to control trapped ions

Quantum Today is an exciting new seminar series that pulls its themes from recently published scientific articles. Join us as we sit down in conversation with researchers to talk about their work, what’s the impact and where their research will lead to.

Monday, December 13, 2021 2:30 pm - 2:30 pm EST (GMT -05:00)

Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality

John Wright, University of Texas at Austin

The local Hamiltonian problem is one of the most fundamental problems in quantum computing. It is a natural generalization of classical constraint satisfaction problems to the quantum regime, and it is the canonical QMA-complete problem. In addition, it arises naturally in the study of many-body physics. Given an instance of the local Hamiltonian problem, the object is to find its ground state or the energy of this state.