Fault-tolerant error correction using flags and error weight parities
Theerapat Tansuwannont, Institute for Quantum Computing
Talk abstract:
Fermion Sampling: A robust quantum advantage scheme using fermionic linear optics and magic input states
Michal Oszmaniec, Center for Theoretical Physics PAS
An optomechanical cavendish experiment
Join Luca Dellantonio, a postdoctoral fellow at the University of Waterloo’s Institute for Quantum Computing (IQC), in conversation with scientific outreach manager John Donohue. They’ll discuss his latest journal article entitled A measurement-based variational quantum eigensolver published in Physical Review Letters on June 4.
Join alum Tomas Jochym-O’Connor, PhD ’16, as he shares his career journey and talks about current research.
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.
Discover how mathematics, physics, computer science, engineering, and more combine into one of the most exciting topics in modern science – quantum information – at the Quantum Cryptography School for Young Students (QCSYS). QCSYS is a unique enrichment program for high school students that will run this August.
QCSYS will be a free, online program that offers a blend of expert lectures, small group discussions, problem solving, and opportunities for mentoring and networking with world-leading quantum researchers.
You will:
Linear growth of quantum circuit complexity
Jonas Haferkamp, Freie Universität Berlin