Robust data encodings for quantum classifiers

• URL: http://arxiv.org/abs/2003.01695v1
• Date: Tue, 3 Mar 2020 18:36:52 GMT
• Title: Robust data encodings for quantum classifiers
• Authors: Ryan LaRose, Brian Coyle
• Abstract summary: We study data encodings for binary quantum classification and investigate their properties both with and without noise. We show that encodings determine the classes of learnable decision boundaries as well as the set of points which retain the same classification in the presence of noise.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Data representation is crucial for the success of machine learning models. In the context of quantum machine learning with near-term quantum computers, equally important considerations of how to efficiently input (encode) data and effectively deal with noise arise. In this work, we study data encodings for binary quantum classification and investigate their properties both with and without noise. For the common classifier we consider, we show that encodings determine the classes of learnable decision boundaries as well as the set of points which retain the same classification in the presence of noise. After defining the notion of a robust data encoding, we prove several results on robustness for different channels, discuss the existence of robust encodings, and prove an upper bound on the number of robust points in terms of fidelities between noisy and noiseless states. Numerical results for several example implementations are provided to reinforce our findings.

Related papers

• Certifiably Robust Encoding Schemes [40.54768963869454]
  Quantum machine learning uses principles from quantum mechanics to process data, offering potential advances in speed and performance. Previous work has shown that these models are susceptible to attacks that manipulate input data or exploit noise in quantum circuits. We extend this line of research by investigating the robustness against perturbations in the classical data for a general class of data encoding schemes.
  arXiv  Detail & Related papers  (2024-08-02T11:29:21Z)
• 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)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Improving the Robustness of Summarization Systems with Dual Augmentation [68.53139002203118]
  A robust summarization system should be able to capture the gist of the document, regardless of the specific word choices or noise in the input. We first explore the summarization models' robustness against perturbations including word-level synonym substitution and noise. We propose a SummAttacker, which is an efficient approach to generating adversarial samples based on language models.
  arXiv  Detail & Related papers  (2023-06-01T19:04:17Z)
• Data re-uploading with a single qudit [1.0923877073891446]
  Two-level quantum systems, i.e. qubits, form the basis for most quantum machine learning approaches. We explore the capabilities of multi-level quantum systems, so-called qudits, for their use in a quantum machine learning context.
  arXiv  Detail & Related papers  (2023-02-27T16:32:16Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Some aspects of noise in binary classification with quantum circuits [2.2311710049695446]
  We study the effects of a restricted single-qubit noise model inspired by real quantum hardware on the performance of binary classification using quantum circuits. We show that noise in the data can work as a regularizer, implying potential benefits from the noise in certain cases for machine learning problems.
  arXiv  Detail & Related papers  (2022-11-11T22:06:17Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Polyadic Quantum Classifier [0.0]
  We introduce here a supervised quantum machine learning algorithm for multi-class classification on NISQ architectures. A parametric quantum circuit is trained to output a specific bit string corresponding to the class of the input datapoint. We train and test it on an IBMq 5-qubit quantum computer and the algorithm shows good accuracy.
  arXiv  Detail & Related papers  (2020-07-28T08:00:12Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.