Related papers: A quasipolynomial-time algorithm for the quantum s…
Quantum entanglement is an essential resource for quantum science and technology. However, entanglement detection and quantification, via typical entanglement measures such as linear entanglement entropy or negativity, can be a very…
Production and verification of multipartite quantum state are an essential step in quantum information processing. In this work, we propose an efficient method to decompose symmetric multipartite observables, which are invariant under…
We prove a version of the quantum de Finetti theorem: permutation-invariant quantum states are well approximated as a probabilistic mixture of multi-fold product states. The approximation is measured by distinguishability under fully…
A density operator of a bipartite quantum system is called robustly separable if it has a neighborhood of separable operators. Given a bipartite density matrix, its property to be robustly separable is reduced, using the continuous ensemble…
We study the distinguishability norms associated to families of locally restricted POVMs on multipartite systems. These norms (introduced by Matthews, Wehner and Winter) quantify how quantum measurements, subject to locality constraints,…
Quantum de Finetti theorems are a useful tool in the study of correlations in quantum multipartite states. In this paper we prove two new quantum de Finetti theorems, both showing that under tests formed by local measurements one can get a…
Separability is an important problem in theory of quantum entanglement. By using the Bloch representation of quantum states in terms of the Heisenberg-Weyl observable basis, we present a new separability criterion for bipartite quantum…
In this paper, we present a quasi-polynomial time classical algorithm that estimates the partition function of quantum many-body systems at temperatures above the thermal phase transition point. It is known that in the worst case, the same…
Strong bisimilarity on normed BPA is polynomial-time decidable, while weak bisimilarity on totally normed BPA is NP-hard. It is natural to ask where the computational complexity of branching bisimilarity on totally normed BPA lies. This…
We investigate optimal separable approximations (decompositions) of states rho of bipartite quantum systems A and B of arbitrary dimensions MxN following the lines of Ref. [M. Lewenstein and A. Sanpera, Phys. Rev. Lett. 80, 2261 (1998)].…
We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…
In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thom{\'e}, a quasi-polynomial time algorithm (QPA) is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of…
We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as Robust Semidefinite Programs (RSDP). We propose, using well known properties of RSDP, several…
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon…
Quantum entanglement has been regarded as one of the key physical resources in quantum information sciences. However, the determination of whether a mixed state is entangled or not is generally a hard issue, even for the bipartite system.…
In this paper, we present a method to solve the quantum marginal problem for symmetric $d$-level systems. The method is built upon an efficient semi-definite program that determines the compatibility conditions of an $m$-body reduced…
In this paper, we present a secure multiparty computation (SMC) protocol for least common multiple (LCM) based on Shor's quantum period-finding algorithm (QPA). Our protocol is based on the following principle: the connection of multiple…
Predicting observables in equilibrium states is a central yet notoriously hard question in quantum many-body systems. In the physically relevant thermodynamic limit, certain mathematical formulations of this task have even been shown to…
We derive tight quadratic inequalities for all kinds of hybrid separable-inseparable $n$-particle density operators on an arbitrary dimensional space. This methodology enables us to truly derive a tight quadratic inequality as tests for…