论文标题

用于全量器分类的增量数据增加

Incremental Data-Uploading for Full-Quantum Classification

论文作者

Periyasamy, Maniraman, Meyer, Nico, Ufrecht, Christian, Scherer, Daniel D., Plinge, Axel, Mutschler, Christopher

论文摘要

机器学习模型中的数据表示强烈影响其性能。对于在嘈杂的中间量表量子(NISQ)设备上实施的量子机学习模型而言,这变得更加重要。将高维数据编码为NISQ设备的量子电路,而不会丢失任何信息,这并不是微不足道的,带来了很多挑战。虽然简单的编码方案(例如单个量子旋转门编码高维数据)通常会导致电路内的信息丢失,但复杂的编码方案具有纠缠和重新上传,导致编码门计数的增加。这不适合NISQ设备。这项工作提出了“增量数据”,这是一种针对这些挑战的高维数据的新颖编码模式。我们在整个量子电路中散布了给定数据点的特征向量的编码门,它们之间的参数化门。这种编码模式可以更好地表示量子电路中的数据,并具有最小的预处理要求。我们使用MNIST和Fashion-Mnist数据集在分类任务上显示了我们编码模式的效率,并通过分类精度和模型的有效维度比较不同的编码方法。

The data representation in a machine-learning model strongly influences its performance. This becomes even more important for quantum machine learning models implemented on noisy intermediate scale quantum (NISQ) devices. Encoding high dimensional data into a quantum circuit for a NISQ device without any loss of information is not trivial and brings a lot of challenges. While simple encoding schemes (like single qubit rotational gates to encode high dimensional data) often lead to information loss within the circuit, complex encoding schemes with entanglement and data re-uploading lead to an increase in the encoding gate count. This is not well-suited for NISQ devices. This work proposes 'incremental data-uploading', a novel encoding pattern for high dimensional data that tackles these challenges. We spread the encoding gates for the feature vector of a given data point throughout the quantum circuit with parameterized gates in between them. This encoding pattern results in a better representation of data in the quantum circuit with a minimal pre-processing requirement. We show the efficiency of our encoding pattern on a classification task using the MNIST and Fashion-MNIST datasets, and compare different encoding methods via classification accuracy and the effective dimension of the model.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源