Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This study introduces a symmetry-informed regularization technique for quantum neural networks that leverages input density matrices to enhance training convergence without explicitly defining symmetry groups. Numerical evaluations on classification tasks and quantum generative adversarial networks demonstrate modest but meaningful improvements in early-stage performance, offering a practical pathway to optimize QML model efficiency.
Source coveringarXiv

A regularization method for quantum neural networks using data symmetry

arXiv2 min read

arXiv:2607.03805v2 Announce Type: replace Abstract: Leveraging data symmetries has recently become a key strategy in quantum neural networks (QNNs) to improve training efficiency. In this study, we propose a symmetry-informed regularization method for QNNs based on an input density matrix. By introducing a penalty term that encourages the model to align with data symmetry, our method enables improved training speed. This symmetry-based regularization is simple to implement and does not require an explicitly specified symmetry group, although it requires access to training samples or to the input distribution from which an empirical or theoretical input density matrix can be constructed. We evaluate the method through numerical experiments on both classification tasks and quantum generative adversarial networks. In the small-scale classification experiments, the regularizer produced modest improvements in early-stage convergence and test loss. Our findings highlight the potential of symmetry-aware regularization in enhancing the performance of QML models.

Abstract:Leveraging data symmetries has recently become a key strategy in quantum neural networks (QNNs) to improve training efficiency. In this study, we propose a symmetry-informed regularization method for QNNs based on an input density matrix. By introducing a penalty term that encourages the model to align with data symmetry, our method enables improved training speed. This symmetry-based regularization is simple to implement and does not require an explicitly specified symmetry group, although it requires access to training samples or to the input distribution from which an empirical or theoretical input density matrix can be constructed. We evaluate the method through numerical experiments on both classification tasks and quantum generative adversarial networks. In the small-scale classification experiments, the regularizer produced modest improvements in early-stage convergence and test loss. Our findings highlight the potential of symmetry-aware regularization in enhancing the performance of QML models.

arXiv:2607.03805 [quant-ph]

(or arXiv:2607.03805v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2607.03805 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 231 words

Related coverage