Proceedings of the 17th ACM International Conference on Computing Frontiers 2020
DOI: 10.1145/3387902.3394032
|View full text |Cite
|
Sign up to set email alerts
|

Quantum splines for non-linear approximations

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 10 publications
0
6
0
Order By: Relevance
“…However, the main challenge to tackle in the near future for qSLP-MAQA is still the design of a proper activation function-in the sense of the Universal Approximation Theorem-which is one of the significant issues for building a complete quantum neural network. Yet, a recent proposal of QSplines [13] opened the possibility of approximating non-linear activation functions via a quantum algorithm. Even so, QSplines use the HHL as a subroutine, a fault-tolerant quantum algorithm that cannot be adopted in hybrid computation on NISQ devices.…”
Section: Maqa As Quantum-classical Hybrid Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the main challenge to tackle in the near future for qSLP-MAQA is still the design of a proper activation function-in the sense of the Universal Approximation Theorem-which is one of the significant issues for building a complete quantum neural network. Yet, a recent proposal of QSplines [13] opened the possibility of approximating non-linear activation functions via a quantum algorithm. Even so, QSplines use the HHL as a subroutine, a fault-tolerant quantum algorithm that cannot be adopted in hybrid computation on NISQ devices.…”
Section: Maqa As Quantum-classical Hybrid Algorithmmentioning
confidence: 99%
“…For this purpose, a rich collection of quantum algorithms for basic linear algebra subroutines have been proposed in literature [9][10][11]. Some popular examples of this approach are QSVM [12] and QSplines [13], which obtain an exponential speed-up with respect to their classical counterparts. However, the protocols within this category usually assume the availability of a fault-tolerant quantum computer.…”
Section: Introductionmentioning
confidence: 99%
“…[23,24] In ref. [19], in the context of fault-tolerant quantum computing, the quantum splines to realize nonlinear approximation is proposed, in which Harrow Hassidim Lloyd (HHL) quantum algorithm is utilized. The classical activation functions popular in classical neural network has been realized in the quantum manner.…”
Section: Non-linearity Mapping Between the Input And Outputmentioning
confidence: 99%
“…In the classical computer, this nonlinear effect can be realized by bringing in various nonlinear activation functions. It deserves a deep study DOI: 10.1002/andp.202200546 how to realize the nonlinear activation function in the quantum manner, [14][15][16][17][18][19][20] serving quantum neural networks. [21] In this work, we propose to simulate the activation of the neuron and realize the nonlinearity by the quantum operation.…”
Section: Introductionmentioning
confidence: 99%
“…Notably, the idea of identifying specific classes of problems where the sparsity affects the computational complexity of a quantum algorithm has shown good results in the context of fault-tolerant quantum machine learning [14].…”
Section: Solving Csgp Using Qaoamentioning
confidence: 99%