Scholarlink

Abstract <p>In this work, we present quantum random forest prediction circuits for binary and multiclass classification problems and their gate complexities. Gate complexity is defined as the number of elementary one- and two-qubit gates. The presented prediction algorithm requires fewer elementary gates than the general upper bound.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Quantum Random Forest Model Prediction Circuit Gate Complexity

  • 期刊论文

  • 发表日期：

    2025年12月1日

查看全文
  • K. R. Khadiev,
  • L. I. Safina,
  • I. G. Zinnatullin

摘要

Abstract

In this work, we present quantum random forest prediction circuits for binary and multiclass classification problems and their gate complexities. Gate complexity is defined as the number of elementary one- and two-qubit gates. The presented prediction algorithm requires fewer elementary gates than the general upper bound.