A thresholding bandit algorithm on data from a single-parameter entanglement-witness family enables conclusive batch entanglement detection for two-qubit states in class F, with MAB-derived sample-complexity bounds.
Let B denote the ”good” event that at any time t > 0 and for all arms i ∈ [K], the true value SE(ρi) is well concentrated around its estimate ˆSi,Ni(t)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Batch Entanglement Detection in Parameterized Qubit States using Classical Bandit Algorithms
A thresholding bandit algorithm on data from a single-parameter entanglement-witness family enables conclusive batch entanglement detection for two-qubit states in class F, with MAB-derived sample-complexity bounds.