Improved algorithm for quantum separability and entanglement detection
The use of an algorithm for solving the quantum separability problem and for entanglement detection of quantum states was presented. The algorithm takes as input the density matrix for a quantum state ρ and either decides that ρ is separable, or returns an entanglement witness that detects ρ. The ge...
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Journal article |
| Kieli: | English |
| Julkaistu: |
2004
|
| _version_ | 1826306955484856320 |
|---|---|
| author | Ioannou, L Travaglione, B Cheung, D Ekert, A |
| author_facet | Ioannou, L Travaglione, B Cheung, D Ekert, A |
| author_sort | Ioannou, L |
| collection | OXFORD |
| description | The use of an algorithm for solving the quantum separability problem and for entanglement detection of quantum states was presented. The algorithm takes as input the density matrix for a quantum state ρ and either decides that ρ is separable, or returns an entanglement witness that detects ρ. The general technique of the algorithm is depend on the convexity of the set of separable states, and thus is used to test the multipartite entanglement. The algorithm is also used to determine if an unknown state is entangled by measuring only a subset of the expected values which describe the state. |
| first_indexed | 2024-03-07T06:55:46Z |
| format | Journal article |
| id | oxford-uuid:fe19e2e5-f7f0-45e0-b73d-edb2159349bf |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T06:55:46Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | oxford-uuid:fe19e2e5-f7f0-45e0-b73d-edb2159349bf2022-03-27T13:33:43ZImproved algorithm for quantum separability and entanglement detectionJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:fe19e2e5-f7f0-45e0-b73d-edb2159349bfEnglishSymplectic Elements at Oxford2004Ioannou, LTravaglione, BCheung, DEkert, AThe use of an algorithm for solving the quantum separability problem and for entanglement detection of quantum states was presented. The algorithm takes as input the density matrix for a quantum state ρ and either decides that ρ is separable, or returns an entanglement witness that detects ρ. The general technique of the algorithm is depend on the convexity of the set of separable states, and thus is used to test the multipartite entanglement. The algorithm is also used to determine if an unknown state is entangled by measuring only a subset of the expected values which describe the state. |
| spellingShingle | Ioannou, L Travaglione, B Cheung, D Ekert, A Improved algorithm for quantum separability and entanglement detection |
| title | Improved algorithm for quantum separability and entanglement detection |
| title_full | Improved algorithm for quantum separability and entanglement detection |
| title_fullStr | Improved algorithm for quantum separability and entanglement detection |
| title_full_unstemmed | Improved algorithm for quantum separability and entanglement detection |
| title_short | Improved algorithm for quantum separability and entanglement detection |
| title_sort | improved algorithm for quantum separability and entanglement detection |
| work_keys_str_mv | AT ioannoul improvedalgorithmforquantumseparabilityandentanglementdetection AT travaglioneb improvedalgorithmforquantumseparabilityandentanglementdetection AT cheungd improvedalgorithmforquantumseparabilityandentanglementdetection AT ekerta improvedalgorithmforquantumseparabilityandentanglementdetection |