News
Entangling undergraduate students with quantum success
Each year, the Institute for Quantum Computing (IQC) invites top undergraduate students from around the world to the University of Waterloo for the opportunity to immerse themselves in quantum information science and technology. This program, the Undergraduate School on Experimental Quantum Information Processing (USEQIP), provides participants with lectures on quantum information theory and experimental approaches to quantum devices, as well as over 30 hours of hands-on laboratory and experimental exploration.
IQC is an international destination for quantum innovation
On World Quantum Day, the Institute for Quantum Computing celebrates progress and momentum.
Cosmic rays, quantum bits and underground labs intersect to advance the future of computing
A new collaboration between researchers from the Institute for Quantum Computing (IQC) at the University of Waterloo, SNOLAB near Sudbury, Ontario, and Chalmers University of Technology in Sweden has been awarded a new grant to investigate the impact of radiation and cosmic rays on quantum technologies.
Events
Two Prover Perfect Zero Knowledge for MIP*
CS/MATH Seminar - Kieran Mastel from IQC ZOOM + IN PERSON
Quantum-Nano Centre, 200 University Ave West, Room QNC 1201 Waterloo, ON CA N2L 3G1
The recent MIP*=RE theorem of Ji, Natarajan, Vidick, Wright, and Yuen shows that the complexity class MIP* of multiprover proof systems with entangled provers contains all recursively enumerable languages. In prior work Grilo, Slofstra, and Yuen showed (via a technique called simulatable codes) that every language in MIP* has a perfect zero knowledge (PZK) MIP* protocol. The MIP*=RE theorem uses two-prover one-round proof systems, and hence such systems are complete for MIP*. However, the construction in Grilo, Slofstra, and Yuen uses six provers, and there is no obvious way to get perfect zero knowledge with two provers via simulatable codes. This leads to a natural question: are there two-prover PZK-MIP* protocols for all of MIP*?
In this talk we answer the question in the affirmative. For the proof, we use a new method based on a key consequence of the MIP*=RE theorem, which is that every MIP* protocol can be turned into a family of boolean constraint system (BCS) nonlocal games. This makes it possible to work with MIP* protocols as boolean constraint systems, and in particular allows us to use a variant of a construction due to Dwork, Feige, Kilian, Naor, and Safra which gives a classical MIP protocol for 3SAT with perfect zero knowledge. To show quantum soundness of this classical construction, we develop a toolkit for analyzing quantum soundness of reductions between BCS games, which we expect to be useful more broadly. This talk is based on joint work with William Slofstra
Quantum Connections 2024: Quantum Perspectives
Join us for Quantum Connections May 1-2, 2024. This year we’re highlighting Quantum Perspectives: the impacts and outlooks driving our future.
ETSI/IQC Quantum Safe Cryptography Conference 2024
ETSI and the Institute for Quantum Computing are pleased to announce the 10th ETSI/IQC Quantum Safe Cryptography Conference, taking place in Singapore on May 14-16, 2024. The event will be hosted by the Centre for Quantum Technologies, National University of Singapore.
This event was designed for members of the business, government, and research communities with a stake in cryptographic standardization to facilitate the knowledge exchange and collaboration required to transition cyber infrastructures and business practices to make them safe in an era with quantum computers. It aims to showcase both the most recent developments from industry and government and cutting-edge potential solutions coming out of the most recent research.