Search Talks

Randomness is a valuable resource in both classical and quantum networks and we wish to generate desired probability distributions as cheaply as possible. If we are allowed to slightly change the distribution under some tolerance level, we can sometimes greatly reduce the cardinality of the randomness or the dimension of the entanglement. By studying statistical inequalities, we show how to upper bound of the amount of randomness required for any given classical network and tolerance level. We also present a problem we encounter when compressing the randomness in a quantum network.

We study remarkable RG flows in 4d QFT where supersymmetry enhances from N=1 to N=2 in the IR. This is triggered by the N=1 preserving deformation of 4d N=2 SCFTs with non-Abelian flavor symmetry by adding a chiral multiplet in the adjoint representation of the flavor symmetry and giving a nilpotent vev to the chiral multiplet. When the original N=2 SCFT and choice of the vev satisfy certain conditions, the resulting RG flows give N=2 Argyres-Douglas theories in the IR. These flows thus enable us to compute partition functions of Argyres-Douglas theories via localization. We also consider the more general and systematic deformation procedure which is applicable to any N=1 SCFTs and thus includes the above nilpotent one. Starting from N=1 SCFTs we allow all possible relevant deformations and/or coupling to a free chiral sector. We apply this to simple N=1 SCFTs and discuss the landscape of the IR fixed points, focusing on the enhancement of supersymmetry.

The Wilson formulation of lattice gauge theories provides a first-principles study of many properties of strongly interacting theories, such as quantum chromodynamics (QCD). Certain other properties, such as real-time dynamics, pose insurmountable challenges in this paradigm. Quantum Link Models are generalized lattice gauge theories, which not only offer novel approaches to study dynamics of gauge theories with quantum simulators, but also connect to
gauge theory descriptions of certain condensed matter systems (such as frustrated magnetism). In this talk, we explore some novel properties of gauge theories using quantum link models on classical computers, and explain how to realize them on quantum simulators.  

The out-of-time-ordered correlator (OTOC) and entanglement are two physically motivated and widely used probes of the ``scrambling'' of quantum information, which has drawn great interest recently in quantum gravity and many-body physics. By proving upper and lower bounds for OTOC saturation on graphs with bounded degree and a lower bound for entanglement on general graphs, we show that the time scales of scrambling as given by the growth of OTOC and entanglement entropy can be asymptotically separated in a random quantum circuit model defined on graphs with a tight bottleneck. Our result counters the intuition that a random quantum circuit mixes in time proportional to the diameter of the underlying graph of interactions.  It also serves as a more rigorous justification for an argument of [Shor, 1807.04363], that black holes may be very slow scramblers in terms of entanglement generation. Such observations may be of fundamental importance in the understanding of the black hole information problem. The bound we obtained for OTOC is interesting in its own right in that it generalized previous studies of OTOC on lattices to the geometries on graphs and proved it rigorously.   Based on [Harrow-Kong-Liu-Mehraban-Shor, 1906.02219]