Osama Moussa, Institute for Quantum Computing (IQC)
An approximate unitary t-design is a distribution of unitaries that mimic properties of the Haar measure for polynomials (in the entries of the unitaries) of degree up to t. It has been a conjecture in the theory of quantum pseudo-randomness that polynomial sized random quantum circuits form an approximate unitary poly(n)-design. Unfortunately, up to now, the best result known is that polynomial random quantum circuits are unitary 3-designs.
Laura Mancinska, Institute for Quantum Computing (IQC)
Abstract to be announced.
Amir Yacoby, Harvard
First installment of the IQC-WIN Special Seminar Series
Eduardo Martin-Martinez, Instituto de Fisica Fundamental
Fred Shultz, Wellesley College
We will determine the possible maps that can describe time evolution preserving entanglement.
This will be approached by examining the convex set of separable states, and describing all symmetries of this set.
Joint work with Erik Alfsen of the University of Oslo.
Alioscia Hamma, Perimeter Institute
Shunlong Luo, Academy of Mathematics and Systems Scienc, Chinese Academy of Sciences
Mary Beth Ruskai, Tufts University
Subtitle: A numerical project that needs HELP
After Shor's proof of equivalence of additivity conjectures, attention shifted from capacity and entanglement of formation to the seemingly easier questions of minimal output entropy. Despite existence proofs for non-additivity in high dimensions, explicit examples remain elusive. It may be that the violations for minimal output entropy are so small and require such large dimensions, that numerical searches won't find them.
Jason Petta, Princeton University