Search Talks

Canonical transformations play fundamental roles in simplifying and solving physical systems. However, their design and implementation can be challenging in the many-particle setting. Viewing canonical transformations from the angle of learnable diffeomorphism reveals a fruitful connection to normalizing flows in machine learning. The key issue is then how to impose physical constraints such as symplecticity, unitarity, and permutation equivariance in the flow transformations. In this talk, I will present the design and application of neural canonical transformations for several physical problems. Symplectic flow identifies independent and nonlinear modes of classical Hamiltonians and natural datasets. Fermi flow variationally solves ab initio many-electron problems at finite temperatures.
Refs:
[1] Shuo-Hui Li, Chen-Xiao Dong, Linfeng Zhang, and Lei Wang, Phys. Rev. X 10, 021020 (2020)
[2]  Hao Xie, Linfeng Zhang, and Lei Wang, J. Mach. Learn. , 1, 38 (2022)

Zoom link:  https://pitp.zoom.us/j/98830940500?pwd=WjdydGY5aS9QQzk5SnI0TE1xMkwrdz09

Interacting quantum particles can form non-trivial states of matter characterized by topological order, which features several unconventional properties such as topological degeneracy and fractionalized quasiparticles. In addition, it also provides a promising platform for realizing quantum computing in a robust manner. In this series of lectures, I will introduce the basics of topological order and its connection to quantum computing from various aspects involving lattice models, symmetry, and entanglement structure. Several frontier topics such as fracton topological phases, self-correcting quantum memory, state preparation, and quantum LDPC codes will be briefly discussed.

Kronecker coefficients appear in representation of the symmetric group in the decomposition of tensor products of irreducible representations. They are notoriously difficult to compute and it is a long standing problem to find a combinatorial expression for them. 

We study the problem of computing Kronecker coefficients from quantum computational perspective. First, we show that the coefficients can be expressed as a dimension of a subspace given by intersection of two commuting, efficiently implementable projectors and relate their computation to the recently introduced quantum approximate counting class (QAPC). Using similar construction, we show that deciding positivity of Kronecker coefficients is contained in QMA. We give similar results for a related problem of approximating row sums in a character table of the symmetric group and show that its decision variant is in QMA. We then discuss two quantum algorithms - one that samples a distribution over squared characters and another one that approximates normalized Kronecker coefficients to inverse-polynomial additive error. We show that under a conjecture about average-case hardness of computing Kronecker coefficients, the resulting distribution is hard to sample from classically. 

Our work explores new structures for quantum algorithms and improved characterization of the quantum approximate counting.

Joint work with David Gossett, Sergey Bravyi, Anirban Chowdhury and Guanyu Zhu 

Zoom link:  https://pitp.zoom.us/j/95976938016?pwd=eDV3TXZReHo5UHdvZ0hIbkhXOFcxQT09