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 201–300 of 1,000
Short-term photovoltaic power forecasting based on hybrid quantum gated recurrent unit
Jeong, S.-G., Vinh, Q., & Hwang, W. (2023) · ICT Express · doi:10.1016/j.icte.2023.12.005 · Cited by 23
Quantum transfer learning for acceptability judgements
Buonaiuto, G., Guarasci, R., Minutolo, A., Pietro, G. D., & Esposito, M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00141-8 · Cited by 23
Learning to Program Variational Quantum Circuits with Fast Weights
Chen, S. Y.-C. (2024) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn60899.2024.10650743 · Cited by 28
Entangled Datasets for Quantum Machine LearningPreprint
Schatzki, L., Arrasmith, A., Coles, P. J., & Cerezo, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.03400 · Cited by 72
Scalable Variational Quantum Circuits for Autoencoder-based Drug Discovery
Li, J., & Ghosh, S. (2022) · Design, Automation, and Test in Europe · doi:10.23919/date54114.2022.9774564 · Cited by 23
Demonstrating Quantum Advantage in Hybrid Quantum Neural Networks for Model Capacity
Kashif, M., & Al-Kuwari, S. M. (2022) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc57508.2022.00011 · Cited by 22
The Quantum Path Kernel: A Generalized Neural Tangent Kernel for Deep Quantum Machine Learning
Incudini, M., Grossi, M., Mandarino, A., Vallecorsa, S., Pierro, A. D., & Windridge, D. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3287736 · Cited by 25
Resource saving via ensemble techniques for quantum neural networks
Incudini, M., Grossi, M., Ceschini, A., Mandarino, A., Panella, M., Vallecorsa, S., & Windridge, D. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00126-z · Cited by 22
Quantum Generative Adversarial Networks For Anomaly Detection In High Energy Physics
Bermot, E., Zoufal, C., Grossi, M., Schuhmacher, J., Tacchino, F., Vallecorsa, S., & Tavernelli, I. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00045 · Cited by 29
Self-citationPooling Techniques in Hybrid Quantum-Classical Convolutional Neural Networks
Monnet, M., Gebran, H., Matic-Flierl, A., Kiwit, F. J., Schachtner, B. M., Bentellis, A., & Lorenz, J. M. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00074 · Cited by 24
Quantum Mathematics in Artificial Intelligence
Widdows, D., Kitto, K., & Cohen, T. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12702 · Cited by 28
Hybrid Quantum-Classical Graph Convolutional NetworkPreprint
Chen, S. Y.-C., Wei, T.-C., Zhang, C., Yu, H., & Yoo, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.06189 · Cited by 53
Dequantizing quantum machine learning models using tensor networks
Shin, S., Teo, Y. S., & Jeong, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023218 · Cited by 35
Quantum neural networks form Gaussian processes
García-Martín, D., Larocca, M., & Cerezo, M. (2025) · Nature Physics · doi:10.1038/s41567-025-02883-z · Cited by 42
A comparative analysis and noise robustness evaluation in quantum neural networks
Ahmed, T., Kashif, M., Marchisio, A., & Shafique, M. (2025) · Scientific Reports · doi:10.1038/s41598-025-17769-6 · Cited by 31
Numerical evidence against advantage with quantum fidelity kernels on classical data
Slattery, L., Shaydulin, R., Chakrabarti, S., Pistoia, M., Khairy, S., & Wild, S. M. (2023) · Physical Review A · doi:10.1103/physreva.107.062417 · Cited by 22
Rapid training of quantum recurrent neural networks
Siemaszko, M., Buraczewski, A., Saux, B. L., & Stobińska, M. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00117-0 · Cited by 26
Pulse-efficient quantum machine learning
Melo, A., Earnest, N., & Tacchino, F. (2023) · Quantum · doi:10.22331/q-2023-10-09-1130 · Cited by 28
Quantum-Inspired Neural Network Model of Optical Illusions
Maksymov, I. S. (2024) · Algorithms · doi:10.3390/a17010030 · Cited by 21
Synergy between AI and Optical Metasurfaces: A Critical Overview of Recent Advances
Jakšić, Z. (2024) · Photonics · doi:10.3390/photonics11050442 · Cited by 21
Yu, J. Y., Sim, W. S., Jung, J. Y., Park, S.-H., Kim, H. S., & Park, Y. R. (2024) · Applied Soft Computing · doi:10.1016/j.asoc.2024.111781 · Cited by 22
QNN-VRCS: A Quantum Neural Network for Vehicle Road Cooperation Systems
Innan, N., Behera, B. K., Al-Kuwari, S. M., & Farouk, A. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3538786 · Cited by 21
Quantum algorithms for scientific computing
Au-Yeung, R., Camino, B., Rathore, O., & Kendon, V. M. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad85f0 · Cited by 37
Security Aspects of Quantum Machine Learning: Opportunities, Threats and Defenses
Kundu, S., & Ghosh, S. (2022) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3526241.3530833 · Cited by 21
A Granular Computing-Driven Best–Worst Method for Supporting Group Decision Making
Qin, J., Ma, X., & Witold Pedrycz, C. (2023) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2023.3273237 · Cited by 20
Elivagar: Efficient Quantum Circuit Search for Classification
Anagolum, S., Alavisamani, N., Das, P., Qureshi, M. K., & Shi, Y. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3620665.3640354 · Cited by 28
Transition role of entangled data in quantum machine learning
Wang, X., Du, Y., Tu, Z., Luo, Y., Yuan, X., & Tao, D. (2024) · Nature Communications · doi:10.1038/s41467-024-47983-1 · Cited by 30
Predominant Aspects on Security for Quantum Machine Learning: Literature Review
Franco, N., Sakhnenko, A., Stolpmann, L., Thuerck, D., Petsch, F., Rüll, A., & Lorenz, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00173 · Cited by 29
Natural parametrized quantum circuit
Haug, T., & Kim, M. S. (2022) · Physical Review A · doi:10.1103/physreva.106.052611 · Cited by 23
Scalable parameterized quantum circuits classifier
Ding, X., Song, Z., Xu, J., Hou, Y., Yang, T., & Shan, Z. (2024) · Scientific Reports · doi:10.1038/s41598-024-66394-2 · Cited by 24
Rosyid, M. R., Mawaddah, L., Santosa, A. P., Akrom, M., Rustad, S., & Dipojono, H. K. (2024) · Materials Today Communications · doi:10.1016/j.mtcomm.2024.109830 · Cited by 19
Computational Advantage in Hybrid Quantum Neural Networks: Myth or Reality?
Kashif, M., Marchisio, A., & Shafique, M. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11132906 · Cited by 21
Analytical evidence of nonlinearity in qubits and continuous-variable quantum reservoir computing
Mujal, P., Nokkala, J., Martínez‐Peña, R., Giorgi, G. L., Soriano, M. C., & Zambrini, R. (2021) · Journal of Physics Complexity · doi:10.1088/2632-072x/ac340e · Cited by 24
Evaluation of Parameterized Quantum Circuits With Cross-Resonance Pulse-Driven Entanglers
Ibrahim, M. M. A., Mohammadbagherpoor, H., Rios, C., Bronn, N. T., & Byrd, G. T. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3231124 · Cited by 27
Marcantonio, F. D., Incudini, M., Tezza, D., & Grossi, M. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00107-2 · Cited by 26
A General Approach to Dropout in Quantum Neural Networks
Scala, F., Ceschini, A., Panella, M., & Gerace, D. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300220 · Cited by 19
A light-weight quantum self-attention model for classical data classification
Zhang, H., Zhao, Q., & Chen, C. (2024) · Applied Intelligence · doi:10.1007/s10489-024-05337-w · Cited by 19
Quantum Quantile Mechanics: Solving Stochastic Differential Equations for Generating Time‐Series
Paine, A. E., Elfving, V. E., & Kyriienko, O. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300065 · Cited by 28
Unbounded and lossless compression of multiparameter quantum information
Jenne, J. H., & Arvidsson-Shukur, D. R. M. (2022) · Physical Review A · doi:10.1103/physreva.106.042404 · Cited by 20
Kashif, M., & Al-Kuwari, S. M. (2023) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760.2023.2231163 · Cited by 22
Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning
Park, S., & Simeone, O. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3333224 · Cited by 27
Buonaiuto, G., Gargiulo, F., Pietro, G. D., Esposito, M., & Pota, M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00144-5 · Cited by 24
A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity
L'Abbate, R., D’Onofrio, A., Stein, S., Chen, S. Y.-C., Li, A., Chen, P., Chen, J., & Mao, Y. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3367234 · Cited by 18
Narottama, B., & Aı̈ssa, S. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3396437 · Cited by 18
Neural quantum embedding: Pushing the limits of quantum supervised learning
Hur, T., Araujo, I. F., & Park, D. K. (2024) · Physical Review A · doi:10.1103/physreva.110.022411 · Cited by 29
Federated Quantum Machine Learning
Chen, S. Y.-C., & Yoo, S. (2021) · Entropy · doi:10.3390/e23040460 · Cited by 48
A Hybrid Quantum-Classical Generative Adversarial Network for Near-Term Quantum Processors
Boyle, A. O., & Nikandish, G. (2024) · IEEE Access · doi:10.1109/access.2024.3433383 · Cited by 19
Quantum latent diffusion models
Falco, F. D., Ceschini, A., Sebastianelli, A., Saux, B. L., & Panella, M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00224-6 · Cited by 19
Hassan, S. S., Khan, L. U., Park, Y. M., Guizani, M., Han, Z., Ratnarajah, T., & Hong, C. S. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3610357 · Cited by 22
Machine Learning Load Balancing Techniques in Cloud Computing: A Review
Muchori, J. G., & Mwangi, P. M. (2022) · International Journal of Computer Applications Technology and Research · doi:10.7753/ijcatr1106.1002 · Cited by 17
Special Session: On the Reliability of Conventional and Quantum Neural Network Hardware
Sadi, M., He, Y., Li, Y., Alam, M., Kundu, S., Ghosh, S., Bahrami, J., & Karimi, N. (2022) · IEEE VLSI Test Symposium (VTS) · doi:10.1109/vts52500.2021.9794194 · Cited by 17
An exponentially-growing family of universal quantum circuits
Kordzanganeh, M., Sekatski, P., Fedichkin, L. E., & Melnikov, A. A. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ace757 · Cited by 17
The Potential of Quantum Techniques for Stock Price Prediction
Srivastava, N., Belekar, G., Shahakar, N., & Aswath Babu, H. (2023) · IEEE International Conference on Recent Advances in Systems Science and Engineering (RASSE) · doi:10.1109/rasse60029.2023.10363533 · Cited by 21
Quantum-parallel vectorized data encodings and computations on trapped-ion and transmon QPUs
Balewski, J. T., Amankwah, M. G., Beeumen, R. V., Bethel, E. W., Perciano, T., & Camps, D. (2024) · Scientific Reports · doi:10.1038/s41598-024-53720-x · Cited by 18
Shedding Light on the Future: Exploring Quantum Neural Networks through Optics
Yu, S., Jia, Z., Zhang, A., Mer, E., Li, Z., Crescimanna, V., Chen, K., Patel, R. B., Walmsley, I. A., & Kaszlikowski, D. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400074 · Cited by 18
What can we Learn from Quantum Convolutional Neural Networks?
Umeano, C., Paine, A. E., Elfving, V. E., & Kyriienko, O. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400325 · Cited by 27
Nav-Q: quantum deep reinforcement learning for collision-free navigation of self-driving cars
Sinha, A., Macaluso, A., & Klusch, M. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00226-4 · Cited by 23
Assessing the potential of quantum computing in agriculture
Pook, T., Vandenplas, J., Boschero, J. C., Aguilera, E., Leijnse, K., Chauhan, A., Bouzembrak, Y., Knapen, R., & Aldridge, M. N. (2025) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2025.110332 · Cited by 18
Seeking quantum advantage for neural networks
Coles, P. J. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00088-x · Cited by 16
Hossain, M. M., Ali, M. S., Swarna, R. A., Hasan, M. M., Habib, N., Rahman, W., Azad, M. M., & Rahman, M. M. (2021) · International Conference on Computer and Information Technology (ICCIT) · doi:10.1109/iccit54785.2021.9689853 · Cited by 17
Incremental Data-Uploading for Full-Quantum Classification
Periyasamy, M., Meyer, N., Ufrecht, C., Scherer, D. D., Plinge, A., & Mutschler, C. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00021 · Cited by 16
Conditional Born machine for Monte Carlo event generation
Kiss, O., Grossi, M., Kajomovitz, E., & Vallecorsa, S. (2022) · Physical Review A · doi:10.1103/physreva.106.022612 · Cited by 25
Designing universal causal deep learning models: The geometric (Hyper)transformer
Acciaio, B., Kratsios, A., & Pammer, G. (2023) · Mathematical Finance · doi:10.1111/mafi.12389 · Cited by 24
Evolutionary-based searching method for quantum circuit architecture
Zhang, A., & Zhao, S. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04033-x · Cited by 23
On Quantum Hyperparameters Selection in Hybrid Classifiers for Earth Observation Data
Sebastianelli, A., Rosso, M. P. D., Ullo, S. L., & Gamba, P. E. (2023) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2023.3308105 · Cited by 21
Moreira, M. S., Guerreschi, G. G., Vlothuizen, W., Marques, J., van Straten, J., Premaratne, S., Zou, X., Ali, H. A., Muthusubramanian, N., Zachariadis, C., et al. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00779-5 · Cited by 16
Quantum Kernel Alignment with Stochastic Gradient Descent
Gentinetta, G., Sutter, D., Zoufal, C., Fuller, B., & Woerner, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00036 · Cited by 21
Self-citationRandomness-Enhanced Expressivity of Quantum Neural Networks
Wu, Y., Yao, J., Zhang, P., & Li, X. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.010602 · Cited by 20
Complexity of life sciences in quantum and AI era
Pyrkov, A. N., Aliper, A., Bezrukov, D. S., Podolskiy, D. I., Ren, F., & Zhavoronkov, A. A. (2024) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.1701 · Cited by 18
Quantum Hybrid Diffusion Models for Image Synthesis
Falco, F. D., Ceschini, A., Sebastianelli, A., Saux, B. L., & Panella, M. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00858-5 · Cited by 16
Enhancing the expressivity of quantum neural networks with residual connections
Wen, J., Huang, Z., Cai, D., & Qian, L. (2024) · Communications Physics · doi:10.1038/s42005-024-01719-1 · Cited by 24
Akrom, M., Rustad, S., Dipojono, H. K., & Maezono, R. (2024) · Artificial Intelligence Chemistry · doi:10.1016/j.aichem.2024.100073 · Cited by 16
SoK: quantum computing methods for machine learning optimization
Baniata, H. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00180-1 · Cited by 16
Potential of quantum scientific machine learning applied to weather modeling
Jaderberg, B., Gentile, A. A., Ghosh, A., Elfving, V. E., Jones, C. R., Vodola, D., Manobianco, J., & Weiß, H. (2024) · Physical Review A · doi:10.1103/physreva.110.052423 · Cited by 22
Li, S., Cui, J., & Ren, J. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.129111 · Cited by 16
Embedding Learning in Hybrid Quantum-Classical Neural Networks
Liu, M., Liu, J., Liu, R., Makhanov, H., Lykov, D., Apte, A., & Alexeev, Y. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00026 · Cited by 18
To Design Scalable Free Energy Perturbation Networks, Optimal Is Not Enough
Pitman, M., Hahn, D. F., Tresadern, G., & Mobley, D. L. (2023) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.2c01579 · Cited by 17
Understanding Machine Learning
Abaimov, S., & Martellini, M. (2022) · Advanced sciences and technologies for security applications · doi:10.1007/978-3-030-91585-8_2 · Cited by 17
Quantum Variational Multi-class Classifier for the Iris Data Set
Piatrenka, I., & Rusek, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-08760-8_21 · Cited by 15
Mitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols
Broers, L., & Mathey, L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013076 · Cited by 17
Statistical Complexity of Quantum Learning
Banchi, L., Pereira, J. L., Jose, S. T., & Simeone, O. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300311 · Cited by 16
A hyperparameter study for quantum kernel methods
Egginger, S., Sakhnenko, A., & Lorenz, J. M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00172-1 · Cited by 17
Federated Quantum-Train Long Short-Term Memory for Gravitational Wave Signal
Liu, C.-Y., Chen, S. Y.-C., Chen, K.-C., Huang, W.-J., & Chang, Y.-J. (2025) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infocomwkshps65812.2025.11152904 · Cited by 18
A Quantum Kernel Learning Approach to Acoustic Modeling for Spoken Command Recognition
Yang, C.-H. H., Li, B., Zhang, Y., Chen, N., Sainath, T. N., Siniscalchi, S. M., & Lee, C. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10095142 · Cited by 18
Quantum artificial intelligence: A survey
Acampora, G., Chiatto, A., Schiattarella, R., & Vitiello, A. (2025) · Computer Science Review · doi:10.1016/j.cosrev.2025.100807 · Cited by 22
Quantum Uncertainty Principles for Measurements with Interventions
Xiao, Y., Yang, Y., Wang, X., Liu, Q., & Gu, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.240201 · Cited by 17
Tensor-network-assisted variational quantum algorithm
Huang, J., He, W., Zhang, Y., Wu, Y., Wu, B., & Yuan, X. (2023) · Physical Review A · doi:10.1103/physreva.108.052407 · Cited by 19
A multi-task network approach for calculating discrimination-free insurance prices
Lindholm, M., Richman, R., Tsanakas, A., & Wüthrich, M. V. (2023) · European Actuarial Journal · doi:10.1007/s13385-023-00367-z · Cited by 15
Practical application of quantum neural network to materials informatics
Hirai, H. (2024) · Scientific Reports · doi:10.1038/s41598-024-59276-0 · Cited by 18
Quantum machine learning for corrosion resistance in stainless steel
Akrom, M., Rustad, S., Sutojo, T., Setiadi, D. R. I. M., Dipojono, H. K., Maezono, R., & Solomon, M. M. (2024) · Materials Today Quantum · doi:10.1016/j.mtquan.2024.100013 · Cited by 20
Muser, T., Zapusek, E., Belis, V., & Reiter, F. (2024) · Physical Review A · doi:10.1103/physreva.110.032434 · Cited by 18
An Introduction to Quantum Reinforcement Learning (QRL)
Chen, S. Y.-C. (2024) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc62082.2024.10827651 · Cited by 27
Optimizing quantum convolutional neural network architectures for arbitrary data dimension
Lee, C. W., Araujo, I. F., Kim, D.-H., Lee, J.-H., Park, S., Ryu, J.-Y., & Park, D. K. (2025) · Frontiers in Physics · doi:10.3389/fphy.2025.1529188 · Cited by 21
Forecasting steam mass flow in power plants using the parallel hybrid network
Kurkin, A., Hegemann, J., Kordzanganeh, M., & Melnikov, A. A. (2025) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2025.111912 · Cited by 14
Quantum DeepONet: Neural operators accelerated by quantum computing
Xiao, P., Zheng, M., Jiao, A., Xiu, Y., & Lu, L. (2025) · Quantum · doi:10.22331/q-2025-06-04-1761 · Cited by 14
Quantum-Enhanced Machine Learning
Satuluri, V. K. R. R., & Ponnusamy, V. (2021) · International Conference on Smart Technologies, Communication and Robotics (STCR) · doi:10.1109/stcr51658.2021.9589016 · Cited by 17
Quantum Neural Networks for Optimal Resource Allocation in Cell-Free MIMO Systems
Narottama, B., & Duong, T. Q. (2022) · Globecom · doi:10.1109/globecom48099.2022.10001726 · Cited by 13
Optimizing Quantum Classification Algorithms on Classical Benchmark Datasets
John, M., Schuhmacher, J., Barkoutsos, P. K., Tavernelli, I., & Tacchino, F. (2023) · Entropy · doi:10.3390/e25060860 · Cited by 15
Hybrid quantum learning with data reuploading on a small-scale superconducting quantum simulator
Tolstobrov, A., Fedorov, G., Sanduleanu, S. V., Kadyrmetov, S., Vasenin, A. V., Bolgar, A. N., Kalacheva, D. A., Lubsanov, V. B., Dorogov, A., Zotova, J., et al. (2024) · Physical Review A · doi:10.1103/physreva.109.012411 · Cited by 16
Quantum Computing and Machine Learning on an Integrated Photonics Platform
Zhu, H., Lin, H., Wu, S., Luo, W., Zhang, H., Zhan, Y., Wang, X., Liu, A. Q., & Kwek, L. C. (2024) · Information · doi:10.3390/info15020095 · Cited by 13
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
