Current graduate students

IQC CS/Math Seminar, Xiangling Xu INRIA Saclary

QNC building, 200 University Ave. Room 1201, Waterloo 

Characterizing quantum correlations is a fundamental task in the study of quantum information theory. In the standard Bell scenario, where the correlations are established by a single source, the seminal work [Navascúes et al., 2008] presents a convergent hierarchy that provides an outer approximation, which can be formulated as a problem solvable by computers.

In the more general networks scenarios, however, the correlations are due to multiple independent quantum sources. This necessitates a generalization of the NPA hierarchy. Based on [Renou, Xu, Ligthard, 2022], this talk focuses on the simplest quantum network, the bilocal scenario, where two independent quantum sources exist: one shared between Alice and Bob, and the other between Bob and Charlie. It will discuss two convergent generalizations of the NPA hierarchy in this context, demonstrating that the bilocal scenario is completely understood from the algebraic/Heisenberg perspective.

Despite this progress, the characterization of quantum networks beyond the bilocal scenario remains an open question. This talk will introduce a possible approach, the inflation-NPA hierarchy, as a potential solution. The aim is to motivate the audience to explore this important and challenging problem further.

QNC building, 200 University Ave. Room 0101, Waterloo 

This workshop focuses on encoding quantum information in more than two states.

The main theme is to go beyond binary encodings: from quBits to quDits, where D > 2.

Now is a very interesting time, as we see a lot of experimental progress and new possibilities in this area. This workshop brings together researchers  – both experimentalists and theorists – to explore quDit-based applications in all areas of quantum technology.

Aspects of Quantum Information in Quantum Field Theory: Particle detector models, entanglement, and complexity

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

Professor Brad Hauer, Institute for Quantum Computing

QNC building, 200 University Ave. Room 0101, Waterloo 

Join new IQC faculty member Professor Brad Hauer for a tutorial on quantum optomechanics and a preview of new research directions at IQC. This tutorial is designed for the USEQIP program to be accessible to advanced undergraduates, and all IQC members are welcome (no registration required).

Cavity optomechanics, which studies the interplay between confined electromagnetic fields and mechanical motion, has seen a flurry of activity over the past two decades. In particular, optomechanical devices have had great success in preparing, manipulating, and observing quantum states of motion in nanoscale mechanical resonators. With applications in quantum information and quantum sensing on the horizon, cavity optomechanical devices remain an exciting prospect for real-world quantum technologies, as well as probes of important physical quantities on both microscopic and cosmological scales.

In my tutorial, I will provide a brief overview of cavity optomechanics, describing both the theoretical fundamentals and physical implementations. Following this introduction, I will detail a number of recent experiments realizing quantum effects in mesoscale mechanical resonators, including ground state cooling and entanglement of their motion. I will also discuss how cavity optomechanics is being used to further our understanding of the universe through next-generation dark matter and gravity wave detectors. Finally, I will briefly discuss my own research studying newly developed mm-wave optomechanical circuits and how I plan to use these devices to continue advancing the field.

Weight estimation for optical detection setups

QNC building, 200 University Ave. Room 1201, Waterloo 

Realistic models of optical detection setups are crucial for numerous quantum information tasks. For instance, squashing maps allow for more realistic descriptions of the detection setups by accounting for multiphoton detections. To apply squashing maps, one requires a population estimation of multiphoton subspaces of the input to the detection setup. So far, there has been no universal method for those subspace estimations for arbitrary detection setups.

We introduce a generic subspace estimation technique applicable to any passive linear optical setup, accounting for losses and dark counts. The resulting bounds are relevant for adversarial tasks such as QKD or entanglement verification. Additionally, this method enables a generic passive detection setup characterization, providing the necessary measurement POVM for e.g. QKD security proofs.

IQC Special seminar - Sahel Ashhab, National Institute of Information and Communications, Japan

QNC building, 200 University Ave. Room 1201, Waterloo 

We use numerical optimal-control-theory methods to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. In the first set of calculations, we consider all possible gate configurations for a given number of qubits and a given number of CNOT gates, and we determine the maximum achievable fidelity for the specified parameters. This information allows us to identify the minimum number of gates needed to perform a specific target operation. It also allows us to enumerate the different gate configurations that can be used for a perfect implementation of the target operation. We find that there are a large number of configurations that all produce the desired result, even at the minimum number of gates. This last result motivates the second set of calculations, in which we consider only a small fraction of the super-exponentially large number of possible gate configurations for an increasing number of qubits. We find that the fraction of gate configurations that allow us to achieve the desired target operation increases rapidly as soon as the number of gates exceeds the theoretical lower bound for the required number of gates. As a result, a random search can be a highly efficient approach for quantum circuit synthesis. Our results demonstrate the important role that numerical optimal control theory can play in the development of quantum compilers.

IQC Colloquium - Dr. Chae-Yeun Park, Xanadu

QNC building, 200 University Ave. Room QNC 1201 Waterloo 

Understanding the dynamics of quantum many-body systems is one of the fundamental objectives of physics. The existence of an efficient quantum algorithm for simulating these dynamics with reasonable resource requirements suggests that this problem might be among the first practically relevant tasks quantum computers can tackle. Although an efficient classical algorithm for simulating such dynamics is not generally expected, the classical hardness of many-body dynamics has been rigorously proven only for certain commuting Hamiltonians. In this talk, I will show that computing the output distribution of quantum many-body dynamics is classically difficult, classified as #P-hard, also for a large class of non-commuting many-body spin Hamiltonians. Our proof leverages the robust polynomial estimation technique and the #P-hardness of computing the permanent of a matrix. By combining this with the anticoncentration conjecture of the output distribution, I will argue that sampling from the output distribution generated by the dynamics of a large class of spin Hamiltonians is classically infeasible. Our findings can significantly reduce the number of qubits required to demonstrate quantum advantage using analog quantum simulators.

Towards an on-demand, all-electrical single-photon source

Research Advancement Center, 485 Wes Graham Way, Room 2009 Waterloo, ON N2L 6R2

Single-photon sources (SPSs) are an elementary building block for quantum technologies. An ideal SPS is deterministic, on-demand and produces exactly one photon per pulse. Additionally, desirable features include a high repetition rate, an all-electrical driving mechanism and compatibility with semiconductor manufacturing techniques. Despite great advances in the field of single photon emitters, an SPS with all the features outlined above remains elusive. In this talk, we will present our proposed SPS, consisting of a single-electron pump integrated in proximity to a lateral PN-junction, which would allow our SPS to meet all the criteria listed above. We discuss progress towards our goal, and also discuss an unconventional electroluminescence mechanism observed during recent experiments.

CS Math Seminar - Quynh Nguyen, Harvard University

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

We define a map from an arbitrary quantum circuit to a local Hamiltonian whose ground state encodes the quantum computation. All previous maps relied on the Feynman-Kitaev construction, which introduces an ancillary ‘clock register’ to track the computational steps. Our construction, on the other hand, relies on injective tensor networks with associated parent Hamiltonians, avoiding the introduction of a clock register. This comes at the cost of the ground state containing only a noisy version of the quantum computation, with independent stochastic noise. We can remedy this - making our construction robust - by using quantum fault tolerance. In addition to the stochastic noise, we show that any state with energy density exponentially small in the circuit depth encodes a noisy version of the quantum computation with adversarial noise. We also show that any ‘combinatorial state’ with energy density polynomially small in depth encodes the quantum computation with adversarial noise. This serves as evidence that any state with energy density polynomially small in depth has a similar property. As an application, we give a new proof of the QMA-completeness of the local Hamiltonian problem (with logarithmic locality) and show that contracting injective tensor networks to additive error is BQP- hard. We also discuss the implication of our construction to the quantum PCP conjecture, combining with an observation that QMA verification can be done in logarithmic depth.

Based on joint work with Anurag Anshu and Nikolas P. Breuckmann. (https://arxiv.org/abs/2309.16475)

Blackbox Optimization for Free-space Quantum Key Distribution

MC, 200 University Ave West, Room MC 5417
Waterloo, ON CA N2L 3G1

Supervisors: Thomas Jennewein and Norbert Lütkenhaus