A two-way algorithm for the entanglement problem

DOI10.1088/0305-4470/38/24/011MaRDI QIDQ5462519zbMATH OpenOpenAlexFDO

Authors Florian Hulpke, D. Bruß

Publication date 2 August 2005

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0407179

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all product states. Performing our algorithm simultaneously with the algorithm by Doherty, Parrilo and Spedalieri (which proves a quantum state to be entangled in a finite number of steps) leads to a two-way algorithm that terminates for any input state. Only for a set of arbitrary small measure near the border between separable and entangled states the result is inconclusive.

Recommendations

• An exact quantum algorithm for the 2-junta problem
• An algorithm to explore entanglement in small systems
• Entanglement and its role in Shor's algorithm
• Entanglement simulations of Shor's algorithm
• Entanglement in the Grover search algorithm
• Quantum entanglement and encoding algorithm
• A semidefinite program for distillable entanglement
• The minimum distance problem for two-way entanglement purification
• Quantum algorithm for SAT problem andquantum mutual entropy
• The geometry of entanglement and Grover's algorithm

Cited in

(13)

• Classical complexity and quantum entanglement
• A successive approximation method for quantum separability
• Quantification of entanglement by means of convergent iterations
• Epsilon-net method for optimizations over separable states
• Quantum entanglement
• scientific article; zbMATH DE number 1748602 (Why is no real title available?)
• An algorithm to explore entanglement in small systems
• Epsilon-net method for optimizations over separable states
• Quantum entanglement, sum of squares, and the log rank conjecture
• An elementary introduction to the geometry of quantum states with pictures
• An improved semidefinite programming hierarchy for testing entanglement
• A quasipolynomial-time algorithm for the quantum separability problem
• An algorithm based on negative probabilities for a separability criterion

This page was built for publication: A two-way algorithm for the entanglement problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5462519)