Scientific Series

Many-body localization generalizes the concept of Anderson localization (i.e. single particle localization) to isolated interacting systems, where many-body eigenstates in the presence of sufficiently strong disorder can be localized in a region of Hilbert space even at nonzero temperature. This is an example of ergodicity breaking, which manifests failure of thermalization or more specifically the break down of eigenstate-thermalization hypothesis.

In this talk, I enquire into the quasi many-body localization in topologically ordered states of matter, revolving around the case of Kitaev toric code on the ladder geometry, where different types of anyonic defects carry different masses induced by environmental errors.  Our study verifies that the presence of anyons generates a complex energy landscape solely through braiding statistics, which suffices to suppress the diffusion of defects in such clean, multicomponent anyonic liquid. This nonergodic dynamics suggests a promising scenario for investigation of quasi many-body localization.  Our results unveil how self-generated disorder ameliorates the vulnerability of topological order away from equilibrium. This setting provides a new platform which paves the way toward impeding logical errors by self-localization of anyons in a generic, high energy state, originated exclusively in their exotic statistics.

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.

The role of coherence in quantum thermodynamics has been extensively studied in the recent years and it is now well-understood that coherence between different energy eigenstates is a resource independent of other thermodynamics resources, such as work. A fundamental remaining open question is whether the laws of quantum mechanics and thermodynamics allow the existence a "coherence distillation machine", i.e. a machine that, by possibly consuming work, obtains pure coherent states from mixed states, at a nonzero rate. This question is related to another fundamental question: Starting from many copies of noisy quantum clocks which are (approximately) synchronized with a reference clock, can we distill synchronized clocks in pure states, at a non-zero rate? In this paper we study quantities called "coherence cost" and "distillable coherence", which determine the rate of conversion of coherence in a standard pure state to general mixed states, and vice versa, in the context of quantum thermodynamics. We find that the coherence cost of any state (pure or mixed) is determined by its Quantum Fisher Information (QFI), thereby revealing a novel operational interpretation of this central quantity of quantum metrology. On the other hand, we show that, surprisingly, distillable coherence is zero for typical (full-rank) mixed states. Hence, we establish the impossibility of coherence distillation machines in quantum thermodynamics, which can be compared with the impossibility of perpetual motion machines or cloning machines. To establish this result, we introduce a new additive quantifier of coherence, called the "purity of coherence", and argue that its relation with QFI is analogous to the relation between the free and total energies in thermodynamics.

In general relativity, the picture of space–time assigns an ideal clock to each world line. Being ideal, gravitational effects due to these clocks are ignored and the flow of time according to one clock is not affected by the presence of clocks along nearby world lines. However, if time is defined operationally, as a pointer position of a physical clock that obeys the principles of general relativity and quantum mechanics, such a picture is, at most, a convenient fiction. Specifically, we show that the general relativistic mass–energy equivalence implies gravitational interaction between the clocks, whereas the quantum mechanical superposition of energy eigenstates leads to a nonfixed metric background. Based only on the assumption that both principles hold in this situation, we show that the clocks necessarily get entangled through time dilation effect, which eventually leads to a loss of coherence of a single clock. Hence, the time as measured by a single clock is not well defined. However, the general relativistic notion of time is recovered in the classical limit of clocks.

We present a new solution to the Hierarchy Problem utilizing non-linearly realized discrete symmetries. The cancelations occur due to a discrete symmetry that is realized as a shift symmetry on the scalar and as an exchange symmetry on the particles with which the scalar interacts. We show how this mechanism can be used to solve the Little Hierarchy Problem as well as give rise to light axions.

Convex optimization, linear and semidefinite programming in particular, has been a standard tool in quantum information theory, giving certificates of local and quantum correlations, contextuality, and more. Increasingly, similar methods are making headways in quantum many-body physics, giving lower bounds -- and thus certificates -- on the ground state energy. The disadvantage of such methods is that they do not scale well to large system sizes, whether those systems are multiparty Bell scenarios or lattice models of numerous sites. Machine
learning is entering the field as the latest buzzword. While it provides a more scalable alternative to convex programming and enables forming new conjectures, the outcome of learning methods remains uncertified. In this talk, I introduce the most important paradigms in machine learning for quantum information theory, give an overview of some earlier work in the field, argue for the importance of certifiable predictions of learning algorithms, and present some of our preliminary results.

Three fundamental factors determine the quality of a statistical learning algorithm: expressiveness, generalization and optimization.  The classic strategy for handling these factors is relatively well understood.  In contrast, the radically different approach of deep learning, which in the last few years has revolutionized the world of artificial intelligence, is shrouded by mystery.  This talk will describe a series of works aimed at unraveling some of the mysteries revolving expressiveness, arguably the most prominent factor behind the success of deep learning.  I will begin by showing that state of the art deep learning architectures, such as convolutional networks, can be represented as tensor networks -- a computational model commonly employed in quantum physics.  This connection will inspire the use of quantum entanglement for defining measures of data correlations modeled by deep networks.  Next, I will turn to a quantum max-flow / min-cut theorem characterizing the entanglement captured by tensor networks.  This theorem will give rise to new results that shed light on expressiveness in deep learning, and in addition, provide new tools for deep network design.

Works covered in the talk were in collaboration with Yoav Levine, Or Sharir, David Yakira and Amnon Shashua.

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.

Despite being broadly accepted nowadays, temperature gradients in thermal equilibrium states continue to cause confusion, since they naively seem to contradict the laws of classical thermodynamics. In this talk, we will explore the physical meaning behind this concept, specifically discussing the role played by the university of free fall. We will show that temperature, just like time, is an observer dependent quantity and discuss why gravity is the only force capable of causing equilibrium thermal gradients without violating any of the laws of thermodynamics. We will also demonstrate that significant care and delicacy are necessary when extending Tolman's results to distinct classes of heat baths in stationary spacetimes.

I’ll describe a novel application for near-term quantum computers with 50-70 qubits: namely, generating cryptographic random bits, whose randomness can be certified even if the quantum computer is untrusted (e.g., has been backdoored by an adversary).  Unlike schemes based on Bell inequality violation, ours requires only a single device able to solve classically hard sampling problems.  Our protocol harvests the outputs of the sampling process and feeds them into a randomness extractor, while occasionally verifying the outputs using exponential classical time.  I’ll also compare to the beautiful independent work of Brakerski et al., who proposed a scheme for the same problem that has much more efficient verification, but that probably can’t be implemented on near-term devices.  Paper still in preparation.

In physics, every observation is made with respect to a frame of reference. Although reference frames are usually not considered as degrees of freedom, in all practical situations it is a physical system which constitutes a reference frame. Can a quantum system be considered as a reference frame and, if so, which description would it give of the world? The relational approach to physics suggests that all the features of a system —such as entanglement and superposition— are observer-dependent: what appears classical from our usual laboratory description might appear to be in a superposition, or entangled, from the point of view of such a quantum reference frame. In this work, we develop an operational framework for quantum theory to be applied within quantum reference frames. We find that, when reference frames are treated as quantum degrees of freedom, a more general transformation between reference frames has to be introduced. With this transformation we describe states, measurement, and dynamical evolution in different quantum reference frames, without appealing to an external, absolute reference frame. The transformation also leads to a generalisation of the notion of covariance of dynamical physical laws, which we explore in the case of ‘superposition of Galilean translations’ and ‘superposition of Galilean boosts’. In addition, we consider the situation when the reference frame moves in a ‘superposition of accelerations’, which leads us to extend the validity of the weak equivalence principle to quantum reference frames.