Welcome to the Institute for Quantum Computing


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.

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.


IQC Seminar - Alexander George-Kennedy, Georgia Tech

Quantum-Nano Centre, 200 University Ave West, Room QNC 1201 Waterloo, ON CA N2L 3G1

Protecting quantum information against noise is a widespread goal in quantum computation. In addition to implementing quantum error correcting codes, classical pre-processing steps of circuit optimization and qubit routing can greatly increase the fidelity of the result of a quantum computation. Prior work has shown that neural networks and/or reinforcement learning can be used to discover quantum error correcting codes, perform qubit routing optimized for circuit depth, and find optimal points to insert dynamical decoupling pulse sequences in a quantum circuit. We extend prior work by creating a deep reinforcement learning directed transpiler. We treat the problem of qubit routing and circuit optimization together, and can regard it as a single-player “game,” where the objective is minimizing the output circuit's estimated noise, subject to the connectivity constraints of the architecture. The “moves” in this game available to the transpiler are selecting the qubit layout, introducing SWAP gates subject to architecture constraints, and rewriting the circuit according to equivalency rules (such as introducing dynamical decoupling sequences, or simply optimizing away repeated self-adjoint gates). We train a transpiler for a specific quantum device, in our experiments, each of the available 5-qubit IBM devices, crucially including the reported error rates per gate per qubit per device as part of the transpiler training data. Running the transpilers on a series of random circuits across different devices, we compare the transpiler output circuits with IBM's transpiler outputs. We find an average improvement of 17% reduction in output error rate compared to the IBM transpiler. This is an improvement on prior work that also uses a neural network as a noise-indicating objective function, but with no explicit loading of device error rates, a different vectorization of circuits, and a greedy circuit rewrite policy. Our work is ongoing, as we intend to extend the transpiler's capability in the vein of prior work to construct error correcting codes during optimization.

Tuesday, April 23, 2024 3:00 pm - 4:00 pm EDT (GMT -04:00)

Quantum Polynomial Hierarchies: Karp-Lipton and Lower Bounds

CS/Math Seminar - Avantika Agarwal IQC

Quantum-Nano Centre, 200 University Ave West, Room QNC 1201 + ZOOM Waterloo, ON CA N2L 3G1

The Polynomial-Time Hierarchy (PH) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers. Quantumly, however, even though at least four definitions of quantum PH exist, it has been challenging to prove analogues for these or even basic facts from PH. This work studies three quantum-verifier based generalizations of PH, two of which are from [Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings (QCPH) and quantum mixed states (QPH) as proofs, and one of which is new to this work, utilizing quantum pure states (pureQPH) as proofs. We first talk about solutions to open problems from GSSSY22 which include a collapse theorem for QCPH and a quantum-classical Karp-Lipton. We then talk about our results for pureQPH, including lower bounds relating QCPH to pureQPH, and finally discuss some interesting open problems related to QCPH. This talk is based on https://arxiv.org/abs/2401.01633, a joint work with Sevag Gharibian, Venkata Koppula and Dorian Rudolph.