Timeline for What is the complexity of determining if a state is entangled?
Current License: CC BY-SA 4.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 30, 2023 at 15:19 | vote | accept | Loic Stoic | ||
Mar 29, 2023 at 12:48 | history | became hot network question | |||
Mar 29, 2023 at 12:47 | comment | added | John Watrous | arXiv:1308.5788 studies various forms of this problem and may be relevant. | |
Mar 29, 2023 at 8:52 | comment | added | Mateus Araújo | That's a very good question. One way to upperbound the query complexity is to do tomography of $|\psi\rangle$ and then use some classical method. This will be obviously exponential in $N$. There must be much better methods of doing it, though. | |
Mar 29, 2023 at 8:08 | history | edited | glS♦ | CC BY-SA 4.0 |
edited title
|
Mar 29, 2023 at 7:22 | answer | added | Danylo Y | timeline score: 3 | |
Mar 29, 2023 at 6:39 | answer | added | DaftWullie | timeline score: 7 | |
Mar 29, 2023 at 4:48 | history | asked | Loic Stoic | CC BY-SA 4.0 |