Related papers: Flexible constrained de Finetti reductions and app…
It has long been postulated that within density-functional theory (DFT) the total energy of a finite electronic system is convex with respect to electron count, so that 2 E_v[N_0] <= E_v[N_0 - 1] + E_v[N_0 + 1]. Using the…
Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated interacting quantum many-particle systems. For the simplest spinless systems, with say $m$ particles in $N$ single particle states…
Learning physical properties of high-dimensional states is crucial for developing quantum technologies but usually consumes an exceedingly large number of samples which are difficult to afford in practice. In this Letter, we use the…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general…
Affine variables, which have the virtue of preserving the positive-definite character of matrix-like objects, have been suggested as replacements for the canonical variables of standard quantization schemes, especially in the context of…
The well-known Schmidt decomposition, or equivalently, the complex singular value decomposition, states that a pure quantum state of a bipartite system can always be brought into a "diagonal" form using local unitary transformations. In…
We present a framework for investigating the response of conformally-invariant confined 1+1-dimensional systems to a quantum quench. While conformal invariance is generally destroyed in a global quantum quench, systems that can be described…
Reductions---rules that reduce input size while maintaining the ability to compute an optimal solution---are critical for developing efficient maximum independent set algorithms in both theory and practice. While several simple reductions…
We study different aspects of integrable boundary quantum field theories, focusing mostly on the ``boundary sine-Gordon model'' and its applications to condensed matter physics. The first part of the review deals with formal problems. We…
We describe our recent results on the resonant perturbation theory of decoherence and relaxation for quantum system with many qubits. The approach represents a rigorous analysis of the phenomenon of decoherence and relaxation for general…
It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly…
We show finite-size bounds on the deviation of the optimal type II error from its asymptotic value in the quantum hypothesis testing problem of Stein's lemma with composite null-hypothesis. The proof is based on some simple properties of a…
Information theory provides tools to predict the performance of a learning algorithm on a given dataset. For instance, the accuracy of learning an unknown parameter can be upper bounded by reducing the learning task to hypothesis testing…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
Conformal field theory (CFT) has been extremely successful in describing large-scale universal effects in one-dimensional (1D) systems at quantum critical points. Unfortunately, its applicability in condensed matter physics has been limited…
The implicit convex feasibility problem attempts to find a point in the intersection of a finite family of convex sets, some of which are not explicitly determined but may vary. We develop simultaneous and sequential projection methods…
Exploiting permutation invariance to reduce the exponential scaling of semidefinite programs in quantum information has emerged as a powerful computational technique. In this work, we develop a systematic framework for using this reduction…
In this Thesis, several results in quantum information theory are collected, most of which use entropy as the main mathematical tool. *While a direct generalization of the Shannon entropy to density matrices, the von Neumann entropy behaves…
Decoherence is the fundamental obstacle limiting the performance of quantum information processing devices. The problem of transmitting a quantum state (known or unknown) from one place to another is of great interest in this context. In…