Abstract
Entanglement in multipartite systems is a key resource for quantum information and communication protocols, making its verification in complex systems a necessity. Because an exact calculation of arbitrary entanglement probes is impossible, we derive and implement a numerical method to construct multipartite witnesses to uncover entanglement in arbitrary systems. Our technique is based on a substantial generalization of the power iteration, an essential tool for computing eigenvalues, and it is a solver for the separability eigenvalue equations, enabling the general formulation of optimal entanglement witnesses. Beyond our rigorous derivation and direct implementation of this method, we also apply our approach to several examples of complexly quantum-correlated states and benchmark its general performance. Consequently, we provide an generally applicable numerical tool for the identification of multipartite entanglement.
Highlights
Quantum entanglement is one of the most fundamental concepts in physics
We introduce an algorithm, the separability power iteration (SPI), to numerically construct arbitrary multipartite entanglement witnesses
Beyond the formulation of our method, we provide the mathematical background for the SPI, which yields the maximal solution of the nonlinear separability eigenvalue problem addressing the complex entanglement problem in quantum physics
Summary
Quantum entanglement is one of the most fundamental concepts in physics. The pure existence of this quantum phenomenon challenged previously established notions of correlations and paved the way towards a new interpretation of the nature of physics. This led to new protocols used in quantum computing and communication, which utilize the resources of entangled quantum states [3]. Examples of such classically infeasible tasks are quantum teleportation [4] and dense coding [5]. Entanglement plays a key role in fundamental physics and technology-oriented applications
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have