Related papers: A quasipolynomial-time algorithm for the quantum s…
We construct a density matrix whose elements are written in terms of expectation values of non-Hermitian operators and their products for arbitrary dimensional bipartite states. We then show that any expression which involves matrix…
Entangled quantum states can be given a separable decomposition if we relax the restriction that the local operators be quantum states. Motivated by the construction of classical simulations and local hidden variable models, we construct…
It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhedra with divisible capacities. The two polyhedra are the…
We investigate fully self-consistent multiscale quantum-classical algorithms on current generation superconducting quantum computers, in a unified approach to tackle the correlated electronic structure of large systems in both quantum…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures,…
Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the…
It is very crucial to know that whether the quantum state generated in the experiment is entangled or not. In the literature, this topic was studied extensively and researchers proposed different approaches for the detection of mixed…
We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove…
Presence of correlations among the constituent quantum systems has a great relevance in thermodynamics. Significant efforts have been devoted to investigate the role of correlations in work extraction, among others. Here, we derive a bound…
Recently, a new and powerful separability criterion was introduced in [O. Rudolph, quant-ph/0202121] and [Chen {\it et al.}, quant-ph/0205017]. Composing the main idea behind the above criterion and the necessary and sufficient condition in…
We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The…
In this paper, we investigate the critical efficiency of detectors to observe Bell nonlocality using multiple copies of the maximally entangled two-qubit state carried by a single pair of particles, such as hyperentangled states, and the…
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…
We present an efficient quantum algorithm to simulate nonlinear differential equations with polynomial vector fields of arbitrary degree on quantum platforms. Models of physical systems that are governed by ordinary differential equations…
The quantum marginal problem asks whether a set of given density matrices are consistent, i.e., whether they can be the reduced density matrices of a global quantum state. Not many non-trivial analytic necessary (or sufficient) conditions…
Entanglement purification takes a number of noisy EPR pairs and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical side channel, the procedure is equivalent to using a quantum…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly…
We analyze the distinguishability norm on the states of a multi-partite system, defined by local measurements. Concretely, we show that the norm associated to a tensor product of sufficiently symmetric measurements is essentially equivalent…