Abstract Determining whether an unknown quantum state is entangled can be approached through quantum tomography and related algorithms. However, these methods are generally inefficient due to the NP-hardness of the problem. An alternative strategy is to treat it as a decision (or estimation) problem with a quantum data structure (Horodecki and Ekert 2002 Phys. Rev. Lett. 89 127902). Over the years, significant progress has been made: the two-qubit case is now fully understood, but for higher-dimensional systems only entanglement detection via negativity has been established. In this work, we propose schemes for measuring upper bounds on bipartite biconcurrence and concurrence, expressed as functions of a fixed (but arbitrary) unitary operation acting on a Hilbert space that is quadratically larger than the original state space. Independently, we provide a scheme for measuring a lower bound for concurrence. In the case of the states proportional to the projectors the schemes are getting significantly simpler and the upper bound on the biconcurrence, as well as the lower bound on the concurrence, become exact (up to experimental and numerical errors). This framework opens the door to tackling the separability problem using methods inspired by the variational quantum eigensolver.
Abstract Determining whether an unknown quantum state is entangled can be approached through quantum tomography and related algorithms. However, these methods are generally inefficient due to the NP-hardness of the problem. An alternative strategy is to treat it as a decision (or estimation) problem with a quantum data structure (Horodecki and Ekert 2002 Phys. Rev. Lett. 89 127902). Over the years, significant progress has been made: the two-qubit case is now fully understood, but for higher-dimensional systems only entanglement detection via negativity has been established. In this work, we propose schemes for measuring upper bounds on bipartite biconcurrence and concurrence, expressed as functions of a fixed (but arbitrary) unitary operation acting on a Hilbert space that is quadratically larger than the original state space. Independently, we provide a scheme for measuring a lower bound for concurrence. In the case of the states proportional to the projectors the schemes are getting significantly simpler and the upper bound on the biconcurrence, as well as the lower bound on the concurrence, become exact (up to experimental and numerical errors). This framework opens the door to tackling the separability problem using methods inspired by the variational quantum eigensolver.
The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.
Lower Bound of l1 Norm of Coherence of Bipartite Qubit-Qudit System and its Application in the Detection of Entangled Tripartite Qudit-Qubit-Qudit System
Quantum coherence and quantum entanglement are two strong pillars in quantum information theory. We study here for the possibility of any connection between these two important aspects of quantum mechanics while studying the entanglement detection problem for the detection of bipartite higher dimensional entangled states and multipartite entangled states. To achieve our goal, we derive the lower bound L of l1 norm of coherence of bipartite qubit-qudit system using the criterion that detect entanglement. Furthermore, we deduce the upper bound U of l1 norm of coherence of separable bipartite qubit-qudit system using the separability criterion. Thus, we find that if any l1 norm of coherence of bipartite qubit-qudit system is greater than the upper bound U then the given qubit-qudit state is entangled. Finally, we obtained the upper bound U1 of l1 norm of coherence of separable tripartite state lies either in 2⊗d⊗d or d⊗2⊗d or d⊗d⊗2 dimensional Hilbert space using the upper bound U. We have shown that if the l1 norm of coherence of any tripartite qubit−qudit−qudit or qudit−qubit−qudit or qudit−qudit−qubit system is greater than the derived upper bound U1 then the given tripartite system represent an entangled state.
It is a major problem within the field of Quantum Information whether the state of a system is entangled or separable. Exact methods have been developed for two qubit systems, but for larger systems determining the boundary between separable and entangled states has been shown to be NP-hard. An iterative method has been proposed that creates progressively tighter bounds from each direction, but this method is resource limited, and determining the boundary precisely requires an infinite number of iterations. Further, it is also believed that successive iterations scale badly. Instead, a weighted measure is developed over the delineated subspaces, producing a likelihood function by convex optimization. This presentation describes progress towards understanding and deploying this method in support of experimental work involving entangled states.
Detection of entanglement in quantum states is one of the most important problems in quantum information processing. However, it is one of the most challenging tasks to find a universal scheme which is also desired to be optimal to detect entanglement for all states of a specific class--as always preferred by experimentalists. Although, the topic is well studied at least in case of lower dimensional compound systems, e.g., two-qubit systems, but in the case of continuous variable systems, this remains as an open problem. Even in the case of two-mode Gaussian states, the problem is not fully solved. In our work, we have tried to address this issue. At first, a limited number of Hermitian operators is given to test the necessary and sufficient criterion on the covariance matrix of separable two-mode Gaussian states. Thereafter, we present an interferometric scheme to test the same separability criterion in which the measurements are being done via Stokes-like operators. In such case, we consider only single-copy measurements on a two-mode Gaussian state at a time and the scheme amounts to the full state tomography. We further analyze the robustness of the proposed detection method against experimentally relevant imperfections and demonstrate that the separability test remains reliable under moderate levels of detection inefficiency. Although this latter approach is a linear optics-based one, nevertheless it is not an economic scheme. Resource-wise a more economical scheme than the full state tomography is obtained if we consider measurements on two copies of the state at a time. However, optimality of the scheme is not yet known.
Entanglement monotones, such as the concurrence, are useful tools to characterize quantum correlations in various physical systems. The computation of the concurrence involves, however, difficult optimizations and only for the simplest case of two qubits a closed formula was found by Wootters [Phys. Rev. Lett. 80, 2245 (1998)]. We show how this approach can be generalized, resulting in lower bounds on the concurrence for higher dimensional systems as well as for multipartite systems. We demonstrate that for certain families of states our results constitute the strongest bipartite entanglement criterion so far; moreover, they allow us to recognize novel families of multiparticle bound entangled states.
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing. Despite the many methods---such as the positive partial transpose criterion and the k-symmetric extendibility criterion---to tackle this problem, none of them enables a general, practical solution due to the problem's NP-hard complexity. Explicitly, separable states form a high-dimensional convex set of vastly complicated structures. In this work, we build a different separability-entanglement classifier underpinned by machine learning techniques. We use standard tools from machine learning to learn the entanglement feature of arbitrary given quantum states. We perform substantial numerical tests on two-qubit and two-qutrit systems, and the results indicate that our method can outperform the existing methods in generic cases in terms of both speed and accuracy. This opens up avenues to explore quantum entanglement via the machine learning approach.