相关论文: Linear semi-infinite programming approach for enta…
This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the \emph{index stratification} of $\mathbb{S}^n$ and its lift…
Quantizing large language models has become a standard way to reduce their memory and computational costs. Typically, existing methods focus on breaking down the problem into individual layer-wise sub-problems, and minimizing per-layer…
We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are…
The Weighted Tree Augmentation Problem (WTAP) is a fundamental network design problem where the goal is to find a minimum-cost set of additional edges (links) to make an input tree 2-edge-connected. While a 2-approximation is standard and…
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify…
One of the major problems of most quantum computing applications is that the required number of qubits to solve a practical problem is much larger than that of today's quantum hardware. We propose an algorithm, called large-system sampling…
Given the limitations of current hardware, the theoretical gains promised by quantum computing remain unrealized across practical applications. But the gap between theory and hardware is closing, assisted by developments in quantum…
It is well known that entanglement can benefit quantum information processing tasks. Quantum illumination, when first proposed, is surprising as entanglement's benefit survives entanglement-breaking noise. Since then, many efforts have been…
Convex optimization problems arise naturally in quantum information theory, often in terms of minimizing a convex function over a convex subset of the space of hermitian matrices. In most cases, finding exact solutions to these problems is…
The detection and classification of entanglement properties in a two-qubit and a multi-qubit system is a topic of great interest. This topic has been extensively studied, and as a result, we discovered various approaches for detecting and…
We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes…
An universal approximation technique for analysis of different characteristics of states of composite infinite-dimensional quantum systems is proposed and used to prove general results concerning the properties of correlation and…
This paper investigates the asymptotic and non-asymptotic behavior of the quantized primal dual algorithm in network utility maximization problems, in which a group of agents maximize the sum of their individual concave objective functions…
Quantum measurement plays a crucial role in quantum metrology. Due to the limitations of experimental capabilities, collectively measuring multiple copies of probing systems can present significant challenges. Therefore, the concept of…
It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show…
An uniform LP duality is an useful property of conic matrix systems. A consistent linear conic optimization problem yields uniform LP duality if for any linear cost function, for which the primal problem has finite optimal value, the…
We study a two-stage mixed-integer linear program (MILP) with more than 1 million binary variables in the second stage. We develop a two-level approach by constructing a semi-coarse model (coarsened with respect to variables) and a coarse…
We present a primal-dual majorization-minimization method for solving large-scale linear programs. A smooth barrier augmented Lagrangian (SBAL) function with strict convexity for the dual linear program is derived. The…
We study local-realistic inequalities, Bell-type inequalities, for bipartite pure states of finite dimensional quantum systems -- qudits. There are a number of proposed Bell-type inequalities for such systems. Our interest is in relating…
We investigate the relation between the amount of entanglement localized on a chosen subsystem of a multi-qubit system via local measurements on the rest of the system, and the bipartite entanglement that is lost during this measurement…