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
Qiskit: An Open-source Framework for Quantum Computing
Aleksandrowicz, G., Alexander, T., Barkoutsos, P. K., Bello, L., Ben-Haim, Y., Bucher, D., Cabrera-Hernández, F. J., Carballo-Franquis, J., Chen, A., Chen, C.-F., et al. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2562110 · Cited by 1,454
Self-citationLeCun, Y., Bottou, L., Orr, G., & Müller, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35289-8_3 · Cited by 1,268
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
Dunjko, V., & Briegel, H. J. (2018) · Reports on Progress in Physics · doi:10.1088/1361-6633/aab406 · Cited by 1,241
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A · doi:10.1103/physreva.101.032308 · Cited by 1,057
Cost function dependent barren plateaus in shallow parametrized quantum circuits
Cerezo, M., Sone, A., Volkoff, T., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-21728-w · Cited by 1,047
Sim, S., Johnson, P. D., & Aspuru‐Guzik, A. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900070 · Cited by 972
Power of data in quantum machine learning
Huang, H.-Y., Broughton, M., Mohseni, M., Babbush, R., Boixo, S., Neven, H., & McClean, J. R. (2021) · Nature Communications · doi:10.1038/s41467-021-22539-9 · Cited by 896
Fisher information and stochastic complexity
Rissanen, J. J. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481776 · Cited by 814
Noise-induced barren plateaus in variational quantum algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-27045-6 · Cited by 773
Effect of data encoding on the expressive power of variational quantum-machine-learning models
Schuld, M., Sweke, R., & Meyer, J. J. (2021) · Physical Review A · doi:10.1103/physreva.103.032430 · Cited by 739
Supervised Learning with Quantum Computers
Schuld, M., & Petruccione, F. (2018) · Quantum Science and Technology · doi:10.1007/978-3-319-96424-9 · Cited by 730
The quest for a Quantum Neural Network
Schuld, M., Sinayskiy, I., & Petruccione, F. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0809-8 · Cited by 671
Dziugaite, G. K., & Roy, D. M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.11008 · Cited by 599
Science from Fisher Information
Frieden, B. R. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511616907 · Cited by 586
Connecting Ansatz Expressibility to Gradient Magnitudes and Barren Plateaus
Holmes, Z., Sharma, K., Cerezo, M., & Coles, P. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010313 · Cited by 570
Aaronson, S. (2015) · Nature Physics · doi:10.1038/nphys3272 · Cited by 567
Quantum autoencoders for efficient compression of quantum data
Romero, J., Olson, J. P., & Aspuru-Guzik, A. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa8072 · Cited by 559
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Quantum Generative Adversarial Networks for learning and loading random distributions
Zoufal, C., Lucchi, A., & Woerner, S. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0223-2 · Cited by 480
Self-citationStronger generalization bounds for deep nets via a compression approachPreprint
Arora, S., Ge, R., Neyshabur, B., & Zhang, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.05296 · Cited by 432
Continuous-variable quantum neural networks
Killoran, N., Bromley, T. R., Arrazola, J. M., Schuld, M., Quesada, N., & Lloyd, S. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033063 · Cited by 418
Measuring the VC-Dimension of a Learning Machine
Vapnik, V., Levin, E., & Cun, Y. L. (1994) · Neural Computation · doi:10.1162/neco.1994.6.5.851 · Cited by 388
Layerwise learning for quantum neural networks
Skolik, A., McClean, J. R., Mohseni, M., van der Smagt, P., & Leib, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00036-4 · Cited by 324
Expressive power of parametrized quantum circuits
Du, Y., Hsieh, M.-H., Liu, T., & Tao, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033125 · Cited by 318
Finite-Dimensional Vector Spaces
Halmos, P. R. (1974) · Undergraduate texts in mathematics · doi:10.1007/978-1-4612-6387-6 · Cited by 287
Soundness and completeness of quantum root-mean-square errors
Ozawa, M. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0113-z · Cited by 265
Learning to learn with quantum neural networks via classical neural networksPreprint
Verdon, G., Broughton, M., McClean, J. R., Sung, K. J., Babbush, R., Zhang, J., Neven, H., & Mohseni, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.05415 · Cited by 250
Stochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Wilde, F., Meyer, J., Schuld, M., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Quantum · doi:10.22331/q-2020-08-31-314 · Cited by 219
Stochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Sweke, R., Meyer, J. J., Meyer, J. J., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-28427 · Cited by 203
Quantum embeddings for machine learning
Lloyd, S., Schuld, M., Ijaz, A., Izaac, J., & Killoran, N. (2020) · arXiv · doi:10.48550/arxiv.2001.03622 · Cited by 198
Exact Calculation of the Hessian Matrix for the Multilayer Perceptron
Bishop, C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.4.494 · Cited by 146
Large gradients via correlation in random parameterized quantum circuits
Volkoff, T., & Coles, P. J. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd891 · Cited by 143
Expressibility of the alternating layered ansatz for quantum computation
Nakaji, K., & Yamamoto, N. (2021) · Quantum · doi:10.22331/q-2021-04-19-434 · Cited by 119
Higher order derivatives of quantum neural networks with barren plateaus
Cerezo, M., & Coles, P. J. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abf51a · Cited by 118
The capacity of feedforward neural networks
Baldi, P., & Vershynin, R. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.04.009 · Cited by 83
Characterizing the loss landscape of variational quantum circuits
Huembeli, P., & Dauphin, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdbc9 · Cited by 71
Introduction: Four Periods in the Research of the Learning Problem
Vapnik, V. N. (2000) · Springer eBooks · doi:10.1007/978-1-4757-3264-1_1 · Cited by 60
The Capacity of Quantum Neural Networks
Wright, L. G., & McMahon, P. L. (2020) · Conference on Lasers and Electro-Optics · doi:10.1364/cleo_at.2020.jm4g.5 · Cited by 35
Approximate Fisher Information Matrix to Characterize the Training of Deep Neural Networks
Liao, Z., Drummond, T. W., Reid, I. D., & Carneiro, G. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2876413 · Cited by 33
Information-Theoretic Local Minima Characterization and RegularizationPreprint
Jia, Z., & Su, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.08192 · Cited by 13
A scale-dependent notion of effective dimensionPreprint
Berezniuk, O., Figalli, A., Ghigliazza, R. M., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.10872 · Cited by 7
Self-citationamyami187/effective_dimension: First release of the effective dimension code
Abbas, A. (2021) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.4732830 · Cited by 1
Self-citationamyami187/effective_dimension:
Abbas, A. (2021) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.4732829 · Cited by 1
Self-citation
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
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
“For instance, it has been shown that quantum neural networks can achieve a significantly better effective dimension than comparable classical neural networks [258].”
BackgroundNoisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Noise-induced barren plateaus in variational quantum algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-27045-6 · Cited by 773
Challenges and opportunities in quantum machine learning
Cerezo, M., Verdon, G., Huang, H.-Y., Cincio, Ł., & Coles, P. J. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00311-3 · Cited by 862
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
