Quantum perceptron over a field and neural network architecture selection in a quantum computer
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
In this work, we propose a quantum neural network named quantum perceptron over a field (QPF). Quantum computers are not yet a reality and the models and algorithms proposed in this work cannot be simulated in actual (or classical) computers. QPF is a direct generalization of a classical perceptron and solves some drawbacks found in previous models of quantum perceptrons. We also present a learning algorithm named Superposition based Architecture Learning algorithm (SAL) that optimizes the neural network weights and architectures. SAL searches for the best architecture in a finite set of neural network architectures with linear time over the number of patterns in the training set. SAL is the first learning algorithm to determine neural network architectures in polynomial time. This speedup is obtained by the use of quantum parallelism and a non-linear quantum operator.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“For instance, the Grover’s search algorithm [4] and Shor’s factoring algorithm [5] overcome any known classical algorithm.”
MethodQuantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · cited 1×
“The theoretical possibility of quantum computing initiated with Benioff [1] and Feynman [2] and the formalization of the first quantum computing model was proposed by Deutsch in 1985 [3].”
BackgroundQuantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · cited 1×
“Quantum computing has recently been used in the development of new machine learning techniques as quantum decision trees [6], artificial neural networks [7, 8, 9], associative memory [10, 11], and inspired the development of novel evolutionary algorithms for continuous optimization problems [12, 13].”
MethodThe quest for a Quantum Neural Network
Schuld, M., Sinayskiy, I., & Petruccione, F. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0809-8 · Cited by 671 · cited 3×
“Notions of Quantum Neural Networks have been put forward since the nineties [20], but a precise definition of what is a quantum neural network that integrates neural computation and quantum computation is a non-trivial open problem [14].”
BackgroundAltaisky, M. V. (2001) · arXiv · doi:10.48550/arxiv.quant-ph/0107012 · Cited by 101
Cited by
Training deep quantum neural networks
Beer, K., Bondarenko, D., Farrelly, T., Osborne, T. J., Salzmann, R., Scheiermann, D., & Wolf, R. (2020) · Nature Communications · doi:10.1038/s41467-020-14454-2 · Cited by 726
Metaheuristic design of feedforward neural networks: A review of two decades of research
Ojha, V. K., Abraham, A., & Snášel, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.013 · Cited by 606
Wan, C., Cai, P., Wang, M., Qian, Y., Huang, W., & Chen, X. (2020) · Advanced Materials · doi:10.1002/adma.201902434 · Cited by 343
A quantum deep convolutional neural network for image recognition
Li, Y., Zhou, R.-G., Xu, R., Luo, J., & Hu, W. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab9f93 · Cited by 225
“Specifically, those superiorities are mainly focused on the following aspects: processing information in parallel to obtain quantum speedup [33–35]; extracting the optimal network architecture with low cost [26, 36, 37]; improving the network performance [18, 38, 39] (including accuracy, generalization, and robustness…”
BackgroundMethodQuantum Machine Learning: A Review and Case Studies
Zeguendry, A., Jarir, Z., & Quafafou, M. (2023) · Entropy · doi:10.3390/e25020287 · Cited by 197
Metadata
- Authors
- da Silva, A. J., Ludermir, T. B., & de Oliveira, W. R.
- Venue
- Neural Networks
- Publisher
- Elsevier BV
- Published
- 2016-04
- Volume
- 76
- Pages
- 55-64
- ISSN
- 0893-6080 (ISSN-L)
- OpenAlex
- W2268223243
- Cited by
- 101
- References
- 8
- FWCI
- 8.58
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum perceptron over a field and neural network architecture selection in a quantum computer. https://app.cochat.ai/papers/10.1016/j.neunet.2016.01.002
- The paper
- da Silva, A. J., Ludermir, T. B., & de Oliveira, W. R. (2016). Quantum perceptron over a field and neural network architecture selection in a quantum computer. Neural Networks. https://doi.org/10.1016/j.neunet.2016.01.002
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.