Related papers: Refining Ky Fan's majorization relation with linea…
We show that interval partition functions (transition amplitudes) of three-dimensional $N = 2$ theories admit factorizations into sums of products of hemisphere partition functions with additional normalization factors. We prove the…
An important problem in quantum information theory is the mathematical characterization of the phenomenon of quantum catalysis: when can the surrounding entanglement be used to perform transformations of a jointly held quantum state under…
Factorization of quantum mechanical Hamiltonians has been a useful technique for some time. This procedure has been given an elegant description by supersymmetric quantum mechanics, and the subject has become well-developed. We demonstrate…
We consider semidefinite programs (SDPs) of size n with equality constraints. In order to overcome scalability issues, Burer and Monteiro proposed a factorized approach based on optimizing over a matrix Y of size $n$ by $k$ such that $X =…
Quantum channels represent a broad spectrum of operations crucial to quantum information theory, encompassing everything from the transmission of quantum information to the manipulation of various resources. In the domain of states, the…
We examine the problem of approximating a positive, semidefinite matrix $\Sigma$ by a dyad $xx^T$, with a penalty on the cardinality of the vector $x$. This problem arises in sparse principal component analysis, where a decomposition of…
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…
We primarily consider bilevel programs where the lower level is a convex quadratic minimization problem under integer constraints. We show that it is $\Sigma_2^p$-hard to decide if the optimal objective for the leader is lesser than a given…
We study the computational complexity of decision problems in $k$-level linear programming (LP). Seminal work by Jeroslow establishes that determining whether the optimal objective value of a $k$-level LP is at least as good as a given…
The logic programming paradigm provides the basis for a new intensional view of higher-order notions. This view is realized primarily by employing the terms of a typed lambda calculus as representational devices and by using a richer form…
Regularization techniques are widely employed in optimization-based approaches for solving ill-posed inverse problems in data analysis and scientific computing. These methods are based on augmenting the objective with a penalty function,…
Linear superiorization (abbreviated: LinSup) considers linear programming (LP) problems wherein the constraints as well as the objective function are linear. It allows to steer the iterates of a feasibility-seeking iterative process toward…
In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors…
Quantum signal processing (QSP) represents a real scalar polynomial of degree $d$ using a product of unitary matrices of size $2\times 2$, parameterized by $(d+1)$ real numbers called the phase factors. This innovative representation of…
An expansion for quantum statistical mechanics is derived that gives classical statistical mechanics as the leading term. Each quantum correction comes from successively larger permutation loops, which arise from the factorization of the…
It is shown that the scaling operators in the conformal limit of a two-dimensional field theory have massive form factors which obey a simple factorisation property in rapidity space. This has been used to identify such operators within the…
Maximizing the precision in estimating parameters in a quantum system subject to instrumentation constraints is cast as a convex optimization problem. We account for prior knowledge about the parameter range by developing a worst-case and…
Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…
Semidefinite relaxations of polynomial optimization have become a central tool for addressing the non-convex optimization problems over non-commutative operators that are ubiquitous in quantum information theory and, more in general,…