-
Notifications
You must be signed in to change notification settings - Fork 61
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Feature: Fidelity of separability #141
Comments
As mentioned in a previous issue, I would like to work on this for the 2023 Unitary Hackathon. |
That's great, @purva-thakre ! I have assigned you the task. Looking forward to seeing what you put together here! |
@vprusso Are pure states supposed to be the only option for the input state to the SDP functions? Or should I also account for the possibility of mixed states as another option? |
Hi @purva-thakre. Great question! Yes, the input to the SDP could either be a pure or mixed state. I think that should be a relatively straightforward feature to support, but of course, if I have a blindspot on that, do let me know if you see some pitfalls that perhaps I do not! And do not hesitate if any more questions pop up! |
@vprusso Thanks! This might be a very minor question but what is the advantage of using |
Hi @purva-thakre , Good question. I would say that the benefit of using Granted, the location in which you are taking the screenshot is from a smaller set of code associated with a paper, so this benefit is not really present there and defining the product state inline would indeed save you from having to create a Does that make sense? |
Here is the page on the docs pertaining to the various verbosity levels: The PICOS docs can be a bit frustrating to parse through. Indeed, I've always had an issue with their integrated search (which seems pretty broken to me). I feel your pain :) Hopefully, that's useful for you. |
@vprusso Thank you for being patient with all of my questions! Yes, search for PICOS docs was forever stuck in
Edit: I think I might have misunderstood the result & tried to make things more complicated for myself. I found another paper that basically says entangled states are not k-extendible for |
Hi @purva-thakre , Right, the idea is that the PPT-extendible hierarchy is guaranteed to eventually converge at some level Of course, the downside is that the higher up you go in the hierarchy, the more difficult it is to compute. It might be helpful to take a look at the Does that help at all? |
@vprusso Hopefully, this is the last question for this issue. Is there a I tried to build the documentation by using autodocsummary is also adding some files that I did not change. |
Hi @purva-thakre, The typical workflow for building the docs of
Arises from the fact that the docs are looking for a function name My suggestion would be to create two files; one as Logically, this seems to make sense to me, as these two functions are a bit different; one is concerned with the fidelity of states while the other is concerned with the fidelity of channels. Does that make sense? Let me know if perhaps you're seeing something here that I might be missing. |
The fidelity of separability (also known as the maximum separable fidelity [1, 2]) is an entanglement measure that can be approximated via semidefinite programs outlined in [3]. Ancillary files provided with [3] (here) implement SDPs that approximate the fidelity of separability.
This task would entail:
state_metrics/fidelity_of_separability.py
.tests/test_state_metrics/test_fidelity_of_separability.py
docs/states.rst
under "Distance Metrics for Quantum States"[1] Two-message quantum interactive proofs and the quantum separability problem
[2] Quantum interactive proofs and the complexity of separability testing
[3] Quantum Steering Algorithm for Estimating Fidelity of Separability
The text was updated successfully, but these errors were encountered: