Trade-off between bagging and boosting for quantum separability-entanglement classification

DOI10.1007/S11128-024-04469-9MaRDI QIDQ6588838zbMATH OpenFDO

Authors Sanuja D. Mohanty, Ram N. Patro, Pradyut K. Biswal, Biswajit Pradhan, Sk Sazim

Publication date 16 August 2024

Published in Quantum Information Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11128-024-04469-9

zbMATH Keywords

bagging and boosting classifiersconvex hull approximationentanglement certificationmachine learning

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• Bagging predictors
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• Explaining AdaBoost
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 1753143 (Why is no real title available?)
• scientific article; zbMATH DE number 2101406 (Why is no real title available?)
• Machine Learning: ECML 2004
• Quantum entanglement
• Separability Criterion for Density Matrices
• Separability of mixed states: necessary and sufficient conditions.
• Support-vector networks
• The boosting approach to machine learning: an overview

This page was built for publication: Trade-off between bagging and boosting for quantum separability-entanglement classification

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