Related papers: Learning with errors may remain hard against quant…
This dissertation reviews several recent advances at the intersection of quantum information and holography. In holography, properties of quantum systems admit a gravitational interpretation via the AdS/CFT correspondence. For holographic…
Entanglement calculations in quantum field theories are extremely challenging and typically rely on the replica trick, where the problem is rephrased in a study of defects. We demonstrate that the use of deep generative models drastically…
We investigate the concept of time-like entanglement entropy (tEE) within the framework of holography. We introduce a robust top-down prescription for computing tEE in higher-dimensional QFTs, both conformal and confining, eliminating the…
An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests: we need a test that not only can be passed…
Spatiotemporal forecasting in physical systems, such as large-scale traffic networks, requires modeling a dual dynamic: continuous macroscopic rhythms and discrete, unpredictable microscopic shocks. While Neural Ordinary Differential…
We study holographic entanglement entropy in four-dimensional quantum gravity with negative cosmological constant. By using the replica trick and evaluating path integrals in the minisuperspace approximation, in conjunction with the…
Contrastive learning (CL) aims to preserve relational structure between samples by learning representations that reflect a similarity graph. Yet, the geometry of the resulting embeddings remains poorly understood. Here we show that weighted…
We define a new information theoretic quantity called odd entanglement entropy (OEE) which enables us to compute the entanglement wedge cross section in holographic CFTs. The entanglement wedge cross section has been introduced as a minimal…
The Learning with Errors (LWE) problem receives much attention in cryptography, mainly due to its fundamental significance in post-quantum cryptography. Among its solving algorithms, the Blum-Kalai-Wasserman (BKW) algorithm, originally…
Maximum entropy inference and learning of graphical models are pivotal tasks in learning theory and optimization. This work extends algorithms for these problems, including generalized iterative scaling (GIS) and gradient descent (GD), to…
In the AdS/CFT correspondence, it is often convenient to regulate infinite quantities in asymptotically anti-de Sitter spacetimes by introducing a sharp cutoff in a radial coordinate. This procedure is a priori coordinate-dependent, and may…
Recent papers have formulated the problem of learning graphs from data as an inverse covariance estimation with graph Laplacian constraints. While such problems are convex, existing methods cannot guarantee that solutions will have specific…
Hole-ography is a prescription relating the areas of surfaces in an AdS bulk to the differential entropy of a family of intervals in the dual CFT. In (2+1) bulk dimensions, or in higher dimensions when the bulk features a sufficient degree…
The AdS/CFT correspondence realises the holographic principle where information in the bulk of a space is encoded at its border. We are yet a long way from a full mathematical construction of AdS/CFT, but toy models in the form of…
We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does…
We study the complexity of PAC learning halfspaces in the presence of Massart noise. In this problem, we are given i.i.d. labeled examples $(\mathbf{x}, y) \in \mathbb{R}^N \times \{ \pm 1\}$, where the distribution of $\mathbf{x}$ is…
We develop a holographic framework for computing timelike entanglement entropy (tEE) in quantum field theories, extending the Ryu-Takayanagi prescription into Lorentzian settings. Using three broad classes of supergravity backgrounds, we…
This is a survey on some topics in Lattice based cryptography and Homomorphic Encryption. In particular, we define some lattice problems, LWE and RLWE, and state the reductions given by Regev and Peikert. We also give a full treatment of…
Entanglement entropies are notoriously difficult to compute. Large-N strongly-coupled holographic CFTs are an important exception, where the AdS/CFT dictionary gives the entanglement entropy of a CFT region in terms of the area of an…
In this work, we study the solution of shortest vector problems (SVPs) arising in terms of learning with error problems (LWEs). LWEs are linear systems of equations over a modular ring, where a perturbation vector is added to the right-hand…