English
Related papers

Related papers: Better bound on the exponent of the radius of the …

200 papers

Absolute separable states is a kind of separable state that remain separable under the action of any global unitary transformation. These states may or may not have quantum correlation and these correlations can be measured by quantum…

Quantum Physics · Physics 2021-12-14 Satyabrata Adhikari

In this paper, an intuitive approach is employed to generalize the full separability criterion of tripartite quantum states of qubits to the higher-dimensional systems (Phys. Rev. A \textbf{72}, 022333 (2005)). A distinct characteristic of…

Quantum Physics · Physics 2009-11-13 Chang-shui Yu , He-shan Song

Globally optimizing a nonconvex quadratic over the intersection of $m$ balls in $\mathbb{R}^n$ is known to be polynomial-time solvable for fixed $m$. Moreover, when $m=1$, the standard semidefinite relaxation is exact. When $m=2$, it has…

Optimization and Control · Mathematics 2023-10-31 Samuel Burer

In a previous study (quant-ph/9911058), several remarkably simple exact results were found, in certain specialized m-dimensional scenarios (m<5), for the a priori probability that a pair of qubits is unentangled/separable. The measure used…

Quantum Physics · Physics 2007-05-23 Paul B. Slater

Calculating bounds of properties of many-body quantum systems is of paramount importance, since they guide our understanding of emergent quantum phenomena and complement the insights obtained from estimation methods. Recent semidefinite…

Quantum Physics · Physics 2026-01-16 Luke Mortimer , Leonardo Zambrano , Antonio Acín , Donato Farina

We study the maximum entanglement that can be produced by a global unitary transformation for systems of two and three qubits constrained to the fully symmetric states. This restriction to the symmetric subspace appears naturally in the…

Quantum Physics · Physics 2023-09-27 E. Serrano-Ensástiga , J. Martin

Motivated by the notions of $k$-extendability and complete extendability of the state of a finite level quantum system as described by Doherty et al (Phys. Rev. A, 69:022308), we introduce parallel definitions in the context of Gaussian…

Quantum Physics · Physics 2017-09-13 B. V. Rajarama Bhat , K. R. Parthasarathy , Ritabrata Sengupta

We study the fully entangled fraction of quantum states. An upper bound is obtained for arbitrary dimensional bipartite systems. This bound is shown to be exact for the case of two-qubit systems. An inequality related the fully entangled…

Quantum Physics · Physics 2009-11-13 Ming Li , Shao-Ming Fei , Zhi-Xi Wang

The present methods for obtaining the optimal Lewenestein- Sanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein-Sanpera decomposition by using…

Quantum Physics · Physics 2007-05-23 M. A. Jafarizadeh , M. Mirzaee , M. Rezaee

The complete learning of an $n$-qubit quantum state requires samples exponentially in $n$. Several works consider subclasses of quantum states that can be learned in polynomial sample complexity such as stabilizer states or high-temperature…

Quantum Physics · Physics 2023-09-19 Liming Zhao , Naixu Guo , Ming-Xing Luo , Patrick Rebentrost

In this study, we investigate the problem of determining the maximum purity for absolutely separable and absolutely PPT quantum states. From the geometric viewpoint, this problem is equivalent to asking for the exact Euclidean radius of the…

Mathematical Physics · Physics 2025-10-23 Hoang Phi Dung , Vu The Khoi

Let $M$ be a compact $n$-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary $\partial M$. Assume that the mean curvature $H$ of the boundary $\partial M$ satisfies $H \geq (n-1) k >0$ for some positive…

Differential Geometry · Mathematics 2020-01-06 Martin Li

Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…

Quantum Physics · Physics 2007-05-23 Lawrence M. Ioannou

In ``Decoherence of macroscopic closed systems within Newtonian quantum gravity'' (Kay B S 1998 Class. Quantum Grav. 15 L89-L98) it was argued that, given a many-body Schroedinger wave function \psi(x_1,...,x_N) for the centre-of-mass…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Varqa Abyaneh , Bernard S. Kay

The radius of the outer Dikin ellipsoid of the intersection of $m$ ellipsoids due to Fu et al. (J. Comb. Optim., 2, 29-50, 1998) is corrected from $m$ to $\sqrt{m^2+m}$. The approximation bound for the general convex quadratic constrained…

Optimization and Control · Mathematics 2021-10-22 Tongli Zhang , Yong Xia

We analyze a class of quantum spin models defined on half-spaces in the $d$-dimensional hypercubic lattice bounded by a hyperplane with inward unit normal vector $m\in\mathbb{R}^d$. The family of models was previously introduced as the…

Mathematical Physics · Physics 2016-08-25 Michael Bishop , Bruno Nachtergaele , Amanda Young

We discuss the problem of characterizing upper bounds on entanglement in a bipartite quantum system when only the reduced density matrices (marginals) are known. In particular, starting from the known two-qubit case, we propose a family of…

Most quantum gate errors can be characterized by two error models, namely the probabilistic error model and the Kraus error model. We proved that for a quantum circuit with either of those two models or a mix of both, the propagation error…

Quantum Physics · Physics 2022-09-07 Ziang Yu , Yingzhou Li

This paper develops new semidefinite programming (SDP) relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation performance. The first class of problem…

Optimization and Control · Mathematics 2014-03-18 Zi Xu , Mingyi Hong

In the Metric Capacitated Covering (MCC) problem, given a set of balls $\mathcal{B}$ in a metric space $P$ with metric $d$ and a capacity parameter $U$, the goal is to find a minimum sized subset $\mathcal{B}'\subseteq \mathcal{B}$ and an…

Data Structures and Algorithms · Computer Science 2020-06-23 Sayan Bandyapadhyay