English
Related papers

Related papers: On a matrix inequality related to the distillabili…

200 papers

Recent advances in deep learning has lead to rapid developments in the field of image retrieval. However, the best performing architectures incur significant computational cost. Recent approaches tackle this issue using knowledge…

Computer Vision and Pattern Recognition · Computer Science 2020-07-14 Zakaria Laskar , Juho Kannala

The aim of this paper is to prove an improved version of the bounded differences inequality for matrix valued functions, by developing the methods of Mackey et al.: "Matrix Concentration Inequalities via the Method of Exchangeable Pairs".…

Probability · Mathematics 2013-02-20 Daniel Paulin

Quantum channels generally reduce the distinguishability of quantum states, limiting information transmission and processing. Previous work introduced a protocol capable of increasing the distinguishability of states after the action of a…

Quantum Physics · Physics 2026-05-08 Gabriel M. Arantes , Barbara Amaral , Nadja K. Bernardes

We consider algorithms with access to an unknown matrix $M\in\mathbb{F}^{n \times d}$ via matrix-vector products, namely, the algorithm chooses vectors $\mathbf{v}^1, \ldots, \mathbf{v}^q$, and observes $M\mathbf{v}^1,\ldots,…

Computational Complexity · Computer Science 2019-11-11 Xiaoming Sun , David P. Woodruff , Guang Yang , Jialin Zhang

We investigate the separability of quantum states based on covariance matrices. Separability criteria are presented for multipartite states. The lower bound of concurrence proposed in Phys. Rev. A. 75, 052320 (2007) is improved by…

Quantum Physics · Physics 2009-09-29 Ming Li , Shao-Ming Fei , Zhi-Xi Wang

We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…

Optimization and Control · Mathematics 2012-07-03 Vijay Krishnamurthy , Alexandre d'Aspremont

Quantum discord refers to an important aspect of quantum correlations for bipartite quantum systems. In our earlier works we have shown that corresponding to every graph (combinatorial) there are quantum states whose properties are…

Quantum Physics · Physics 2019-03-20 Supriyo Dutta , Bibhas Adhikari , Subhashish Banerjee

The one-parameter family of second order nonlinear difference equations each of which is given by $$ x_{n-1}x_nx_{n+1}=x_{n-1}+(x_n)^{\beta-1}+x_{n+1} \qquad(\beta\in\mathbb{N}) $$ is explored. Since the equation above is arising from seed…

Exactly Solvable and Integrable Systems · Physics 2019-07-31 Atsushi Nobe , Junta Matsukidaira

Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…

Systems and Control · Electrical Eng. & Systems 2025-12-23 Jan Schneider , Julian Berberich

We consider the problem of selecting non-zero entries of a matrix $A$ in order to produce a sparse sketch of it, $B$, that minimizes $\|A-B\|_2$. For large $m \times n$ matrices, such that $n \gg m$ (for example, representing $n$…

Machine Learning · Computer Science 2013-11-20 Dimitris Achlioptas , Zohar Karnin , Edo Liberty

The statistics of gaps between quantum energy levels is a hallmark criterion in quantum chaos and quantum integrability studies. The relevant distributions corresponding to exactly integrable vs. fully chaotic systems are universal and…

Statistical Mechanics · Physics 2026-04-27 Ben Craps , Marine De Clerck , Oleg Evnin , Maxim Pavlov

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…

Computational Complexity · Computer Science 2019-04-03 Mrinal Kumar , Ben Lee Volk

We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.

Group Theory · Mathematics 2013-12-18 Igor Rivin

We study the explicit relation between violation of Bell inequalities and bipartite distillability of multi-qubit states. It has been shown that even though for $N\ge 8$ there exist $N$-qubit bound entangled states which violates a Bell…

Quantum Physics · Physics 2009-11-13 Soojoon Lee , Jinhyoung Lee , Jaewan Kim

Matrix theory, foundational in diverse fields such as mathematics, physics, and computational sciences, typically categorizes matrices based strictly on their invertibility-determined by a sharply defined singular or nonsingular…

Quantum Physics · Physics 2025-07-29 L. Yildiz , D. Kayki , E. Gudekli

Divergence chain rules for channels relate the divergence of a pair of channel inputs to the divergence of the corresponding channel outputs. An important special case of such a rule is the data-processing inequality, which tells us that if…

Quantum Physics · Physics 2024-05-21 Mario Berta , Marco Tomamichel

In this paper, we propose a new adaptation of the D-iteration algorithm to numerically solve the differential equations. This problem can be reinterpreted in 2D or 3D (or higher dimensions) as a limit of a diffusion process where the…

Numerical Analysis · Computer Science 2012-04-25 Dohy Hong

We derive Lieb-Thirring inequalities for the Riesz means of eigenvalues of order gamma >= 3/4 for fourth order Schr\"odinger operators in arbitrary dimensions. We also consider some extensions to polyharmonic operators, and to systems of…

Mathematical Physics · Physics 2007-05-23 Clemens Förster , Jörgen Östensson

We show that axially symmetric solutions on $\mathbb{S}^4$ to a constant $Q$-curvature type equation (it may also be called fourth order mean field equation) must be constant, provided that the parameter $\alpha$ in front of the Paneitz…

Analysis of PDEs · Mathematics 2021-09-29 Changfeng Gui , Yeyao Hu , Weihong Xie

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

Discrete Mathematics · Computer Science 2013-06-21 Tomás Feder , Pavol Hell , Oren Shklarsky