Robust data encodings for quantum classifiers

By Ryan Larose, Brian Coyle. Physical Review A, 2020

340 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/5ddb6dbb1ac160ac256b21cf12d4cc383f1aa482

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. M. Cerezo
  2. Patrick J. Coles
  3. Lukasz Cincio
  4. Hsin-Yuan Huang
  5. Guillaume Verdon
  6. L. Kim
  7. Tak Hur
  8. Daniel K. Park

In Atomic and Molecular Physics, and Optics

  1. M. Cerezo
  2. Lukasz Cincio
  3. Patrick J. Coles
  4. L. Kim
  5. Tak Hur
  6. Daniel K. Park
  7. Hsin-Yuan Huang
  8. Guillaume Verdon

Citations in the corpus