@inproceedings{
yu2024nonasymptotic,
title={Non-asymptotic Approximation Error Bounds of Parameterized Quantum Circuits},
author={Zhan Yu and Qiuhao Chen and Yuling Jiao and Yinan Li and Xiliang Lu and Xin Wang and Jerry Zhijian Yang},
booktitle={The Thirty-eighth Annual Conference on Neural Information Processing Systems},
year={2024},
url={https://openreview.net/forum?id=XCkII8nCt3}
}
Understanding the power of parameterized quantum circuits (PQCs) in accomplishing machine learning tasks is one of the most important questions in quantum machine learning. In this paper, we focus on the PQC expressivity for general multivariate function classes. Previously established Universal Approximation Theorems for PQCs are either nonconstructive or assisted with parameterized classical data processing, making it hard to justify whether the expressive power comes from the classical or quantum parts. We explicitly construct data re-uploading PQCs for approximating multivariate polynomials and smooth functions and establish the first non-asymptotic approximation error bounds for such functions in terms of the number of qubits, the quantum circuit depth and the number of trainable parameters of the PQCs. Notably, we show that for multivariate polynomials and multivariate smooth functions, the quantum circuit size and the number of trainable parameters of our proposed PQCs can be smaller than the deep ReLU neural networks. We further demonstrate the approximation capability of PQCs via numerical experiments. Our results pave the way for designing practical PQCs that can be implemented on near-term quantum devices with limited resources.
Non-asymptotic Approximation Error Bounds of Parameterized Quantum Circuits
Zhan Yu Qiuhao Chen Yuling Jiao Yinan Li Xiliang Lu Xin Wang Jerry Zhijian Yang