相关论文: Efficient computation of average subsystem Bures d…

We use network analysis to describe and characterize an archetypal quantum system - an Ising spin chain in a transverse magnetic field. We analyze weighted networks for this quantum system, with link weights given by various measures of…

A Gaussian degree of entanglement for a symmetric two-mode Gaussian state can be defined as its distance to the set of all separable two-mode Gaussian states. The principal property that enables us to evaluate both Bures distance and…

Bures distance holds a special place among various distance measures due to its several distinguished features and finds applications in diverse problems in quantum information theory. It is related to fidelity and, among other things, it…

This paper proposes a model-free distribution system state estimation method based on tensor completion using canonical polyadic decomposition. In particular, we consider a setting where the network is divided into multiple areas. The…

There is a lack of simple and scalable algorithms for uncertainty quantification. Bayesian methods quantify uncertainty through posterior and predictive distributions, but it is difficult to rapidly estimate summaries of these…

Problems involving disordered systems are usually analyzed for systems with random disorder. However, there are many systems in which the main disorder involves clusters with correlated differences between their properties and those of the…

We numerically investigate the low-lying entanglement spectrum of the ground state of random one-dimensional spin chains obtained after partition of the chain into two equal halves. We consider two paradigmatic models: the spin-1/2 random…

The time evolution of the trace distance between two states of an open quantum system may increase due to initial system-environment correlations, thus exhibiting a breakdown of distance contractivity of the reduced dynamics. We analyze how…

We study the accuracy of the divide-and-conquer method for electronic structure calculations. The analysis is conducted for a prototypical subdomain problem in the method. We prove that the pointwise difference between electron densities of…

Based on a relationship with continuous-time random walks discovered by Igl\'oi, Turban, and Rieger [Phys. Rev. E {\bf 59}, 1465 (1999)], we derive exact lower and upper bounds on the lowest energy gap of open transverse-field Ising chains,…

The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing k-truss. Compared with k-core…

We study transport in spin chains employing the Thouless approach based on the level sensitivity to the boundary conditions, $R$. Although spin transport in the integrable easy-axis XXZ model is diffusive, corresponding $R$ is much closer…

We introduce a general approach to traces that we consider as linear continuous functionals on some function space where we focus on some special choices for that space. This leads to an integral calculus for the computation of the precise…

Engineered infrastructure systems pose inverse problems in which hidden states, unknown parameters, and subsystem couplings must be inferred from sparse and noisy measurements. These problems are difficult because physical subsystems are…

Gaussian processes are a powerful framework for quantifying uncertainty and for sequential decision-making but are limited by the requirement of solving linear systems. In general, this has a cubic cost in dataset size and is sensitive to…

The ground-state degeneracy of the quantum spin system is a characteristic of nontrivial topology, when it is gapped and robust against disordered perturbation. The corresponding quantum phase transition (QPT) is usually driven by a real…

Advances in leveraging Gaussian processes (GP) have enabled learning and inferring dynamic grid behavior from scarce PMU measurements. However, real measurements can be corrupted by various random and targeted threats, leading to inaccurate…

We recently showed [Phys. Rev. Lett. 121, 220602 (2018)] that the average bipartite entanglement entropy of all energy eigenstates of the quantum Ising chain exhibits a universal (for translationally invariant quadratic fermionic models)…

This paper addresses the aggregated monitoring problem for large-scale network systems with a few dedicated sensors. Full state estimation of such systems is often infeasible due to unobservability and/or computational infeasibility.…

In quantum information, trace distance is a basic metric of distinguishability between quantum states. However, there is no known efficient approach to estimate the value of trace distance in general. In this paper, we propose efficient…