Machine Learning Initiative

I’ll talk about two independent works on classical and quantum neural networks connected by information theory. In the first part of the talk, I’ll treat sequence models as one-dimensional classical statistical mechanical systems and analyze the scaling behavior of mutual information. I'll provide a new perspective on why recurrent neural networks are not good at natural language processing. In the second part of the talk, I’ll study information scrambling dynamics when quantum neural networks are trained by classical gradient descent algorithm. For many problems, this hybrid quantum-classical training process consists of two stages where information scrambles very differently in the network. 

Meta-learning involves learning mathematical devices using problem instances as training data. In this talk, we first describe recent meta-learning approaches involving the learning of objects such as: initial weights, parameterized losses, hyper-parameter search strategies, and samplers. We then discuss learned optimizers in further detail and their applications towards optimizing variational circuits. This talk also covers some lessons learned starting a spin-off from academia.

Solving classical and quantum physics many-body systems are amongst the hardest problems in the natural sciences, but also of fundamental importance for applications such as material and drug design. In this talk, I will give a an overview of fundamental physics problems at multiple time- and lengthscales and describe deep learning methods to address them: 1) solving the quantum-chemical electronic Schrödinger equation with deep variational Monte Carlo, 2) learning to coarse-grain many-body systems, and 3) sampling equilibrium states of classical many-body systems with generative learning.

So far artificial neural networks have been applied to discover phase diagrams in many different physical models. However, none of these studies have revealed any fundamentally new physics. A major problem is that these neural networks are mainly considered as black box algorithms. On the journey to detect new physics it is important to interpret what artificial neural networks learn. On the one hand this allows us to judge whether to trust the results, and on the other hand this can give us insight to possible new physics. In this talk I will 
discuss applications to different models where we successfully interpreted what was learned by the neural networks.

We implement projective quantum Monte Carlo (PQMC) methods to simulate quantum annealing on classical computers. We show that in the regime where the systematic errors are well controlled, PQMC algorithms are capable of simulating the imaginary-time dynamics of the Schroedinger equation both on continuous space models and discrete basis systems. We also demonstrate that the tunneling time of the PQMC method is quadratically faster than the one of incoherent quantum annealing. It shows remarkable stability when applied to frustrated systems compared to finite-temperature path integral Monte Carlo algorithm, the method mostly chosen to do comparisons with quantum annealers. However, a major drawback of the PQMC method comes from the finite number of random walkers needed
to implement the simulations. It grows exponentially with the system size when no or poor guiding wave-functions are utilized. Nevertheless, we demonstrate that when good enough guiding wave-functions are used – in our case we choose artificial neural networks – the computational complexity seems to go from exponential to polynomial in the system size. We advocate for a search of more efficient guiding wave functions since they could determine when PQMC simulations are feasible on classical computers, a question closely related to a provable need or speed-up of a quantum computer.

References:
- E. M. Inack and S. Pilati, Phys. Rev. E 92, 053304 (2015)
- E. M. Inack, G. Giudici, T. Parolini, G. Santoro and S. Pilati, Phys. Rev. A 97, 032307 (2018)
- E. M. Inack, G. Santoro, L. Dell’Anna, and S. Pilati, arXiv:1809.03562v1

We propose to generalise classical maximum likelihood learning to density matrices. As the objective function, we propose a quantum likelihood that is related to the cross entropy between density matrices. We apply this learning criterion to the quantum Boltzmann machine (QBM), previously proposed by Amin et al. We demonstrate for the first time learning a quantum Hamiltonian from quantum statistics using this approach. For the anti-ferromagnetic Heisenberg and XYZ model we recover the true ground state wave function and Hamiltonian. The second contribution is to apply quantum learning to learn from classical data. Quantum learning uses in addition to the classical statistics also quantum statistics for learning. These statistics may violate the Bell inequality, as in the quantum case. Maximizing the quantum likelihood yields results that are significantly more accurate than the classical maximum likelihood approach in several cases. We give an example how the QBM can learn a strongly non-linear problem such as the parity problem. The solution shows entanglement, quantified by the entanglement entropy.

Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning inspired approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap Tr(rho*sigma) between two quantum states rho and sigma. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to rho=sigma, quantifies the Renyi entanglement. Here, we find algorithms that have shorter depths than the Swap Test, including one that has constant depth (independent of problem size). Furthermore, we apply our approach to the hardware-specific connectivity and gate alphabets used by Rigetti's and IBM's quantum computers and demonstrate that the shorter algorithms that we derive significantly reduce the error - compared to the Swap Test - on these computers.

Time series data contains useful information on the phase of a system. Here we propose the use of recurrent neural networks (LSTM) to learn and extract such information in order to classify phases and locate phase boundaries. We demonstrate this on a many-body localized model, and attempt to interpret the learned behavior by looking at individual LSTM cells. We also discuss the validity of the learned model and investigate its limits.