English

Classifying quantum data by dissipation

Quantum Physics 2019-03-21 v2

Abstract

We investigate a general class of dissipative quantum circuit capable of computing arbitrary Conjunctive Normal Form (CNF) Boolean formulas. In particular, the clauses in a CNF formula define a local generator of Markovian quantum dynamics which acts on a network of qubits. Fixed points of this dynamical system encode the evaluation of the CNF formula. The structure of the corresponding quantum map partitions the Hilbert space into sectors, according to decoherence-free subspaces (DFSs) associated with the dissipative dynamics. These sectors then provide a natural and consistent way to classify quantum data (i.e. quantum states). Indeed, the attractive fixed points of the network allow one to learn the sector(s) for which some particular quantum state is associated. We show how this structure can be used to dissipatively prepare quantum states (e.g. entangled states), and outline how it may be used to generalize certain classical computational learning tasks.

Keywords

Cite

@article{arxiv.1811.03175,
  title  = {Classifying quantum data by dissipation},
  author = {Jeffrey Marshall and Lorenzo Campos Venuti and Paolo Zanardi},
  journal= {arXiv preprint arXiv:1811.03175},
  year   = {2019}
}

Comments

13 pages, 4 figures. v2: added clarifying comments and discussions throughout, additional error bound [Eq. (17)] and definition (4), added new examples section (III B)

R2 v1 2026-06-23T05:08:23.496Z