Quantum Neural Networks
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
This paper initiates the study of quantum computing within the constraints of using a polylogarithmic (O(logkn), k?1) number of qubits and a polylogarithmic number of computation steps. The current research in the literature has focussed on using a polynomial number of qubits. A new mathematical model of computation called Quantum Neural Networks (QNNs) is defined, building on Deutsch's model of quantum computational network. The model introduces a nonlinear and irreversible gate, similar to the speculative operator defined by Abrams and Lloyd. The precise dynamics of this operator are defined and while giving examples in which nonlinear Schrodinger's equations are applied, we speculate on its possible implementation. The many practical problems associated with the current model of quantum computing are alleviated in the new model. It is shown that QNNs of logarithmic size and constant depth have the same computational power as threshold circuits, which are used for modeling neural networks. QNNs of polylogarithmic size and polylogarithmic depth can solve the problems in NC, the class of problems with theoretically fast parallel solutions. Thus, the new model may indeed provide an approach for building scalable parallel computers.
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
A logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
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
Quantum 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
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679 · cited 1×
“There are two equivalent models for quantum computing, quantum Turing machines [8, 13] based on reversible Turing machines [6, 7] and quantum computational network [14].”
MethodBernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Steane, A. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9708022 · Cited by 1,390
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Cited by
An introduction to quantum machine learning
Schuld, M., Sinayskiy, I., & Petruccione, F. (2015) · Contemporary Physics · doi:10.1080/00107514.2014.964942 · Cited by 1,381
“A large share of the literature on quantum neural networks tries to find spe-cific quantum circuits that integrate the mechanisms of neural networks in some way [6, 51, 52, 53], trying to use the power of neural computing for quantum computation.”
BackgroundThe 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
“A large share of the literature on QNNs also comes from the discipline of quantum computing and tries to find specific quantum circuits that integrate the mechanisms of neural networks in some way [7,15,18,19,45,46].”
BackgroundQuantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
Quantum Models of Cognition and Decision
Busemeyer, J. R., Wang, Z., & Pothos, E. (2015) · Oxford Handbooks Online · doi:10.1093/oxfordhb/9780199957996.013.17 · Cited by 534
Ezhov, A. A., & Ventura, D. (2000) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-7908-1856-7_11 · Cited by 147
Unitary quantum perceptron as efficient universal approximator
Torrontegui, E., & García-Ripoll, J. J. (2019) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/125/30004 · Cited by 102
A hybrid quantum feature selection algorithm using a quantum inspired graph theoretic approach
Chakraborty, S., Shaikh, S. H., Chakrabarti, A., & Ghosh, R. (2020) · Applied Intelligence · doi:10.1007/s10489-019-01604-3 · Cited by 51
A recurrent quantum neural network model to describe eye tracking of moving targets
Behera, L., Kar, I., & Elitzur, A. C. (2005) · Foundations of Physics Letters · doi:10.1007/s10702-005-7125-6 · Cited by 48
A review of Quantum Neural Networks: Methods, Models, Dilemma
Zhao, R., & Wang, S. (2021) · arXiv · doi:10.48550/arxiv.2109.01840 · Cited by 26
Metadata
- Authors
- Gupta, S., & Zia, R. K. P.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2001-11
- Volume
- 63
- Issue
- 3
- Pages
- 355-383
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2044799191
- Cited by
- 195
- References
- 13
- FWCI
- 2.25
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.