The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index; none of the 30 sources its claims cite is checked for support yet.
The power of quantum neural networks
Open accessAbstract
It is unknown whether near-term quantum computers are advantageous for machine learning tasks. In this work we address this question by trying to understand how powerful and trainable quantum machine learning models are in relation to popular classical neural networks. We propose the effective dimension-a measure that captures these qualities-and prove that it can be used to assess any statistical model's ability to generalize on new data. Crucially, the effective dimension is a data-dependent measure that depends on the Fisher information, which allows us to gauge the ability of a model to train. We demonstrate numerically that a class of quantum neural networks is able to achieve a considerably better effective dimension than comparable feedforward networks and train faster, suggesting an advantage for quantum machine learning, which we verify on real quantum hardware.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper uses information geometry and the effective dimension to argue that well-designed quantum neural networks can achieve higher capacity and faster training than comparable classical feedforward networks. It links the Fisher information spectrum to barren plateaus and verifies a training advantage on the ibmq montreal 27-qubit device.
Key findings
- The quantum neural network consistently achieves the highest effective dimension over the finite-data ranges considered, followed by the easy quantum model and then the classical feedforward network; with \(s_{\text{in}}=4\), \(s_{\text{out}}=2\), and \(d=40\), the quantum model’s Fisher information spectrum is more uniform and lacks the classical model’s few very large eigenvalues.
- In training on the first two classes of the Iris dataset with \(d=8\), 100 iterations, ADAM with initial learning rate \(0.1\), and 100 trials, the quantum neural network reaches the lowest average training loss: \(23.14\%\), versus \(43.05\%\) for the easy quantum model and \(37.90\%\) for the classical network; average Fisher-Rao norms are \(117.84\), \(104.89\), and \(46.45\), respectively.
- The Fisher information spectrum connects to barren plateaus: the easy, classically simulable feature map becomes more “barren plateau-like” as qubit number increases, while the harder higher-order feature map shows resilience, with eigenvalues not concentrating near zero as system size grows.
- On real hardware, the quantum neural network is trained on the ibmq montreal 27-qubit device using 4 qubits with linear connectivity; training stabilizes after roughly 33 iterations, and the paper reports performance even better than simulated results.
Methods
- The paper defines neural networks as statistical models, uses the Fisher information matrix and effective dimension as capacity measures, proves a novel generalisation bound based on effective dimension (Theorem 3.2), and extends it to models without full-rank Fisher information via discretisation.
- It compares a quantum neural network using a depth-2 higher-order feature map and parameterised RY/CNOT variational form against classical feedforward networks and an “easy” quantum model with classically simulable angle encoding, matching models by number of trainable parameters \(d\), input size \(s_{\text{in}}\), and output size \(s_{\text{out}}\), with \(d \le 100\), \(s_{\text{in}} \in \{4,6,8,10\}\), and \(s_{\text{out}}=2\).
- Numerical experiments sample 100 parameter sets to estimate Fisher information spectra, train on the first two Iris classes with \(d=8\), 100 iterations, ADAM, learning rate \(0.1\), and 100 trials, and run one hardware training on ibmq montreal with 4 qubits and linear entanglement.
Limitations
- Stated: the hardware experiment is run only once due to limited hardware availability, and the authors note that analysis of hardware noise and spread over differently sampled initial parameters would make the results more robust.
- Stated: future work is needed on noise-induced barren plateaus, generalisation on multiple datasets, and larger models; the hard feature map’s classical hardness is conjectured rather than proven.
- Evident: comparisons are limited to specific feedforward topologies, a small Iris subset, and \(d \le 100\); effective-dimension estimates rely on Monte Carlo sampling and the paper notes that higher dimensions likely require more samples.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
28 Own interpretation · 23 Own result · 22 Not checked yet · 9 No basis given · 3 Own method
None of the sources cited for this claim have been checked yet.
In the paper
“a quantum neural network with an easier data encoding strategy, increases the likelihood of encountering a barren plateau”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We find that the effective dimension for a model trained on confusion sets with increasing label corruption, accurately captures generalisation behaviour.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We show that quantum neural networks are able to achieve a significantly better effective dimension than comparable classical neural networks.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“whilst a harder data encoding strategy shows resilience to the phenomenon.”
- Also stated in: § Abstract · p. 1 · plain
“Importantly, certain quantum neural networks can show resilience to this phenomenon and train faster than classical models due to their favourable optimisation landscapes, captured by a more evenly spread Fisher information spectrum.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Abstract · p. 1 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This behaviour is observed across all classical network configurations that we consider.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We find that well-designed quantum neural networks are able to achieve a higher capacity and faster training ability than comparable classical feedforward neural networks.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“which we find adds substantial power to a model (as seen in Section 4.2)”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Theorem B.5 (Generalisation bound for effective dimension without rank constraint) . Let Θ = [ -1 , 1] d and consider a statistical model M Θ := { p ( · , · ; θ ) : θ ∈ Θ } satisfying (4) . For κ ∈ N , let M ( κ ) Θ := { p ( κ ) ( · , · ; θ ) : θ ∈ Θ } be the discretised form as described above. Let d ( κ ) γ,n denote the effective dimension of M ( κ ) Θ as defined in (2) . Furthermore, let L : P(”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Lemma B.6. Let Θ = [ -1 , 1] d , and let N ( κ ) ( ε ) denote the number of boxes of side length ε required to cover the parameter set Θ , the length being measured with respect to the metric ˆ F ( κ ) ij ( θ ) . Under the assumption of Theorem B.5, there exists a dimensional constant c d < ∞ such that for γ ∈ (0 , 1] and for all n ∈ N , we have”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The quantum neural network, however, maintains a more uniform spectrum over increasing s in and d , showing promise in avoiding unfavourable qualities, such as barren plateaus.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 27
- Probably not a substantial claim. 18
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The classical model's Fisher information spectrum is concentrated around zero, where the majority of eigenvalues are negligible 17 , however, there are a few very large eigenvalues.”
- Also stated in: § 4.1 The Fisher information spectrum · p. 8 · plain
“Specifically, of the order 10 -14 , i.e., close to machine precision and thus, indistinguishable from zero.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § 4.1 The Fisher information spectrum · p. 8 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Whilst on average, the classical model trains to a lower loss than the easy quantum model, the spread is significantly larger.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We further verify the performance of the quantum neural network on real quantum hardware and train the model using the ibmq montreal 27-qubit device, where the training advantage persists.”
- Also stated in: § 4.2 Capacity analysis · p. 9 · plain
“We plot the hardware results till they stabilise, at roughly 33 training iterations and find the performance to be even better than the simulated results.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § 4.2 Capacity analysis · p. 9 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Using a cross-entropy loss function, optimised with ADAM for a fixed number of training iterations = 100 and an initial learning rate = 0 . 1, the quantum neural network trains to a lower loss, faster than the other two models over an average of 100 trials.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“When higher dimensions are considered, the standard deviation around the results increases, but 100 data and parameter samples are still reasonable given that we consider a maximum of d = 100.”
plaindirectn = 100- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The quantum neural network maintains the lowest loss value on average across all three models, with the lowest spread over all training iterations.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This occurs after roughly 33 training steps.”
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The quantum neural network, on the other hand, has a non-degenerate Fisher information matrix and the effective dimension converges to the maximum effective dimension, d .”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The easy quantum model has a somewhat uniform spectrum for a smaller input size, but this deteriorates as the input size (also equal to the number of qubits in this particular model) increases.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The quantum neural network notably has the highest Fisher-Rao norm and lowest training loss on average.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The easy quantum model also has most of its eigenvalues close to zero, and whilst there are some large eigenvalues, their magnitudes are not as extreme as the classical model.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The quantum neural network, on the other hand, has a different Fisher information spectrum. The distribution of eigenvalues is more uniform, with no outlying values and remains more or less constant as the number of qubits increase (see Appendix C.2).”
- Also stated in: § 4.1 The Fisher information spectrum · p. 8 · plain
“The distribution of eigenvalues is the most uniform in the quantum neural network, whereas the other models contain mostly small eigenvalues and larger condition numbers.”
plainn = 100- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § 4.1 The Fisher information spectrum · p. 8 · plain
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The effective dimension correctly increases as the data becomes 'more random' and is thus, able to accurately capture a model's generalisation behaviour.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The number of data observations determines a natural scale or resolution used to observe model space.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This is beneficial for practical reasons where data is often limited, and can help in understanding how data availability influences the accurate capture of model complexity.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Notably, the Fisher-Rao norm acts as an umbrella for several other existing norm-based measures [45-47] and has demonstrated desirable properties both theoretically, and empirically.”
What the sources say
- Not checked yetcites [45] Neyshabur, B., Salakhutdinov, R. R. & Srebro, N. Path-SGD: path-normalized optimization in deep neural networks. In Advances in Neural Information Processing Systems 28, 2422–2430 (NIPS, 2015).
- Not checked yetcites [46] Neyshabur, B., Tomioka, R. & Srebro, N. Norm-based capacity control in neural networks. In Proc. Machine Learning Research Vol. 40, 1376–1401 (PMLR, 2015); http://proceedings.mlr.press/v40/Neyshabur15.html
- Not checked yetcites [47] Bartlett, P. L., Foster, D. J. & Telgarsky, M. J. Spectrally-normalized margin bounds for neural networks. In Advances in Neural Information Processing Systems 30, 6240–6249 (NIPS, 2017); http://papers.nips.cc/paper/7204-spectrally-normalized
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This implies that the loss landscape becomes increasingly flat as the size of the model increases, making optimisation more difficult.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“This is consistent with results from literature, where the Fisher information matrix of non-linear classical neural networks is known to be highly degenerate, with a few large eigenvalues [34].”
What the sources say
- Not checked yetcites [34] Bishop, C. Exact calculation of the Hessian matrix for the multilayer perceptron. Neural Comput. 4, 494–501 (1992). source
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“From [23], we know that we are in a barren plateau if, for parameters θ uniformly sampled from Θ, each element of the gradient of the loss function with respect to θ vanishes exponentially in the number of qubits, S .”
What the sources say
- Not checked yetcites [23] Rissanen, J. J. Fisher information and stochastic complexity. IEEE Trans. Inf. Theory 42, 40–47 (1996). source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“In [44], the authors leverage geometric invariances associated with the Fisher information, to produce the Fisher-Rao norm-a robust norm-based capacity measure”
What the sources say
- Not checked yetcites [44] Liang, T., Poggio, T., Rakhlin, A. & Stokes, J. Fisher–Rao metric, geometry, and complexity of neural networks. In Proc. Machine Learning Research Vol. 89, 888–896 (PMLR, 2019); http://proceedings.mlr.press/v89/liang19a.html
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Conversely, a model with a Fisher information spectrum that is not concentrated around zero is unlikely to experience a barren plateau.”
- Also stated in: § 5 Conclusion · p. 10 · hedged
“A model with eigenvalues of the Fisher information matrix that do not vanish as the number of qubits grow, is unlikely to suffer from a barren plateau.”
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Also stated in: § 5 Conclusion · p. 10 · hedged
None of the sources cited for this claim have been checked yet.
In the paper
“a quantity that describes the geometry of a model's parameter space and is essential in both statistics and machine learning [20-22].”
What the sources say
- Not checked yetcites [20] Du, Y., Hsieh, M.-H., Liu, T. & Tao, D. Expressive power of parametrized quantum circuits. Phys. Rev. Res. 2, 033125 (2020). source
- Not checked yetcites [21] Huang, H.-Y. et al. Power of data in quantum machine learning. Nat. Commun. 12, 2631 (2021). source
- Not checked yetcites [22] Berezniuk, O., Figalli, A., Ghigliazza, R. & Musaelian, K. A scale-dependent notion of effective dimension. Preprint at https://arxiv.org/abs/2001.10872 (2020).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Often, quantum neural networks suffer from a barren plateau phenomenon, wherein the loss landscape is perilously flat, and consequently, parameter optimisation is extremely difficult [23].”
What the sources say
- Not checked yetcites [23] Rissanen, J. J. Fisher information and stochastic complexity. IEEE Trans. Inf. Theory 42, 40–47 (1996). source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“it is worthwhile to note that the effective dimension does not necessarily increase monotonically with n”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“These types of spectra are known to slow down a model's training and may render optimisation suboptimal [31].”
What the sources say
- Not checked yetcites [31] Volkoff, T. & Coles, P. J. Large gradients via correlation in random parameterized quantum circuits. Quant. Sci. Technol. 6, 025008 (2021). source
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“measures such as the effective dimension have been motivated from an information-theoretic standpoint and depend on the Fisher information”
What the sources say
- Not checked yetcites [20] Du, Y., Hsieh, M.-H., Liu, T. & Tao, D. Expressive power of parametrized quantum circuits. Phys. Rev. Res. 2, 033125 (2020). source
- Not checked yetcites [21] Huang, H.-Y. et al. Power of data in quantum machine learning. Nat. Commun. 12, 2631 (2021). source
- Not checked yetcites [22] Berezniuk, O., Figalli, A., Ghigliazza, R. & Musaelian, K. A scale-dependent notion of effective dimension. Preprint at https://arxiv.org/abs/2001.10872 (2020).
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Overall, we have shown that quantum neural networks can possess a desirable Fisher information spectrum that enables them to train faster and express more functions than comparable classical and quantum models-a promising reveal for quantum machine learning, which we hope leads to further studies on the power of quantum models.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Since the classical models contain highly degenerate Fisher information matrices, the effective dimension converges the slowest, followed by the easy quantum model.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“A sensitivity analysis is included in Appendix C.1 to verify that 100 parameter samples are reasonable for the models we consider.”
plaindirectn = 100- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“In all experiments conducted in this study, we examine the effective dimension over a wide range of n , to ensure it is sufficient in accurately estimating the size of a model.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In the limit n →∞ , all models will converge to an effective dimension equal to the maximum rank of the Fisher information matrix.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Classically, the observed Fisher information spectrum is known to have undesirable optimisation properties where the outlying eigenvalues slow down training and loss convergence [31].”
What the sources say
- Not checked yetcites [31] Volkoff, T. & Coles, P. J. Large gradients via correlation in random parameterized quantum circuits. Quant. Sci. Technol. 6, 025008 (2021). source
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The capacity results will, thus, be sensitive to the number of data samples used in estimating the Fisher information matrix for a given θ , and to the number of θ samples then used to calculate the effective dimension.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The quantum neural network with a hard feature map is an example of such a model showing resilience to this phenomenon with good trainability, supported by results from real quantum hardware.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Rests on an assumption: The feature map used in the quantum neural network is hard to simulate classically.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A particular quantum neural network offers advantages from both a capacity and trainability perspective. These advantages are captured by a high effective dimension and a non-degenerate Fisher information matrix.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- Rests on an assumption: The feature map used in the quantum neural network is hard to simulate classically.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Upon examining the quantum neural network over an increasing system size (see Appendix C.2), the eigenvalue distribution of the Fisher information matrix remains more or less constant, and a large amount of the eigenvalues are not near zero, thus, the model shows resilience against barren plateaus.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In this study, the effective dimension is presented as a robust capacity measure for quantum and classical models, which we justify through proof of a novel generalisation bound.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“Due to limited hardware availability, this experiment is only run once and an analysis of the hardware noise and the spread of the training loss for differently sampled initial parameters would make these results more robust.”
hedgedconditionalSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Remark B.7 (How to choose the discretisation parameter κ ) . In this remark we discuss conditions such that the generalisation bound of Theorem B.5 for the discretised model M ( k ) Θ is a good approximation to a generalisation bound of the original model M Θ . Assume that the model M Θ satisfies an additional regularity assumption of the form ‖∇ θ ˆ F ( θ ) ‖ ≤ Λ for some Λ ≥ 0 and for all θ ∈ Θ,”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Indeed, this is a rather strong bound as it forces ˆ F to have constant rank, so it is desirable to find a variant of Lemmas B.1 and B.2 that do not require such an assumption.”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The feature map in the quantum neural network is conjectured to be hard to simulate classically, and replacing it with one that is easily simulable, impairs these advantages.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
- Rests on an assumption: The feature map used in the quantum neural network is hard to simulate classically.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For higher d , it is likely that more samples will be needed.”
hedgedconditionaln = 100- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The authors state this as an assumption.
The statistical model satisfies the regularity assumption (4).
“We assume the following regularity assumption on the model M Θ := { p ( · , · ; θ ) : θ ∈ Θ } :”
The paper relies on this without support.
The feature map used in the quantum neural network is hard to simulate classically.
“The feature map in the quantum neural network is conjectured to be hard to simulate classically”
“The quantum neural network's encoding scheme is conjectured to be difficult.”
The paper relies on this without support.
The capacity of quantum neural networks is not well explored, and no such Fisher information analysis has been done for them.
“In stark contrast to classical models, understanding the capacity of quantum neural networks is not well explored.”
“For quantum neural networks, no such analysis has been done.”
The authors state this as an assumption.
The loss function in Theorem 3.2 is bounded.
“the assumption that the loss function in Theorem 3.2 has to be bounded.”
The paper relies on this without support.
The relative entropy is α-Hölder continuous in its first argument for α∈(0,1) and log-Lipschitz continuous in its first argument.
“We further note that the relative entropy is α -H¨ older continuous in the first argument for α ∈ (0 , 1). In fact, the relative entropy is even log-Lipschitz continuous in the first argument”
The paper relies on this without support.
In practical applications, the Fisher matrix is evaluated at finitely many points.
“Our approach to this general problem is based on the idea that, in practical applications, the Fisher matrix is evaluated at finitely many points, so it makes sense to approximate a statistical model with a discretised one where the corresponding Fisher information matrix is piecewise constant.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum neural networks (QNNs), for instance, exploit quantum superposition and entanglement to process information in ways that classical networks cannot, potentially accelerating training times and improving performance on complex data sets [18].”
From Quantum-Trained Convolutional Neural Network for Deepfake Audio Detection (2025) · cites this paper as [18]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“there have been a number of strides in evaluating or compressing these evolutions using variational approaches [90, 91].”
From Variational quantum algorithms (2021) · cites this paper as [90]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Variational methods can be applied incrementally in these cases, by stepping the electronic wavefunction forward with time-dependent variational principles [90, 91] and sampling the forces [260] to move the nuclei classically, resulting in a Born-Oppenheimer type molecular dynamics.”
From Variational quantum algorithms (2021) · cites this paper as [90]
Experimental — accuracy not yet measuredIn the citing paper
“For a given number of neurons, quantum neural networks can be more expressiveeven exponentially, for specific network architectures -than their classical counterpart.[225][226][227]”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [227]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3 Information geometry, effective dimension, and trainability of quantum neural networks · p. 3
“We use a straightforward angle encoding scheme, where data points are encoded via RY-gates on each qubit without entangling them, with rotations equal to feature values normalised to [ -1 , 1].”
§ A.1 Specific feature maps · p. 11
“The classically simulable feature map employed in the easy quantum model, is simply the first sets of Hadamard and RZgates, as done in Figure 4 and is not repeated.”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ A.1 Specific feature maps · p. 11
“Then, RZZ-gates are implemented on qubits i, i + j for i ∈ [1 , . . . , S -1] and j ∈ [ i +1 , . . . , S ]”
§ A.1 Specific feature maps · p. 11
“Figure 4 contains a circuit representation of the feature map developed in [39] and used in this study in the quantum neural network model. First, the feature map applies Hadamard gates on each of the S := s in qubits”
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. (2000) · Statistics for Engineering and Information Science · doi:10.1007/978-1-4757-3264-1 · Cited by 46,387
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Scikit-learn: Machine Learning in Python
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2078195 · Cited by 8,539
Natural Gradient Works Efficiently in Learning
Амари, Ш.-И. (1998) · Neural Computation · doi:10.1162/089976698300017746 · Cited by 2,914
Supervised learning with quantum-enhanced feature spaces
Havlíček, V., Córcoles, A. D., Temme, K., Harrow, A. W., Kandala, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-0980-2 · Cited by 2,572
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Advances in Neural Information Processing Systems 27 (NIPS 2014)
Zhong, M., Goddard, N., & Sutton, C. A. (2014) · Cited by 2,440
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
Neural Networks: Tricks of the Trade: Second Edition
(2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8 · Cited by 2,116
Quantum convolutional neural networks
Cong, I., Choi, S., & Lukin, M. D. (2019) · Nature Physics · doi:10.1038/s41567-019-0648-8 · Cited by 1,517
Research works printed but not linked: 13
- Goodfellow, I., Bengio, Y. & Courville, A. Deep Learning (MIT Press, 2016); http://www.deeplearningbook.org
- Farhi, E. & Neven, H. Classification with quantum neural networks on near term processors. Quant. Rev. Lett. 1, 2 (2020).
- Sontag, E. D Neural Networks and Machine Learning 69–95 (Springer, 1998).
- Neyshabur, B., Bhojanapalli, S., McAllester, D. & Srebro, N. Exploring generalization in deep learning. In Advances in Neural Information Processing Systems 30, 5947–5956 (NIPS, 2017).
- Kunstner, F., Hennig, P. & Balles, L. Limitations of the empirical Fisher approximation for natural gradient descent. In Advances in Neural Information Processing Systems 32 4156–4167 (NIPS, 2019); http://papers.nips.cc/paper/limitations-of-fisher-approximation
- Karakida, R., Akaho, S. & Amari, S.-I. Universal statistics of Fisher information in deep neural networks: mean field approach. In Proc. Machine Learning Research Vol. 89, 1032–1041 (PMLR, 2019); http://proceedings.mlr.press/v89/karakida19a.html
- Liang, T., Poggio, T., Rakhlin, A. & Stokes, J. Fisher–Rao metric, geometry, and complexity of neural networks. In Proc. Machine Learning Research Vol. 89, 888–896 (PMLR, 2019); http://proceedings.mlr.press/v89/liang19a.html
- Neyshabur, B., Salakhutdinov, R. R. & Srebro, N. Path-SGD: path-normalized optimization in deep neural networks. In Advances in Neural Information Processing Systems 28, 2422–2430 (NIPS, 2015).
- Neyshabur, B., Tomioka, R. & Srebro, N. Norm-based capacity control in neural networks. In Proc. Machine Learning Research Vol. 40, 1376–1401 (PMLR, 2015); http://proceedings.mlr.press/v40/Neyshabur15.html
- Bartlett, P. L., Foster, D. J. & Telgarsky, M. J. Spectrally-normalized margin bounds for neural networks. In Advances in Neural Information Processing Systems 30, 6240–6249 (NIPS, 2017); http://papers.nips.cc/paper/7204-spectrally-normalized
- Rissanen, J. J. Fisher information and stochastic complexity. IEEE Trans. Inf. Theory 42, 40–47 (1996). · DOI · Paper page
- Marrero, C. O., Kieferová, M. & Wiebe, N. Entanglement induced barren plateaus. Preprint at https://arxiv.org/abs/2010.15968 (2020). · arXiv
- Virmaux, A. & Scaman, K. Lipschitz regularity of deep neural networks: analysis and efficient estimation. In Advances in Neural Information Processing Systems 31, 3835–3844 (NIPS, 2018); http://papers.nips.cc/paper/lipschitz-regularity-of-deep-neural-networks
Cited by
Sorted by citations
Items 901–1,000 of 1,000
Kavitha, S. S., Kaulgud, N., & Sharmila, B. S. (2026) · SN Computer Science · doi:10.1007/s42979-026-04758-3
STQS: A Unified System Architecture for Spatial Temporal Quantum Sensing
Jebraeilli, A., Liu, C., Yin, K., Stein, S., Lentz, E., Ding, Y., & Li, A. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3795881 · Cited by 3
Balaji, A., & Brown, N. B. (2026) · Research Square · doi:10.21203/rs.3.rs-8951581/v1
Quantum recurrent neural network for sequential labeling
Pandey, S., Pakray, P., & Zanzotto, F. M. (2026) · Knowledge and Information Systems · doi:10.1007/s10115-026-02685-6
Hybrid Quantum-Classical UNet for Image Segmentation: Breaking the Parameter Scaling Barrier
Lim, S.-C., & Kim, J.-C. (2026) · IEEE Access · doi:10.1109/access.2026.3669206
Ramana, R. M., Sreenivasu, S. V. N., Satyanarayana, P. E., Seetharam, K., Vasundhara, P., & B.Mahaboob (2025) · IEEE International Conference for Women in Computing (InCoWoCo) · doi:10.1109/incowoco68239.2025.11406952
Assessing the advantages and limitations of quantum neural networks in regression tasks
de Lima, G. G., Farias, T. D. S., Ricardo, A. C., & Villas-Bôas, C. J. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00370-z
Malarvel, M., Kaliyamurthie, K. P., & Antonidoss, A. (2025) · IEEE International Conference on Innovations in Engineering and Next-Generation Technologies for Sustainability (ICINVENTS) · doi:10.1109/icinvents64613.2025.11402497
Liu, H., & Lou, X. (2026) · Quantum Engineering · doi:10.1155/que2/6643049 · Cited by 1
6G AI Security : from fundamentals to offensive and defensive landscape in 6G
Braeke, A., Deac, D., Nguyen, T. T., Gür, G., Pham, Q., Yapa, C., Naranjo, P. G. V., Mora, H. C., Moremada, C., & Liyanage, M. (2026) · Zürcher Hochschule für Angewandte Wissenschaften digital collection (Zurich University of Applied Sciences) · doi:10.21256/zhaw-35849
Yang, J., Cai, Q., Guo, J., & Deng, G. (2026) · Acta Physica Sinica · doi:10.7498/aps.75.20251792
Quantum Neural Network with Adaptive PID Control for DC Motor
Teng, H.-Y., Hsu, K.-C., & Hung, L.-C. (2025) · International Conference on Orange Technology (ICOT) · doi:10.1109/icot68409.2025.11425129
Liu, Z., Zheng, C., Zheng, H., & Wang, J. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae51c8
FitQT: a fully integrated and trainable quantum transformer for scalable natural language processing
Pham, L., & Le, A. T. (2026) · Engineering Research Express · doi:10.1088/2631-8695/ae5507
Günel, T., & Kara, K. (2026) · Acta Infologica · doi:10.26650/acin.1799569
Hybrid Quantum Classical Acceleration of Machine Learning Algorithms: A Performance Study
Mahesh, V., Krishnamoorthy, R., S, D. V. M., Mehta, D., & P, K. M. (2026) · EPJ Web of Conferences · doi:10.1051/epjconf/202636001011
Jagannathan, S. K., Thomas Abraham, J. V., Yogesh, C., & Franklin Joel Benedict, T. (2026) · EPJ Web of Conferences · doi:10.1051/epjconf/202636001029 · Cited by 1
Dharshan, V., Markkandan, S., & Sugunapriya, A. (2026) · International Conference on Communication, Computing and Electronics Systems (ICCCES) · doi:10.1109/iccces62661.2026.11436387
Papalkar, R. R., Jadhav, Y., Dudhe, P. S., Deshmukh, D. M. S., Motekar, H. S., Patil, T., Kanse, R. R., & Parandekar, A. B. (2026) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.70693
Athira, P., & Deepika, M. (2026) · 2026 2nd International Conference on Advances in Intelligent Computing and Applications (AICAPS) · doi:10.1109/aicaps68631.2026.11452990
Comparative Analysis of Classical and Quantum Runge-Kutta Methods in Classification TasksPreprint
Patel, J. (2026) · Research Square · doi:10.21203/rs.3.rs-9286122/v1
Sáez‐Ortuño, L., Isgrò, V., Forgas‐Coll, S., & Ferrara, M. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6509824
Quantum Artificial Intelligence
Andrews, E., & Mishra, P. (2026) · Springer eBooks · doi:10.1007/978-3-032-09303-5_4
Jaiswal, A. K., Bisht, B., Yadav, H. K., & Kumar, P. (2026) · IEEE International Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI) · doi:10.1109/iatmsi68868.2026.11465388
Novel Prospects of Image Restoration Inspired by Concepts of Quantum Mechanics
Dutta, S. (2023) · theses.fr (ABES) · doi:10.70675/8fe483d0z8da8z4b27z9b57z484d2a51ec01
Advantage with quantum reservoir computing in medical insurance and health data analysis
Tamturk, M., Ginossar, E., & Carenzo, M. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00384-7
Adversarial Robustness Guarantees for Quantum Classifiers
West, M., Dowling, N., Southwell, A., Nakhl, A. C., Sevior, M., Usman, M., & Modi, K. K. (2026) · Quantum science and technology · doi:10.1007/978-3-032-11153-1_7
Variational Quantum Algorithms for Image ClassificationPreprint
Sum-Shik, A., & Thoma, P. (2026) · Research Square · doi:10.21203/rs.3.rs-9349408/v1
A Hybrid Quantum–Classical Machine Learning Framework for Black Carbon Forecasting
Oliva-González, I., González, L. T., Lara-Montaño, O. D., Ramírez, A., Mendoza, A., & Hernández-Romero, I. M. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00511-0
Quantum Machine Learning for Materials Science
Pei, Z. (2026) · The Materials Research Society series · doi:10.1007/978-3-032-14541-3_11
Hybrid Variational Quantum Circuit for Satellite Image Classification
Pham, T. T., Nguyen, L. X., Tran, P.-N., Huh, E., & Hong, C. S. (2026) · International Conference on Information Networking · doi:10.1109/icoin68469.2026.11480570
Image classification of archaeological artifacts using quantum neural networks
Guingo, B. C., de Souza, L. C., da Silva, E. K., Cisneiros, D., & Portugal, R. (2026) · Digital Applications in Archaeology and Cultural Heritage · doi:10.1016/j.daach.2026.e00539
Real Time Facial Emotion Analysis with Quantum-Inspired CNN
Rajeswarappa, G., Prathima, C., Charishma, R., Kumar, K. P., Praneetha, P., & Parashara, S. C. (2026) · Contemporary Computing Innovations Conference (CCIC) · doi:10.1109/ccic68129.2026.11486241
Jha, M., Chen, S. Y.-C., Kulkarni, C. M., & Kim, J. (2026) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2026.114991 · Cited by 2
Fidelity-Based Quantum Kernels for Hybrid Financial Fraud Detection Pipelines
Latheef, F. N., A, J. T., & Rubell Marion Lincy, G. (2026) · IEEE International Conference on Emerging Computing and Intelligent Technologies (ICoECIT) · doi:10.1109/icoecit68303.2026.11497101
Quantum-Inspired Active Learning for Accelerated Materials Discovery
Kapoor, A. (2026) · International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp) · doi:10.1109/nqcomp68334.2026.11497667
Jari, A., J, S. B., & Shidaganti, G. I. (2026) · International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp) · doi:10.1109/nqcomp68334.2026.11497767
Ji, N., Zheng, G., Pan, C., Zhou, Y., & Guo, Y. (2026) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2026.3689847
A2G-QFL: Adaptive Aggregation with Two Gains in Quantum Federated Learning
Nanayakkara, S. I., & Pokhrel, S. R. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00132
Consensus Protocols for Entanglement-Aware Scheduling in Distributed Quantum Neural Networks
Chen, K.-C., Chen, S. Y.-C., Chehimi, M. M., Burt, F., & Leung, K. K. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00092
Quantum phase recognition via swap-test-based correlation mechanism
Chen, J.-L., Li, X., & Yin, Z. (2026) · Physical Review A · doi:10.1103/rcjd-bgdb
Park, J., Park, Y., & Cha, J. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00147
A Distributed Quantum Neural Network for Network Anomaly Detection
Hdaib, M., Rajasegarar, S., & Loke, S. W. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00109
AgriQPro-Quantum Driven Precision Optimization for Smart Agriculture
Vinutha, N., S, P. J. R., Devanagouda, Bharathi, G., Reddy, C. V., & Nalband, A. H. (2026) · International Conference on Innovative Trends in Information Technology (ICITIIT) · doi:10.1109/icitiit68860.2026.11499690
Quantum Convolutional Neural Networks (QCNN) for 6G Multi-User Interference Mitigation
Tong, K., Kim, J., Jung, Y., Jeong, H.-Y., Choi, M., & Song, H. (2026) · International Conference on Software Engineering and Information Management (ICSIM) · doi:10.1145/3796315.3796356
Феррара, М., Sáez‐Ortuño, L., Forgas‐Coll, S., Fabila, J., Martín-Isla, C., & Lekadir, K. (2026) · Statistics · doi:10.1080/02331888.2026.2667471 · Cited by 1
Método de Classificação de Imagens Usando Aprendizado de Máquina com Computação Quântica
Belluzzo, L. S., & Silveira, R. M. (2026) · Anais Estendidos do Simpósio Brasileiro de Sistemas de Informação (SBSI) · doi:10.5753/sbsi_estendido.2026.249013
Design of an approximate quantum encoding model based on quantum circuits
Zheng, J., Gao, Q., Du, Y., Lü, J., & Ogorzałek, M. (2026) · Automatica · doi:10.1016/j.automatica.2026.113052
FCA Quantum Neural Networks for Interpretable Neuro-symbolic Classification
Akremi, O., Sellami, M., & Gammoudi, M. M. (2026) · IEEE International Conference on Complex Systems and Intelligent Computing (ICCSIC) · doi:10.1109/iccsic69301.2026.11521467
Rezaei, P., Rahgozar, B., Khan, M. S., Yadollahi, M., & SaberiKamarposhti, M. (2026) · IEEE International Colloquium on Signal Processing & Its Applications (CSPA) · doi:10.1109/cspa68262.2026.11517902
An Intelligent Hybrid Quantum Machine Learning Approach for Early Anomaly Detection
Singh, B., Kumar, D., Kumar, P., & Tyagi, V. (2026) · International Conference on Intelligent Processing, Hardware, Electronics, and Radio Systems (CIPHER) · doi:10.1109/cipher70417.2026.11523963
Ganguly, S. (2026) · Research Square · doi:10.21203/rs.3.rs-9487599/v1
Karthiga, M., Joseph, E. R., Patil, S., & Saranya, K. C. (2026) · Frontiers in Behavioral Neuroscience · doi:10.3389/fnbeh.2026.1797210
Lee, D., & Lee, S. (2026) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1016/j.cacaie.2026.100101
Distributed Quantum Learning Over Near-Term Devices: Convergence Analysis and Security Design
Pokharel, A., Shaon, S., Morris, T. H., & Nguyen, D. C. (2026) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2026.3696594
Hybrid Quantum-Enhanced Deep Learning Framework for Multi-Stage Diabetic Retinopathy Detection
Srikanth, G., Harshini, A., Hemasri, C., Vamsi, D., & Kumar, B. P. (2026) · International Conference on Knowledge Engineering and Communication Systems (ICKECS) · doi:10.1109/ickecs70176.2026.11527675
A Hybrid Classical–Quantum Variational Learning Framework for Breast Mass Classification
Khot, B. A. P., Shanthamallappa, M., Havaldar, R. H., Ittannavar, S. S., Vijayalaxmi, R. S., & Kumar, B. P. P. (2026) · International Conference on Knowledge Engineering and Communication Systems (ICKECS) · doi:10.1109/ickecs70176.2026.11527499
Quantum k-Means Clustering Using Hadamard-Test-Based Similarity Estimation
Alaeiyan, M., Torabi, S., & Alaeiyan, M. (2026) · Computers · doi:10.3390/computers15060355
Maha Sweta, S., Rajakumar, B., Mahendran, R., & Surendran, R. (2026) · International Conference on Communications and Signal Processing (ICCSP) · doi:10.1109/iccsp68173.2026.11539164
Varun, S., & Abirami, S. (2026) · International Conference on Emerging Trends in Advancements and Applications of Computational Intelligence Techniques (ETAACT) · doi:10.1109/etaact69135.2026.11541506
Accelerating two‑dimensional quantum Fourier transforms in quantum neural networks
Gomez, A. A., Torres-Concoha, E., Grigoryan, A. M., & Agaian, S. S. (2026) · Multimodal Image Exploitation and Learning · doi:10.1117/12.3094220
Quantum slant transform design for quantum neural network processing
Gomez, A. A., Grigoryan, A. M., & Agaian, S. S. (2026) · Multimodal Image Exploitation and Learning · doi:10.1117/12.3094702
Quantum artificial intelligence: Bridging innovation, ethics, and sustainability in a hybrid era
Atoum, I. A. (2026) · International Journal of Knowledge-based and Intelligent Engineering Systems · doi:10.1177/13272314261456990
Quantum Enhanced Data-driven Learning for Defect Reduction in Etching Process
Yang, Z., Wang, L.-W., Chen, Y., Chao, Y.-H., Tsai, C., Wu, M.-T., Lee, H.-J., Lian, N.-T., Yang, T., Chen, K., et al. (2026) · ASMC proceedings · doi:10.1109/asmc69324.2026.11551187
QuANTiM: Quantum-Inspired Adaptive Neural Networks for Photonic IoT Edge Intelligence
Mondal, S. S., Das, A., Huq, S., Golder, A., & Hossain, M. A. (2026) · doi:10.1109/qpain69676.2026.11545553
Rundo, F. (2026) · Big Data and Cognitive Computing · doi:10.3390/bdcc10060191
A QNN-Based Framework for Enhancing Reliability in Critical 5G Networks
Tiwari, A., Molakatala, N., & Rehman, A. S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-26349-0_11
A Computational Framework for Adaptive Circuit Selection in Noisy Quantum Communication Simulations
Dehingia, K., & Dutta, N. (2026) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.70803
Variational quantum reservoir networks for multivariate time-series prediction
Sharma, C., & Sood, S. K. (2026) · Nonlinear Dynamics · doi:10.1007/s11071-026-12707-1
A Lightweight Hybrid Quantum–Classical Neural Architecturewith Structured Representation AdaptationPreprint
Nasir, W. N. B. W. M., Rahman, S. S. B., Amadi, C. S., & Jun, T. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6946184
Framework Federado para Redes Neurais Quânticas sem Pesos Distribuídas
de Oliveira, N. M., & da Silva, A. J. (2026) · doi:10.5753/wqunets.2026.23840
Quantum-Enhanced Adversarial Robustness in Artificial Intelligence
Sen, J. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch009
Knowledge Distillation in the QAOA Setting for Advantage on Quantum Hardware
Piperno, S., Windridge, D., Vittori, G., Rosato, A., & Panella, M. (2026) · International Symposium on Circuits and Systems · doi:10.1109/iscas66217.2026.11562409
Optical coprocessor based on spontaneous Brillouin scattering
Vovchenko, I. V., Zyablovsky, A. A., Pukhov, A. A., & Andrianov, E. S. (2026) · Physical Review A · doi:10.1103/7zrl-mdsb
Hybrid Multi-Strategy Quantum Embedding With Trainable Parameters for Multi-Class Classification
Borgalli, R. A., Shetty, S., & Raj, U. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch003
Quantum Bayesian Time Series Forecasting with Uncertainty Quantification
Oloyede, I. (2026) · Reliability: Theory & Applications · doi:10.66721/3s6jbr20 · Cited by 1
Daka, C., & Bhattacharyya, S. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae8053 · Cited by 1
Evaluation of Variational Quantum Classifiers (VQC) for Cyberattack Detection in the NISQ Era
Thomos, A., & Andronikos, T. (2026) · Journal of Sensor and Actuator Networks · doi:10.3390/jsan15040067
Transforming Artificial Intelligence Through Quantum Computing
Gupta, S., Maheshwari, A., & Naruka, A. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-2601-4.ch006
Shylaja, S. S., Revathi, T., Kumar, S. H., & Blessing, N. R. W. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-27692-7.00015-0
Auto Quantum Machine Learning for Multisource Classification
Rybotycki, T., Dziura, S., & Gawron, P. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-29918-5_2
InLoq: A hybrid quantum neural network for indoor localization using magnetic field signals
Rafique, H., Russo, E., Delfa, G. C. L., Palesi, M., & Torres-Sospedra, J. (2026) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2026.111323
Senthilkumar, P., Virupakshi, H., Kiruthika, S. U., & Athanesious, J. J. (2026) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2026.1808611
Rana, A. (2026) · Research Square · doi:10.21203/rs.3.rs-10147055/v1
Quantum-classical adaptive autoencoding of time-series signals for secure biometric authentication
Dutta, S., Basu, B., Roy, S., & Roy, U. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00417-1
Hybrid Quantum Machine Learning Approach for Heart Disease Prediction
Kaur, H., Kaur, S., Kaur, M., & Shelke, N. M. (2026) · International Conference on Connected Intelligence for Industrial Applications (CI2A) · doi:10.1109/ci2a69097.2026.11576818
Satellite Constellation Scheduling with Quantum Reinforcement Learning
Kim, G. S., Chen, S. Y.-C., Park, S., & Kim, J. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-7829-0_6
Quantum fourier transform for unsupervised fault detection in building end-use electricity loads
Zia, H., Malkawi, A. M., & Han, J. M. (2026) · Energy and Buildings · doi:10.1016/j.enbuild.2026.117900
Quantum gravitational field network for spatial distribution and flow prediction of high end talent
Pu, J., Shi, H., & Zhou, Z. (2026) · Discover Applied Sciences · doi:10.1007/s42452-026-09141-8
Mondal, M., Chanda, S., Alawieh, M. M., Sukhadiya, B., Krah, D., Gonsalves, C., Ntolkeras, A., Rizzoli, S. O., & Shaib, A. (2026) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2026.115548
DVQA-FL: A Communication-Efficient Quantum Federated Learning Framework for Power System
Peng, L., & Meikang Qiu, A. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-2852-2_21
Predicting Simulated Quantum Resource-Proxy Gaps from Data and Circuit StructurePreprint
Salehi, A., Heydarian, A., Milani, D., & Kheirandish, P. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7624324
An adaptive quantum-classical approach for scalable clustering and analytical decision-making
Hidayat, R., Novkaniza, F., Rustam, Z., & Akdemir, :. O. (2026) · Decision Analytics Journal · doi:10.1016/j.dajour.2026.100734
Measurement-based acceleration of optical computations
Vovchenko, I. V., Zyablovsky, A. A., Pukhov, A. A., & Andrianov, E. S. (2026) · Physical Review A · doi:10.1103/9kn6-hv44
Qyn: FPGA-Based Quantum Error Correction with Integrated Quantum Machine Learning
AlSaneh, C., Mattar, C., & Oueida, S. (2026) · International Conference on Bio-engineering for Smart Technologies (BioSMART) · doi:10.1109/biosmart71257.2026.11598218
Quantum computing for computer vision: A comprehensive literature survey
Hafiz, A. M., & Hassaballah, M. (2026) · Image and Vision Computing · doi:10.1016/j.imavis.2026.106120
Kautish, A., Sivakumar, A., & Prasad, V. K. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0336022
Quantum Neural Networks in the NISQ Era: Architectures, Challenges, and Applications
Palihakkara, K. W., & Jayakody, M. N. (2026) · Proceedings in Technology Transfer · doi:10.1007/978-981-92-0423-6_19
Shang, L., Cao, H., Wu, Y. J., Niu, X., & Chen, J. Y. (2026) · Entropy · doi:10.3390/e28070829
Quantum Neural Networks Face the Hardware Test
Röseler, P. (2026) · Physics · doi:10.1103/physics.19.100
Metadata
- Authors
- Abbas, A., Sutter, D., Zoufal, C., Lucchi, A., Figalli, A., & Woerner, S.
- Affiliations
- IBM Research - Zurich (CH)
- ETH Zurich (CH)
- Corresponding author
- Woerner, Stefan
- Venue
- Nature Computational Science
- Published
- 2021-06-24
- Volume
- 1
- Issue
- 6
- Pages
- 403-409
- ISSN
- 2662-8457 (ISSN-L)
- OpenAlex
- W3097610849
- Cited by
- 1,082
- References
- 39
- Citations by year
- 2026: 266 · 2025: 266 · 2024: 216 · 2023: 178 · 2022: 87 · 2021: 69
- FWCI
- 48.59
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Nature Computational Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- International Business Machines Corporation
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum neural networks, quantum machine learning, effective dimension, Fisher information, generalization, model capacity, training speed, quantum advantage, feedforward neural networks, quantum computing hardware
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.
A language model drew the claims from the paper on 2026-10-07, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-07 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
