Related papers: Dressed quantum graphs with optical nonlinearities…
The capacity of unifilar finite-state channels in the presence of feedback is investigated. We derive a new evaluation method to extract graph-based encoders with their achievable rates, and to compute upper bounds to examine their…
Combining insights from machine learning and quantum Monte Carlo, the stochastic reconfiguration method with neural network Ansatz states is a promising new direction for high-precision ground state estimation of quantum many-body problems.…
Quantum graph states are critical resources for various quantum algorithms, and also determine essential interconnections in distributed quantum computing. There are two schemes for generating graph states probabilistic scheme and…
The color code is both an interesting example of an exactly solved topologically ordered phase of matter and also among the most promising candidate models to realize fault-tolerant quantum computation with minimal resource overhead. The…
Let $G=(V,E)$ be a simple graph of maximum degree $\Delta$. The edges of $G$ can be colored with at most $\Delta +1$ colors by Vizing's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\Delta$ colors.…
Studies of quantum metrology have shown that the use of many-body entangled states can lead to an enhancement in sensitivity when compared to product states. In this paper, we quantify the metrological advantage of entanglement in a setting…
In the framework of dielectric theory the static non-local self-energy of an electron near an ultra-thin polarizable layer has been calculated and applied to study binding energies of image-states near free-standing graphene. The…
We have applied our recent approach (Kargarian, et.al Phys. Rev. A 76, 60304 (R) (2007)) to study the quantum information properties of the anisotropic s=1/2 Heisenberg chain. We have investigated the underlying quantum information…
Graph rewriting is a popular tool for the optimisation and modification of graph expressions in domains such as compilers, machine learning and quantum computing. The underlying data structures are often port graphs - graphs with labels at…
In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form $$ \kappa({\mathcal U}) \le…
Foundation models, or large atomistic models (LAMs), aim to universally represent the ground-state potential energy surface (PES) of atomistic systems as defined by density functional theory (DFT). The scaling law is pivotal in the…
The Kuramoto model can be formulated as a gradient flow on a nonconvex energy landscape of the form $E(\boldsymbol{\theta}) := \frac{1}{2} \sum_{1\le i,j\le n} A_{ij}\bigl(1-\cos(\theta_i-\theta_j)\bigr).$ A fundamental question is to…
The problem of chromatic thresholds seeks for minimum degree conditions that ensure $H$-free graphs to have a bounded chromatic number, or equivalently a bounded size homomorphic image. The strengthened homomorphism thresholds problem…
We study cumulants of numbers of $q$-step walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity.…
Complex networks are everywhere. They appear for example in the form of biological networks, social networks, or computer networks and have been studied extensively. Efficient algorithms to solve problems on complex networks play a central…
We demonstrate how to map out the phase diagram of a two dimensional quantum many body system with no prior physical knowledge by applying deep \textit{anomaly detection} to ground states from infinite projected entangled pair state…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
These lectures advocate the idea that quantum entanglement provides a unifying foundation for both statistical physics and high-energy interactions. I argue that, at sufficiently long times or high energies, most quantum systems approach a…
Entanglement is one of the key resources required for quantum computation, so experimentally creating and measuring entangled states is of crucial importance in the various physical implementations of a quantum computer. In superconducting…
We consider two particular 1D quantum many-body systems with local interactions related to the root system $C_N$. Both models describe identical particles moving on the half-line with non-trivial boundary conditions at the origin, and they…