Related papers: Thirty-six entangled officers of Euler: Quantum so…
We provide a systematic way of constructing entanglement-assisted quantum error-correcting codes via graph states in the scenario of preexisting perfectly protected qubits. It turns out that the preexisting entanglement can help beat the…
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…
We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N >= 4. It is shown that Phi detects many entangled states…
Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a…
We study the distinguishability of bipartite quantum states by Positive Operator-Valued Measures with positive partial transpose (PPT POVMs). The contributions of this paper include: (1). We give a negative answer to an open problem of [M.…
First, we present a Bell type inequality for n qubits, assuming that m out of the n qubits are independent. Quantum mechanics violates this inequality by a ratio that increases exponentially with m. Hence an experiment on n qubits violating…
For quantum systems with a total dimension greater than six, the positive partial transposition (PPT) criterion is sufficient but not necessary to decide the non-separability of quantum states. Here, we present an Automated Machine Learning…
A typical quantum state with no symmetry can be realized by letting a random unitary act on a fixed state, and the subsystem entanglement spectrum follows the Laguerre unitary ensemble (LUE). For integer-spin time reversal symmetry, we have…
We propose a straightforward method to determine the maximal entanglement of pure states using the criterion of maximal I-concurrence, a measure of entanglement. The square of concurrence for a bipartition $X|X^\prime$ of a pure state is…
Motivated to understand how entanglement resources can be distributed in quantum networks, we introduce threshold entanglement (TE) states. These are multipartite quantum states whose entanglement across bipartitions forces all marginals of…
Recently, Galindo et al. introduced the concept of asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) from Calderbank-Shor-Steane (CSS) construction. In general, it's difficult to determine the required number of…
We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm…
The quantum orthogonal arrays define remarkable classes of multipartite entangled states called $k$-uniform states whose every reductions to $k$ parties are maximally mixed. We present constructions of quantum orthogonal arrays of strength…
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. We consider three query models. In the first model ("OR queries"), the oracle returns whether a given subset of the vertices contains any…
Entanglement is one of the most fundamental properties of quantum mechanics, and is the key resource for quantum information processing. Bipartite entangled states of identical particles have been generated and studied in several…
Euler explored the problem of finding three numbers such that the sum or difference of any two of them is a perfect square. He discovered a parametric solution represented by polynomials of degree 18 and identified the smallest of these…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
It is now experimentally possible to entangle thousands of qubits, and efficiently measure each qubit in parallel in a distinct basis. To fully characterize an unknown entangled state of $n$ qubits, one requires an exponential number of…
Let E' denote the set of non-normalized two-qutrit entangled states of rank four having positive partial transpose (PPT). We show that the set of SLOCC equivalence classes of states in E', equipped with the quotient topology, is…
It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled such that codes capable of correcting more errors require more entanglement to encode a qubit. Here, we show that the validity of this…