Certifiably Robust Encoding Schemes

• URL: http://arxiv.org/abs/2408.01200v1
• Date: Fri, 2 Aug 2024 11:29:21 GMT
• Title: Certifiably Robust Encoding Schemes
• Authors: Aman Saxena, Tom Wollschläger, Nicola Franco, Jeanette Miriam Lorenz, Stephan Günnemann,
• Abstract summary: 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.
• Score: 40.54768963869454
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum machine learning uses principles from quantum mechanics to process data, offering potential advances in speed and performance. However, previous work has shown that these models are susceptible to attacks that manipulate input data or exploit noise in quantum circuits. Following this, various studies have explored the robustness of these models. These works focus on the robustness certification of manipulations of the quantum states. We extend this line of research by investigating the robustness against perturbations in the classical data for a general class of data encoding schemes. We show that for such schemes, the addition of suitable noise channels is equivalent to evaluating the mean value of the noiseless classifier at the smoothed data, akin to Randomized Smoothing from classical machine learning. Using our general framework, we show that suitable additions of phase-damping noise channels improve empirical and provable robustness for the considered class of encoding schemes.

Related papers

• 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)
• Tram: A Token-level Retrieval-augmented Mechanism for Source Code Summarization [76.57699934689468]
  We propose a fine-grained Token-level retrieval-augmented mechanism (Tram) on the decoder side to enhance the performance of neural models. To overcome the challenge of token-level retrieval in capturing contextual code semantics, we also propose integrating code semantics into individual summary tokens.
  arXiv  Detail & Related papers  (2023-05-18T16:02:04Z)
• 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)
• Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• 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)
• 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)
• Machine learning approach for quantum non-Markovian noise classification [1.2891210250935146]
  We show that machine learning and artificial neural network models can be used to classify noisy quantum dynamics. Our approach is expected to find direct application in a vast number of experimental schemes and also for the noise benchmarking of the already available noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2021-01-08T20:56:56Z)
• Optimal Provable Robustness of Quantum Classification via Quantum Hypothesis Testing [14.684867444153625]
  Quantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. These quantum algorithms, like their classical counterparts, have been shown to be vulnerable to input perturbations. These can arise either from noisy implementations or, as a worst-case type of noise, adversarial attacks.
  arXiv  Detail & Related papers  (2020-09-21T17:55:28Z)
• 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)
• Robust data encodings for quantum classifiers [0.0]
  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.
  arXiv  Detail & Related papers  (2020-03-03T18:36:52Z)

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.