Events

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.

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 Special Seminar, Jerome Wiesemann, Fraunhofer Heinrich Hertz Institute HHI

Quantum key distribution (QKD) is on the verge of becoming a robust security solution, backed by security proofs that closely model practical implementations.  As QKD matures, a crucial requirement for its widespread adoption is establishing standards for evaluating and certifying practical implementations, particularly against side-channel attacks resulting from device imperfections that can undermine security claims. Today, QKD is at a stage where the development of such standards is increasingly prioritized. This works aims to address some of the challenges associated with this task by focusing on the process of preparing an in-house QKD system for evaluation. We first present a consolidated and accessible baseline security proof for the one-decoy state BB84 protocol with finite-keys, expressed in a unified language. Building upon this security proof, we identify and tackle some of the most critical side-channel attacks by characterizing and implementing countermeasures both in the QKD system and within the security proof. In this process, we iteratively evaluate the risk of the individual attacks and re-assess the security of the system. Evaluating the security of QKD systems additionally involves performing attacks to potentially identify new loopholes. Thus, we also aim to perform the first real-time Trojan horse attack on a decoy state BB84 system, further highlighting the need for robust countermeasures. By providing a critical evaluation of our QKD system and incorporating robust countermeasures against side-channel attacks, our research contributes to advancing the practical implementation and evaluation of QKD as a trusted security solution.

The QKD security proof workshop is an annual workshop series focused on technical security proofs. Our focus in the workshop is to facilitate interactions and discussions between participants.