Related papers: Quantum interactive proofs and the complexity of s…
Localizability of entanglement in fully inseparable states is a key ingredient of assisted quantum information protocols as well as measurement-based models of quantum computing. We investigate the existence of fully inseparable states with…
We analyze the complexity of quantum state verification in the context of solving systems of linear equations of the form $A \vec x = \vec b$. We show that any quantum operation that verifies whether a given quantum state is within a…
Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed…
Given a large number N of copies of a qubit state of which we wish to estimate its purity, we prove that separable-measurement protocols can be as efficient as the optimal joint-measurement one if classical communication is used. This shows…
In quantum information theory, the reliable and effective detection of entanglement is of paramount importance. However, given an unknown state, assessing its entanglement is a challenging task. To attack this problem, we investigate the…
We study how well answer to the question ``Is the given quantum state equal to a certain maximally entangled state?'' using LOCC, in the context of hypothesis testing. Under several locality and invariance conditions, optimal tests will be…
We present a general description of separable states in Quantum Mechanics. In particular, our result gives an easy proof that inseparabitity (or entanglement) is a pure quantum (noncommutative) notion. This implies that distinction between…
Entangled physical systems are an important resource in quantum information. Some authors claim that in fact all quantum states are entangled. In this paper we show that this claim is incorrect and we discuss in operational way differences…
We investigate the possibility of simulating partially entangled two qubit states by separable states of higher spins. First, we show that all partially entangled isotropic states can be simulated classically. We further investigate…
This short note describes a method to tackle the (bipartite) quantum separability problem. The method can be used for solving the separability problem in an experimental setting as well as in the purely mathematical setting. The idea is to…
We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the cases when the players have a strategy…
We propose to detect quantum entanglement by a condition of local measurments. We find that this condition can detect efficiently the pure entangled states for both discrete and continuous variable systems. It does not depend on…
Entanglement is a purely quantum mechanical phenomenon and thus it has no classical analog. On the other hand, coherence is a well-known phenomenon in classical optics and in quantum mechanics. Recent research shows that quantum coherence…
We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local…
Indeterminacy associated with probing of a quantum state is commonly expressed through spectral distances (metric) featured in the outcomes of repeated experiments. Here we express it as an effective amount (measure) of distinct outcomes…
The state of a quantum system, consisting of two distinct subsystems, is called separable if it can be prepared by two distant experimenters who receive instructions from a common source, via classical communication channels. A necessary…
We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given partial information about the state in the…
We consider a Quantum Computer with n quantum-bits (`qubits'), where each qubit is coupled independently to an environment affecting the state in a dephasing or depolarizing way. For mixed states we suggest a quantification for the property…
We begin by establishing structural results for several fundamental quantum complexity classes: p/mBQP, p/mQ(C)MA, $\text{p/mQSZK}_{\text{hv}}$, p/mQIP, p/mBQP/qpoly, p/mBQP/poly, and p/mPSPACE. This includes identifying complete problems,…
In a recent work [Phys. Rev. Lett. 120, 170502 (2018)], Pallister et al. proposed an optimal strategy to verify non-maximally entangled two-qubit pure states under the constraint that the accessible measurements being locally projective and…