Quantum Neural Networks
Open accessThe DOI matches its Crossref record; 49 of the 49 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
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
Zadeh, L. A. (1996) · Cited by 46,847
(2020) · Electromagnetic Processes · doi:10.2307/j.ctv131bv37.5 · Cited by 21,966
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 · cited 3×
“From a practical viewpoint, Shor’s result shows that a working quantum computer can violate the security of transactions that use the RSA protocol, a standard for secure transactions on the Internet.”
BackgroundInfluentialQuantum 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 · cited 1×
“Deutsch [13], Bernstein and Vazirani [8], and Yao [42].”
BackgroundElementary 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 · cited 3×
“It has been shown that one-qubit gates together with two-qubit controlled NOT gates are universal [4]; that is, any 2 ×2 unitary observing all the involved qubits.”
BackgroundMethodInfluential(1998) · Physics from Fisher Information · doi:10.1017/cbo9780511622670.006 · Cited by 4,018
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].”
MethodQuantum tunnelling in a dissipative system
Caldeira, A. O., & Leggett, A. J. (1983) · Annals of Physics · doi:10.1016/0003-4916(83)90202-6 · Cited by 3,647 · cited 1×
“significant aspect of the Dgate is irreversibility. To achieve this dissipative property in a quantum system, it is necessary to introduce some kind of controlled interaction with, say, an environment [11]. Designing specific mechanisms, though possible in principle, will not be facile. 5.1 Amplitude evolution equation…”
BackgroundInfluentialSchiff, L. I. (1949) · Cited by 3,018
Principles of Quantum Mechanics
Shankar, R. (1994) · Springer eBooks · doi:10.1007/978-1-4757-0576-8 · Cited by 2,015
Bernstein, 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 1×
“Deutsch [13], Bernstein and Vazirani [8], and Yao [42].”
BackgroundQuantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270 · cited 2×
“• Quantum mechanics can be defined using a density matrix formulation, which is typically used when incorporating computational network model [14].”
BackgroundMethod(1998) · The MIT Press eBooks · doi:10.7551/mitpress/5704.001.0001 · Cited by 1,114 · cited 1×
“It has been observed that the neurons fire a series of spikes and information may be encoded in the rate and timing of firing as well [24].”
BackgroundHow we know universals the perception of auditory and visual forms
Pitts, W., & McCulloch, W. S. (1947) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478291 · Cited by 799
Proceedings of the 30th IEEE symposium on Foundations of computer science
Galil, Z., & Blum, E. K. (1994) · Cited by 677
Chi-Chih Yao, A. (2002) · Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science · doi:10.1109/sfcs.1993.366852 · Cited by 633 · cited 1×
“Deutsch [13], Bernstein and Vazirani [8], and Yao [42].”
BackgroundMaintaining coherence in quantum computers
Unruh, W. G. (1995) · Physical Review A · doi:10.1103/physreva.51.992 · Cited by 594 · cited 1×
“Some models show the coherence time declining exponentially as the number of qubits increases [39].”
BackgroundPerspectives of Nonlinear Dynamics
Jackson, E. A. (1989) · Cambridge University Press eBooks · doi:10.1017/cbo9780511623974 · Cited by 530
FAULT-TOLERANT QUANTUM COMPUTATION
PRESKILL, J. (1998) · Introduction to Quantum Computation and Information · doi:10.1142/9789812385253_0008 · Cited by 466
Gruska, J. (1999) · Cited by 463
The Design and Analysis of Algorithms
Kozen, D. C. (1992) · Springer eBooks · doi:10.1007/978-1-4612-4400-4 · Cited by 457
Synthesis of Parallel Algorithms
Reif, J. H. (1993) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 450
Time/Space Trade-Offs for Reversible Computation
Bennett, C. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218053 · Cited by 405
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402 · cited 1×
“The concept of quantum computing, based on the quantum mechanical nature of physical reality, is first stated by Benioff [5] and Feynman [15], and formalized by Deutsch [13], Bernstein and Vazirani [8], and Yao [42].”
BackgroundOn Relating Time and Space to Size and Depth
Borodin, A. (1977) · SIAM Journal on Computing · doi:10.1137/0206054 · Cited by 386 · cited 1×
“[34] SPACE(s(n)) ı AND–OR circuits of size 2 s(n) and depth s(2)(n) via s(2)(n)-uniform space-bounded Turing machines.”
MethodPerspectives of Nonlinear Dynamics, vol. 1. By E. Atlee Jackson
Guckenheimer, J. M., & Jackson, E. A. (1990) · American Mathematical Monthly · doi:10.2307/2323851 · Cited by 312
Nonlinear Quantum Mechanics Implies Polynomial-Time Solution forNP-Complete and #PProblems
Abrams, D. S., & Lloyd, S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.3992 · Cited by 249 · cited 2×
“We define a new mathematical model of computation called Quantum Neural Networks (QNNs) , building on Deutsch’s model of quantum computational and Lloyd [1].”
MethodExplorations in Quantum Computing
Williams, C. P., & Bennett, C. (1999) · Physics Today · doi:10.1063/1.882526 · Cited by 248
Feynman, R. P. (2018) · CRC Press eBooks · doi:10.1201/9780429493249 · Cited by 242
Fast parallel circuits for the quantum Fourier transform
Cleve, R., & Watrous, J. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892140 · Cited by 215 · cited 1×
“(Recently, researchers have initiated the study of quantum computing using a polynomial number of qubits and a polylogarithmic number of steps [12, 17, 27, 28]).”
Background(1993) · CERN Document Server (European Organization for Nuclear Research) · Cited by 199
Quantum field theory : a modern introduction
加来, 道. (1993) · Oxford University Press eBooks · Cited by 167
Perspectives of nonlinear dynamics
Ermentrout, B. (1991) · Bulletin of Mathematical Biology · doi:10.1016/s0092-8240(05)80416-1 · Cited by 157
Explorations in quantum computing
de Wolf, R. (1998) · Science of Computer Programming · doi:10.1016/s0167-6423(98)90002-8 · Cited by 127
Landauer, R. (1995) · Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences · doi:10.1098/rsta.1995.0106 · Cited by 124
On Threshold Circuits and Polynomial Computation
Reif, J. H., & Tate, S. R. (1992) · SIAM Journal on Computing · doi:10.1137/0221053 · Cited by 102 · cited 2×
“possess an elegant algebraic structure as they can be naturally generalized to any domain, such as complex numbers.”
BackgroundMethodAHARONOV, D. (1999) · Annual Reviews of Computational Physics VI · doi:10.1142/9789812815569_0007 · Cited by 94 · cited 1×
“by Benioff [5] and Feynman [15], and formalized by Deutsch [13], Bernstein and Vazirani [8], and Yao [42]. For background material, the reader is referred to the papers mentioned above, survey papers [2, 9, 33, 38], books [18, 41], and courses available on the web [29, 40]. Considerable interest has been generated in q…”
BackgroundLandauer, R. W. (1995) · Springer eBooks · doi:10.1007/978-94-011-0041-0_33 · Cited by 75 · cited 1×
“Landauer [23] points out that this problem is largely ignored by the research community.”
BackgroundQuantum Circuits: Fanout, Parity, and CountingPreprint
Moore, C. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9903046 · Cited by 71 · cited 1×
“(Recently, researchers have initiated the study of quantum computing using a polynomial number of qubits and a polylogarithmic number of steps [12, 17, 27, 28]).”
BackgroundBerthiaume, A. (1997) · Springer eBooks · doi:10.1007/978-1-4612-1872-2_2 · Cited by 60
Depth Reduction for Circuits of Unbounded Fan-in
Allender, E., & Hertrampf, U. (1994) · Information and Computation · doi:10.1006/inco.1994.1057 · Cited by 45 · cited 1×
“For complexity theorists, the paper shows that the 2 log O(1) n bounds on threshold circuits obtained in various results such as [3] is not necessarily infeasible.”
BackgroundAn Introduction to Quantum Computing for Non-PhysicistsPreprint
Rieffel, E. G., & Polak, W. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9809016 · Cited by 21 · cited 1×
“For background material, the reader is referred to the papers mentioned above, survey papers [2, 9, 33, 38], books [18, 41], and courses available on the web [29, 40].”
BackgroundParallel Quantum Computation and Quantum CodesPreprint
Moore, C., & Nilsson, M. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9808027 · Cited by 12 · cited 1×
“(Recently, researchers have initiated the study of quantum computing using a polynomial number of qubits and a polylogarithmic number of steps [12, 17, 27, 28]).”
Background
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
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
- 49
- 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.