Hilbert-Schmidt distance and entanglement witnessing

Palash Pandya, Omer Sakarya, and Marcin Wieśniak
Phys. Rev. A 102, 012409 – Published 7 July 2020

Abstract

Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. We apply the Gilbert's algorithm to get an upper bound on the Hilbert-Schmidt distance between a given state and the set of separable states. While Hilbert-Schmidt distance does not form a proper entanglement measure, it can nevertheless be useful for witnessing entanglement. We provide a few methods based on the Gilbert's algorithm that can reliably qualify a given state as strongly entangled or practically separable, while being computationally efficient. The method also outputs successively improved approximations to the closest separable state for the given state. We demonstrate the efficacy of the method with examples.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 28 April 2020
  • Accepted 12 June 2020

DOI:https://doi.org/10.1103/PhysRevA.102.012409

©2020 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Palash Pandya1, Omer Sakarya2, and Marcin Wieśniak1,3

  • 1Institute of Theoretical Physics and Astrophysics, Faculty of Mathematics, Physics, and Informatics, University of Gdańsk, 80-308 Gdańsk, Poland
  • 2Institute of Informatics, Faculty of Mathematics, Physics, and Informatics, University of Gdańsk, 80-308 Gdańsk, Poland
  • 3International Centre for Theory of Quantum Technologies, University of Gdańsk, 80-308 Gdańsk, Poland

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 102, Iss. 1 — July 2020

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×