Events

Random quantum circuits transform local noise into global white noise

Alexander Dalzell, Caltech/AWS

We examine the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. We will show that, for local noise that is sufficiently weak and unital, the output distribution p_noisy of typical circuits can be approximated by F*p_ideal + (1−F)*p_unif, where F is the probability that no local errors occur, p_ideal is the distribution that would arise if there were no errors, and p_unif is the uniform distribution.

Geometry of Banach spaces: a new route towards Position Based Cryptography

Aleksander Kubicki, University Complutense of Madrid

In this talk I will explain how some techniques coming from the local theory of Banach spaces can be used to obtain claims about the security of protocols for Position Based Cryptography.

Scientists of all backgrounds and genders, have made important contributions in science, technology, engineering and mathematics (STEM), but the participation of women remains low in many areas of STEM, including physics. What can we do to build an inclusive STEM community? Shohini Ghose, IQC associate and Director of the Laurier Centre for Women in Science (WinS) will discuss data that can shed light on where we stand today and describe a practical framework for increasing access and inclusion in STEM.

Join us for Quantum Today, where we sit down with researchers from the University of Waterloo’s Institute for Quantum Computing (IQC) to talk about their work, its impact and where their research may lead.

Post-quantum security of the Even-Mansour cipher

Chen Bai, University of Maryland, College Park

The Even-Mansour cipher is a simple method for constructing a (keyed) pseudorandom permutation E from a public random permutation P: {0,1}^n ->{0,1}^n. It is a core ingredient in a wide array of symmetric-key constructions, including several lightweight cryptosystems presently under consideration for standardization by NIST.

Local-dimension-invariant stabilizer codes

Protection of quantum information is a central challenge in building a quantum computer. Quantum error-correcting codes can correct for logical errors that occur in the system. A particularly well-studied category is stabilizer codes, such as the 9-qubit Shor code, as these are the quantum analogue of classical additive codes. Qudits (particles with local-dimension greater than 2) have more computational basis states per particle than qubits and retain this feature in stabilizer codes.

Join alum Guanru Feng as she shares her career journey and talks about current research.

Guanru Feng is an Applied Scientist at SpinQ Technology, a quantum computing hardware and software company, where she focuses on nuclear magnetic resonance (NMR) desktop quantum computing platforms and superconducting qubit systems.

Quantum sensors allow us to measure with incredible accuracy, precision and selectivity. Future quantum devices that achieve these ultimate sensing qualities by harnessing the complexities of atoms, photons and semiconductors will play a critical role in improving applications such as medical technology, radar, geological exploration, molecular imaging and more. 

Join us for Quantum Today, where we sit down with researchers from the University of Waterloo’s Institute for Quantum Computing (IQC) to talk about their work, its impact and where their research may lead.

Universal efficient compilation: Solovay-Kitaev without inverses

Tudor Giurgica-Tiron, Stanford University

The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose length scales merely poly-logarithmically with accuracy. As a consequence, the choice of gate set is typically unimportant in quantum computing. However, the Solovay-Kitaev algorithm requires the gate set to be inverse-closed.