Hongshun Yao

dblp:320/5657 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 67% Mathematical optimization · 33%
Artificial intelligence
1 paper
Learning theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum machine learning
0.612022
Power and limitations of single-qubit native quantum neural networks · NeurIPS 2022
Quantum computing and quantum information › quantum machine learning
quantum neural network
0.612022
Power and limitations of single-qubit native quantum neural networks · NeurIPS 2022
Mathematical optimization › approximation theory
universal approximation
0.612022
Power and limitations of single-qubit native quantum neural networks · NeurIPS 2022
Machine learning › Learning theory
approximation theory
0.212022
Power and limitations of single-qubit native quantum neural networks · NeurIPS 2022

Methods — techniques the papers use, named apart from their topics

fourier analysis · 1.1data re-uploading · 1.1
YearPublicationVenuePosition
2022 Power and limitations of single-qubit native quantum neural networks
abstract
Quantum neural networks (QNNs) have emerged as a leading strategy to establish applications in machine learning, chemistry, and optimization. While the applications of QNN have been widely investigated, its theoretical foundation remains less understood. In this paper, we formulate a theoretical framework for the expressive ability of data re-uploading quantum neural networks that consist of interleaved encoding circuit blocks and trainable circuit blocks. First, we prove that single-qubit quantum neural networks can approximate any univariate function by mapping the model to a partial Fourier series. We in particular establish the exact correlations between the parameters of the trainable gates and the Fourier coefficients, resolving an open problem on the universal approximation property of QNN. Second, we discuss the limitations of single-qubit native QNNs on approximating multivariate functions by analyzing the frequency spectrum and the flexibility of Fourier coefficients. We further demonstrate the expressivity and limitations of single-qubit native QNNs via numerical experiments. We believe these results would improve our understanding of QNNs and provide a helpful guideline for designing powerful QNNs for machine learning tasks.
Hongshun Yao, Mujin Li, Xin Wang 0022
NeurIPS2