Quantum coding with low-depth random circuits
Michael Gullans, University of Maryland - College Park
Lower Bounds on Stabilizer Rank
Dr. Ben Lee Volk, The University of Texas at Austin
The stabilizer rank of a quantum state ψ is the minimal integer r such that ψ can be written as a linear combination of r stabilizer states. The running time of several classical simulation methods for quantum circuits is determined by the stabilizer rank of the n-th tensor power of single-qubit magic states.
Linear growth of quantum circuit complexity
Jonas Haferkamp, Freie Universität Berlin
Security analysis of quantum key distribution: Methods and applications
Join Twesh Upadhyaya, MSc student at the University of Waterloo’s Institute for Quantum Computing (IQC) and Department of Physics & Astronomy, in conversation with scientific outreach manager John Donohue. They’ll discuss his latest journal article entitled “Dimension Reductions in Quantum Key Distribution for Continuous- and Discrete-Variable Protocols” published in Physical Review X Quantum on May 24.
Trapdoor claw-free functions in quantum cryptography
Carl Miller, University of Maryland
How to perform the coherent measurement of a curved phase space
Dr. Christopher Sahadev Jackson, Sandia National Laboratories
Bounding quantum capacities via partial orders and complementarity
Christoph Hirche, Technische Universität München and National University of Singapore
Mid-Infrared Semiconductors on Silicon for Next-Generation Silicon Photonics
Galih R. Suwito, McGill University
Clifford groups are not always 2-designs
Matthew Graydon, Institute for Quantum Computing