Error-tolerant quantum convolutional neural networks for symmetry-protected topological phases

TL;DR

This paper introduces error-tolerant quantum convolutional neural networks capable of identifying symmetry-protected topological phases in noisy quantum states, enhancing robustness and efficiency for near-term quantum computing applications.

Contribution

The authors develop QCNNs that maintain accuracy under incoherent errors and reduce circuit depth, enabling practical implementation on current quantum hardware.

Findings

QCNNs are robust against symmetry-breaking errors below a threshold.

QCNNs tolerate all symmetry-preserving errors if the error channel is invertible.

Constant-depth QCNNs exponentially reduce sample complexity compared to local measurements.

Abstract

The analysis of noisy quantum states prepared on current quantum computers is getting beyond the capabilities of classical computing. Quantum neural networks based on parametrized quantum circuits, measurements and feed-forward can process large amounts of quantum data to reduce measurement and computational costs of detecting non-local quantum correlations. The tolerance of errors due to decoherence and gate infidelities is a key requirement for the application of quantum neural networks on near-term quantum computers. Here we construct quantum convolutional neural networks (QCNNs) that can, in the presence of incoherent errors, recognize different symmetry-protected topological phases of generalized cluster-Ising Hamiltonians from one another as well as from topologically trivial phases. Using matrix product state simulations, we show that the QCNN output is robust against symmetry-breaking errors below a threshold error probability and against all symmetry-preserving errors provided the error channel is invertible. This is in contrast to string order parameters and the output of previously designed QCNNs, which vanish in the presence of any symmetry-breaking errors. To facilitate the implementation of the QCNNs on near-term quantum computers, the QCNN circuits can be shortened from logarithmic to constant depth in system size by performing a large part of the computation in classical post-processing. These constant-depth QCNNs reduce sample complexity exponentially with system size in comparison to the direct sampling using local Pauli measurements.