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.
Confidence polytopes in quantum state tomography
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
Proposes a context-aware unit testing framework for quantum subroutines modeled as parametrized quantum channels, using probabilistic assertions and demonstrated on GHZ preparation and Shor's algorithm subroutines.
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.
-
Context-Aware Unit Testing for Quantum Subroutines
Proposes a context-aware unit testing framework for quantum subroutines modeled as parametrized quantum channels, using probabilistic assertions and demonstrated on GHZ preparation and Shor's algorithm subroutines.