Search Talks

"Motivated by applications in machine learning, we present a quantum algorithm for Gibbs sampling from continuous real-valued functions defined on high dimensional tori. We show that these families of functions satisfy a Poincare inequality. We then use the techniques for solving linear systems and partial differential equations to design an algorithm that performs zeroeth order queries to a quantum oracle computing the energy function to return samples from its Gibbs distribution. We further analyze the query and gate complexity of our algorithm and prove that the algorithm has a polylogarithmic dependence on approximation error (in total variation distance) and a polynomial dependence on the number of variables, although it suffers from an exponentially poor dependence on temperature."

I will present recent progress in building a rigorous theory to understand how scientists, machines, and future quantum computers could learn models of our quantum universe. The talk will begin with an experimentally feasible procedure for converting a quantum many-body system into a succinct classical description of the system, its classical shadow. Classical shadows can be applied to efficiently predict many properties of interest, including expectation values of local observables and few-body correlation functions. I will then build on the classical shadow formalism to answer two fundamental questions at the intersection of machine learning and quantum physics: Can classical machines learn to solve challenging problems in quantum physics? And can quantum machines learn exponentially faster than classical machines?

Zoom link:  https://pitp.zoom.us/j/97994359596?pwd=UlBwc2hoSkNzWlZvM1o1RWErU1U2QT09

The Floquet code implements a periodic sequence of two-qubit measurements to realize the topological order. After each measurement round, the instantaneous stabilizer group can be mapped to a honeycomb toric code, thus explaining the topological feature. However, the code also possesses a time-crystal order distinct from a stationary toric code – an e-m exchange after every cycle. In this work, we construct a continuous path interpolating between the Floquet and toric codes, focusing on the transition between the time-crystal and non-time crystal phases. We show that this transition is characterized by a diverging length scale. We also add single qubit noise to the model and obtain a two-dimensional parametric phase diagram of the Floquet code.

Zoom link:  https://pitp.zoom.us/j/95933569447?pwd=UkcrVHdkWERTNVIrcXdCREQ3Y1JUZz09

The backbones of modern-day Deep Learning, Neural Networks (NN), define field theories on Euclidean background through their architectures, where field interaction strengths depend on the choice of NN architecture width and stochastic parameters. Infinite width limit of NN architectures, combined with independently distributed stochastic parameters, lead to generalized free field theories by the Central Limit Theorem (CLT). Small and large deviations from the CLT, due to finite architecture width and/or correlated stochastic parameters, respectively give rise to weakly coupled field theories and non-perturbative non-Lagrangian field theories in Neural Networks. I will present a systematic exploration of Neural Network field theories via a dual framework of NN parameters: non-Gaussianity, locality by cluster decomposition, and symmetries are studied without necessitating the knowledge of an action. Such a dual description to statistical or quantum field theories in Neural Networks can have potential implications for physics.

In this talk, I'll describe new tomographic protocols for efficiently estimating various fermionic quantities, including both local observables (i.e., expectation values of local fermionic operators) and certain global properties (e.g., inner products between an unknown quantum state and arbitrary fermionic Gaussian states). Our protocols are based on classical shadows arising from random matchgate circuits. As a concrete application, they enable us to implement the recently introduced quantum-classical hybrid quantum Monte Carlo algorithm, without the exponential post-processing cost incurred by the original approach.

"One of the central challenges in quantum information science is to design quantum algorithms that outperform their classical counterparts in combinatorial optimization. In this talk, I will describe a modification of the quantum adiabatic algorithm (QAA) [1] that achieves a Grover-type speedup in solving a wide class of combinatorial optimization problem instances. The speedup is obtained over classical Markov chain algorithms including simulated annealing, parallel tempering, and quantum Monte Carlo. I will then introduce a framework to predict the relative performance of the standard QAA and classical Markov chain algorithms, and show problem instances with quantum speedup and slowdown. Finally, I will apply this framework to interpret results from a recent Rydberg atom array experiment [2], which suggest a superlinear speedup in solving the Maximum Independent Set problem on unit-disk graphs. [1] Farhi et al. (2001) Science 292, 5516 [2] Ebadi et al. (2022) Science 376, 6598"

In this talk, I will introduce the so-called entanglement linear response, i.e., response under entanglement generated unitary dynamics. As an application, I will show how it can be applied to certain anomalies in 1D CFTs. Moreover, I will apply it to extract the quantum Hall conductance from a wavefunction and how it embraces a previous work on the chiral central charge. This gives a new connection between entanglement, anomaly and topological response. If time permits, I will also talk about how it inspires some generalizations of the real-space Chern number formula in free fermion systems.

Zoom link:  https://pitp.zoom.us/j/96535214681?pwd=MldXRkRjZ1J6WS95WXQ0cG03cWdCZz09