Related papers: Quantum interactive proofs and the complexity of s…
In this article we introduce a new complexity class called PQMA_log(2). Informally, this is the class of languages for which membership has a logarithmic-size quantum proof with perfect completeness and soundness which is polynomially close…
Entanglement, or quantum inseparability, is a crucial resource in quantum information applications, and therefore the experimental generation of separated yet entangled systems is of paramount importance. Experimental demonstrations of…
Exploiting the cone structure of the set of unnormalized mixed quantum states, we offer an approach to detect separability independently of the dimensions of the subsystems. We show that any mixed quantum state can be decomposed as…
We initiate the study of quantum Interactive Oracle Proofs (qIOPs), a generalization of both quantum Probabilistically Checkable Proofs and quantum Interactive Proofs, as well as a quantum analogue of classical Interactive Oracle Proofs. In…
For a given pure state of a composite quantum system we analyze the product of its projections onto a set of locally orthogonal separable pure states. We derive a bound for this product analogous to the entropic uncertainty relations. For…
We discuss the problem of determining whether the state of several quantum mechanical subsystems is entangled. As in previous work on two subsystems we introduce a procedure for checking separability that is based on finding state…
Although quantum entanglement has already been verified experimentally and applied in quantum computing, quantum sensing and quantum networks, most of the existing measures cannot characterize the entanglement faithfully. In this work, by…
The mixedness of one share of a pure bipartite state determines whether the overall state is a separable, unentangled state. Here we consider quantum computational tests of mixedness, and we derive an exact expression of the acceptance…
Recent findings suggest, separable states, which are otherwise of no use in entanglement dependent tasks, can also be used in information processing tasks that depend upon the discord type general non classical correlations. In this work,…
Quantum entanglement is a fundamental property of quantum mechanics and plays a crucial role in quantum computation and information. We study entanglement via the lens of computational complexity by considering quantum generalizations of…
The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…
We investigate the detection of entanglement in $n$-partite quantum states. We obtain practical separability criteria to identify genuinely entangled and non-separable mixed quantum states. No numerical optimization or eigenvalue evaluation…
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial…
We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit…
We study the local indistinguishability problem of quantum states. By introducing an easily calculated quantity, non-commutativity, we present an criterion which is both necessary and sufficient for the local indistinguishability of a…
We show that for tripartite quantum pure states of qubits, all the kinds of entanglement in terms of SLOCC classification are experimentally measurable by simple projective measurements, provided that four copies of the composite quantum…
Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. Your task is to determine the states. This can be viewed as a kind of quantum state learning…
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the…