Classical Ensembles of Single-Qubit Quantum Variational Circuits for Classification

• URL: http://arxiv.org/abs/2302.02964v1
• Date: Mon, 6 Feb 2023 17:51:47 GMT
• Title: Classical Ensembles of Single-Qubit Quantum Variational Circuits for Classification
• Authors: Shane McFarthing, Anban Pillay, Ilya Sinayskiy and Francesco Petruccione
• Abstract summary: Quantumally universal multi-feature (QAUM) encoding architecture was recently introduced and showed improved expressivity and performance in classifying pulsar stars. This work reports on the design, implementation, and evaluation of ensembles of single-qubit QAUM classifiers using classical bagging and boosting techniques.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum asymptotically universal multi-feature (QAUM) encoding architecture was recently introduced and showed improved expressivity and performance in classifying pulsar stars. The circuit uses generalized trainable layers of parameterized single-qubit rotation gates and single-qubit feature encoding gates. Although the improvement in classification accuracy is promising, the single-qubit nature of this architecture, combined with the circuit depth required for accuracy, limits its applications on NISQ devices due to their low coherence times. This work reports on the design, implementation, and evaluation of ensembles of single-qubit QAUM classifiers using classical bagging and boosting techniques. We demonstrate an improvement in validation accuracy for pulsar star classification. We find that this improvement is not problem-specific as we observe consistent improvements for the MNIST Digits and Wisconsin Cancer datasets. We also observe that the boosting ensemble achieves an acceptable level of accuracy with only a small amount of training, while the bagging ensemble achieves higher overall accuracy with ample training time. This shows that classical ensembles of single-qubit circuits present a new approach for certain classification problems.

Related papers

• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Ensembles of Quantum Classifiers [0.0]
  A viable approach for the execution of quantum classification algorithms is the introduction of the ensemble methods. In this work, we present an implementation and an empirical evaluation of ensembles of quantum classifiers for binary classification.
  arXiv  Detail & Related papers  (2023-11-16T10:27:25Z)
• Sparse Modular Activation for Efficient Sequence Modeling [94.11125833685583]
  Recent models combining Linear State Space Models with self-attention mechanisms have demonstrated impressive results across a range of sequence modeling tasks. Current approaches apply attention modules statically and uniformly to all elements in the input sequences, leading to sub-optimal quality-efficiency trade-offs. We introduce Sparse Modular Activation (SMA), a general mechanism enabling neural networks to sparsely activate sub-modules for sequence elements in a differentiable manner.
  arXiv  Detail & Related papers  (2023-06-19T23:10:02Z)
• ProTeCt: Prompt Tuning for Taxonomic Open Set Classification [59.59442518849203]
  Few-shot adaptation methods do not fare well in the taxonomic open set (TOS) setting. We propose a prompt tuning technique that calibrates the hierarchical consistency of model predictions. A new Prompt Tuning for Hierarchical Consistency (ProTeCt) technique is then proposed to calibrate classification across label set granularities.
  arXiv  Detail & Related papers  (2023-06-04T02:55:25Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• A hybrid quantum-classical classifier based on branching multi-scale entanglement renormalization ansatz [5.548873288570182]
  This paper proposes a quantum semi-supervised classifier based on label propagation. Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method. In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization.
  arXiv  Detail & Related papers  (2023-03-14T13:46:45Z)
• Ensemble-learning variational shallow-circuit quantum classifiers [4.104704267247209]
  We propose two ensemble-learning classification methods, namely bootstrap aggregating and adaptive boosting. The protocols have been exemplified for classical handwriting digits as well as quantum phase discrimination of a symmetry-protected topological Hamiltonian.
  arXiv  Detail & Related papers  (2023-01-30T07:26:35Z)
• Binary classifiers for noisy datasets: a comparative study of existing quantum machine learning frameworks and some new approaches [0.0]
  We apply Quantum Machine Learning frameworks to improve binary classification. noisy datasets are in financial datasets. New models exhibit better learning characteristics to asymmetrical noise in the dataset.
  arXiv  Detail & Related papers  (2021-11-05T10:29:05Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• Ansatz-Independent Variational Quantum Classifier [0.0]
  We show that variational quantum classifiers (VQCs) fit inside the well-known kernel method. We also propose a variational circuit realization (VCR) for designing efficient quantum circuits for a given unitary operator.
  arXiv  Detail & Related papers  (2021-02-02T21:25:39Z)
• Intra Order-preserving Functions for Calibration of Multi-Class Neural Networks [54.23874144090228]
  A common approach is to learn a post-hoc calibration function that transforms the output of the original network into calibrated confidence scores. Previous post-hoc calibration techniques work only with simple calibration functions. We propose a new neural network architecture that represents a class of intra order-preserving functions.
  arXiv  Detail & Related papers  (2020-03-15T12:57:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.