pith. sign in

arxiv: 2607.01329 · v1 · pith:P5ULCNZ6new · submitted 2026-07-01 · 🪐 quant-ph · cs.LG

Ravines in quantum cost landscapes: opportunities for improved VQA predictions

Felix J. Beckmann , Jo\~ao F. Bravo This is my paper

Pith reviewed 2026-07-03 20:25 UTC · model grok-4.3

classification 🪐 quant-ph cs.LG
keywords quantum cost landscapesravinesnudged elastic bandvariational quantum algorithmsquantum neural networksensemble methodslocal prediction variabilityconcentratable entanglement
0
0 comments X

The pith

Averaging quantum neural network predictions along low-cost ravines in cost landscapes improves ensemble accuracy and cuts computation.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that quantum cost landscapes contain ravine structures, which are low-cost paths linking separate local minima. An adapted nudged elastic band algorithm locates these paths in hardware-efficient ansatzes trained to classify concentratable entanglement. Ensembles formed by averaging predictions from models placed along the paths outperform both classical ensembles and standard quantum ensembles when the starting models exhibit high local-prediction variability. The same approach also lowers overall computational cost relative to training many independent quantum models and maintains its advantage as circuit depth and qubit number increase.

Core claim

Adapting the nudged elastic band algorithm to quantum cost landscapes reveals ravines as persistent low-cost paths between local minima. Training quantum neural networks along these paths and averaging their predictions produces ensembles that, for initializations with high local-prediction variability, exceed the accuracy of classical and naive quantum ensembles while requiring substantially less computation than full naive ensembling. The ravines remain present under both depth and qubit scaling, and the nudged-elastic-band route accelerates convergence compared with the naive alternative.

What carries the argument

The adapted nudged elastic band algorithm that traces low-cost paths through quantum cost landscapes for subsequent ensemble averaging.

If this is right

  • When base classifiers are drawn from high local-prediction-variability initializations, the NEB ensembles outperform both classical and naive quantum alternatives.
  • Leveraging the ravine structure reduces computational cost relative to naive QNN ensembling.
  • Ravines persist across increases in circuit depth and qubit number.
  • The NEB approach accelerates convergence over the naive alternative even as resource demands grow with qubit count.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The local-prediction-variability metric introduced for pre-training could be tested as a general selector for when any ensemble method is likely to help in variational quantum tasks.
  • If ravines prove to be topological features of many ansatzes, ansatz designers might deliberately engineer landscapes with more connecting paths.
  • The same path-averaging idea could be tried on other VQA objectives such as optimization or simulation to check whether the cost reduction generalizes.

Load-bearing premise

The low-cost paths located by the algorithm are genuine ravines whose averaging improves predictions rather than numerical artifacts or effects of the specific ansatzes and tasks.

What would settle it

A side-by-side test in which averaging along randomly chosen paths between the same minima produces no accuracy gain over single-model or naive-ensemble baselines on the entanglement-classification task.

read the original abstract

The geometric and topological structure of quantum cost landscapes (QCLs) governs the optimization and thus the predictive power of variational quantum algorithms (VQAs). We systematically analyze ravines - low-cost paths connecting local minima - using an adapted version of the nudged elastic band (NEB) algorithm, a method originating from theoretical chemistry. By training quantum neural networks (QNNs) to classify the concentratable entanglement of quantum states, we apply the NEB algorithm and numerically identify ravine structures in QCLs of hardware-efficient ansatzes. Beyond visualizing these ravines, we construct an ensemble prediction framework by averaging predictions from QNNs parameterized along the low-cost NEB path. We introduce a resource-light pre-training metric which quantifies local-prediction variability and serves as a strong performance indicator for VQAs, even beyond the scope of this study. When base classifiers are drawn from circuit and weight initializations exhibiting high local-prediction variability, the quantum-based NEB ensembles outperform both classical and naive quantum alternatives. Moreover, a complexity analysis shows that leveraging the ravine-like structure of QCLs with the QNN NEB approach substantially reduces computational costs compared to naive QNN ensembling. A depth and qubit scaling analysis indicates that ravines persist across both scalings, and that, despite the expected growth in resource requirements with the qubit scaling, the NEB approach also accelerates convergence over the naive alternative.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper adapts the nudged elastic band (NEB) algorithm from chemistry to locate ravine-like low-cost paths connecting minima in quantum cost landscapes (QCLs) of variational quantum algorithms. Using hardware-efficient ansatzes for QNN-based classification of concentratable entanglement, the authors numerically identify such structures, construct ensembles by averaging predictions along NEB-parameterized paths, and introduce a local-prediction variability metric as a pre-training indicator. They claim that high-variability initializations yield NEB ensembles that outperform classical and naive quantum baselines, with reduced computational cost relative to naive ensembling, and that ravines persist under depth and qubit scaling.

Significance. If the located NEB paths represent genuine landscape ravines whose averaging improves generalization (rather than optimization artifacts), the work supplies a geometrically motivated route to better VQA performance and efficiency. The variability metric is presented as potentially useful beyond this study, and the scaling analysis provides a falsifiable prediction about ravine persistence. These elements could influence optimization strategies in quantum machine learning if the central numerical claims are placed on firmer statistical and diagnostic footing.

major comments (2)
  1. [§4] §4 (NEB application and ravine identification): No independent diagnostic (Hessian spectrum along the path, barrier-height statistics, or comparison against random walks of equal length) is supplied to distinguish genuine low-cost corridors from NEB spring-force artifacts or post-selection on high-variability initializations. This directly underpins both the ensemble improvement and complexity-reduction claims.
  2. [§5] §5 (performance and complexity results): The outperformance of NEB ensembles under the variability condition and the reported cost reduction versus naive QNN ensembling are stated without statistical tests, error bars, baseline implementation details, or controls for post-hoc selection, leaving the headline numerical claims weakly supported.
minor comments (2)
  1. [Abstract and §6] The abstract and scaling section refer to 'depth and qubit scaling analysis' without specifying the exact ranges, number of instances, or convergence criteria used.
  2. [§3] Notation for the variability metric and the precise definition of 'local-prediction variability' should be formalized in a dedicated equation or definition box for reproducibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive and detailed review. We address the two major comments point by point below, indicating where we will revise the manuscript to incorporate additional diagnostics and statistical support.

read point-by-point responses

  1. Referee: [§4] §4 (NEB application and ravine identification): No independent diagnostic (Hessian spectrum along the path, barrier-height statistics, or comparison against random walks of equal length) is supplied to distinguish genuine low-cost corridors from NEB spring-force artifacts or post-selection on high-variability initializations. This directly underpins both the ensemble improvement and complexity-reduction claims.

    Authors: We agree that additional independent diagnostics would strengthen the claim that the identified structures are genuine ravines rather than algorithmic artifacts. In the revised manuscript we will add (i) a direct comparison of NEB paths against random walks of equal length, demonstrating that the average cost along NEB paths is substantially lower, and (ii) barrier-height statistics extracted along the optimized paths. While a complete Hessian spectrum for every point on every path is computationally prohibitive at the system sizes studied, we will report the eigenvalue spectrum at representative points along the paths to confirm the existence of near-zero modes consistent with ravine geometry. We will also clarify that the local-prediction variability metric is computed on the untrained circuit before any NEB optimization or ensemble construction, thereby removing any post-selection concern. revision: yes

  2. Referee: [§5] §5 (performance and complexity results): The outperformance of NEB ensembles under the variability condition and the reported cost reduction versus naive QNN ensembling are stated without statistical tests, error bars, baseline implementation details, or controls for post-hoc selection, leaving the headline numerical claims weakly supported.

    Authors: We accept that the numerical claims require stronger statistical grounding. In the revision we will (i) report error bars obtained from multiple independent random seeds, (ii) include the results of paired statistical tests (e.g., t-tests) comparing NEB ensembles against the classical and naive quantum baselines, and (iii) expand the methods section with complete baseline implementation details. To address post-hoc selection, we will present performance results for both high- and low-variability initialization regimes in the same figures, showing that the reported advantage appears only under the high-variability condition as predicted by the metric. These changes will place the headline claims on firmer empirical footing. revision: yes

Circularity Check

0 steps flagged

No circularity; derivation self-contained via independent numerical experiments

full rationale

The paper defines a pre-training variability metric independently of final ensemble predictions and reports performance via direct numerical comparisons on classification tasks. No equations, definitions, or self-citations reduce the claimed gains or complexity reductions to quantities fixed by construction from the same inputs. The NEB path averaging is presented as an empirical procedure whose validity rests on the observed outcomes rather than tautological redefinition.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the variability metric and ravine concept are introduced but not formalized with fitting details.

pith-pipeline@v0.9.1-grok · 5788 in / 1152 out tokens · 41221 ms · 2026-07-03T20:25:34.501353+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

131 extracted references · 95 canonical work pages · 7 internal anchors

  1. [1]

    Campbell, S. L. and Gear, C. W. The index of general nonlinear D A E S. Numer. M ath. 1995

    1995

  2. [2]

    Slifka, M. K. and Whitton, J. L. Clinical implications of dysregulated cytokine production. J. M ol. M ed. 2000. doi:10.1007/s001090000086

    work page doi:10.1007/s001090000086 2000

  3. [3]

    Quasimonotonicity, regularity and duality for nonlinear systems of partial differential equations

    Hamburger, C. Quasimonotonicity, regularity and duality for nonlinear systems of partial differential equations. Ann. Mat. Pura. Appl. 1995

    1995

  4. [4]

    Geddes, K. O. and Czapor, S. R. and Labahn, G. Algorithms for C omputer A lgebra. 1992

    1992

  5. [5]

    Software engineering---from auxiliary to key technologies

    Broy, M. Software engineering---from auxiliary to key technologies. Software Pioneers. 1992

    1992

  6. [6]

    Conductive P olymers. 1981

    1981

  7. [7]

    Smith, S. E. Neuromuscular blocking drugs in man. Neuromuscular junction. H andbook of experimental pharmacology. 1976

    1976

  8. [8]

    Chung, S. T. and Morris, R. L. Isolation and characterization of plasmid deoxyribonucleic acid from Streptomyces fradiae. 1978

    1978

  9. [9]

    and AghaKouchak, A

    Hao, Z. and AghaKouchak, A. and Nakhjiri, N. and Farahmand, A. Global integrated drought monitoring and prediction system (GIDMaPS) data sets. 2014

    2014

  10. [10]

    Babichev, S. A. and Ries, J. and Lvovsky, A. I. Quantum scissors: teleportation of single-mode optical states by means of a nonlocal single photon. 2002

    2002

  11. [11]

    Wormholes in Maximal Supergravity

    Beneke, M. and Buchalla, G. and Dunietz, I. Mixing induced CP asymmetries in inclusive B decays. Phys. L ett. 1997. arXiv:0707.3168

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  12. [12]

    deep SIP : deep learning of S upernova I a P arameters

    Stahl, B. deep SIP : deep learning of S upernova I a P arameters. 2020. ascl:2006.023

    2020

  13. [13]

    Abbott, T. M. C. and others. Dark Energy Survey Year 1 Results: Constraints on Extended Cosmological Models from Galaxy Clustering and Weak Lensing. Phys. Rev. D. 2019. doi:10.1103/PhysRevD.99.123505. arXiv:1810.02499

    work page doi:10.1103/physrevd.99.123505 2019

  14. [14]

    The Loss Surfaces of Multilayer Networks

    Choromanska, Anna and Henaff, MIkael and Mathieu, Michael and Ben Arous, Gerard and LeCun, Yann , booktitle =. 2015 , editor =. doi:https://doi.org/10.48550/arXiv.1412.0233 , abstract =

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1412.0233 2015

  15. [15]

    Deep Residual Learning for Image Recognition , year=

    He, Kaiming and Zhang, Xiangyu and Ren, Shaoqing and Sun, Jian , booktitle=. Deep Residual Learning for Image Recognition , year=

  16. [16]

    MacKay, David J. C. , title =. Neural Computation , volume =. 1992 , month =. doi:10.1162/neco.1992.4.3.448 , url =

    work page doi:10.1162/neco.1992.4.3.448 1992

  17. [17]

    2017 , eprint=

    Entropy-SGD: Biasing Gradient Descent Into Wide Valleys , author=. 2017 , eprint=

    2017

  18. [18]

    Levent Sagun and Utku Evci and V. Ugur G. Empirical Analysis of the Hessian of Over-Parametrized Neural Networks , booktitle =. 2018 , doi =

    2018

  19. [19]

    Equivalence of quantum barren plateaus to cost concentration and narrow gorges , volume=

    Arrasmith, Andrew and Holmes, Zoë and Cerezo, M and Coles, Patrick J , year=. Equivalence of quantum barren plateaus to cost concentration and narrow gorges , volume=. Quantum Science and Technology , publisher=. doi:10.1088/2058-9565/ac7d06 , number=

    work page doi:10.1088/2058-9565/ac7d06 2058

  20. [20]

    Random Forests

    Breiman, L. Random Forests. Machine Learning. 2001. doi:10.1023/A:1010933404324

    work page doi:10.1023/a:1010933404324 2001

  21. [21]

    2012 , publisher =

    Ensemble Methods: Foundations and Algorithms , author =. 2012 , publisher =

    2012

  22. [22]

    and Barro, S

    Fernandez-Delgado, Manuel and Cernadas, E. and Barro, S. and Amorim, Dinani , year =. Do we Need Hundreds of Classifiers to Solve Real World Classification Problems? , volume =

  23. [23]

    Wyner and Matthew Olson and Justin Bleich and David Mease , title =

    Abraham J. Wyner and Matthew Olson and Justin Bleich and David Mease , title =. J. Mach. Learn. Res. , volume =. 2017 , url =

    2017

  24. [24]

    James Bradbury and Roy Frostig and Peter Hawkins and Matthew James Johnson and Chris Leary and Dougal Maclaurin and George Necula and Adam Paszke and Jake Vander

  25. [25]

    2022 , eprint=

    PennyLane: Automatic differentiation of hybrid quantum-classical computations , author=. 2022 , eprint=

    2022

  26. [26]

    and Varoquaux, G

    Pedregosa, F. and Varoquaux, G. and Gramfort, A. and Michel, V. and Thirion, B. and Grisel, O. and Blondel, M. and Prettenhofer, P. and Weiss, R. and Dubourg, V. and Vanderplas, J. and Passos, A. and Cournapeau, D. and Brucher, M. and Perrot, M. and Duchesnay, E. , journal=. Scikit-learn: Machine Learning in

  27. [27]

    doi:10.1088/1674-1056/acb75e , abstract =

    Single-Qubit Quantum Classifier Based on Gradient-Free Optimization Algorithm , author =. doi:10.1088/1674-1056/acb75e , abstract =

    work page doi:10.1088/1674-1056/acb75e

  28. [28]

    doi:10.22331/q-2021-10-05-558 , abstract =

    Effect of Barren Plateaus on Gradient-Free Optimization , author =. doi:10.22331/q-2021-10-05-558 , abstract =

    work page doi:10.22331/q-2021-10-05-558 2021

  29. [29]

    doi:10.1038/s41586-019-1666-5 , url =

    Quantum Supremacy Using a Programmable Superconducting Processor , author =. doi:10.1038/s41586-019-1666-5 , url =

    work page doi:10.1038/s41586-019-1666-5

  30. [30]

    doi:10.1103/PhysRevResearch.4.013091 , url =

    Quantum State Preparation Protocol for Encoding Classical Data into the Amplitudes of a Quantum Information Processing Register's Wave Function , author =. doi:10.1103/PhysRevResearch.4.013091 , url =

    work page doi:10.1103/physrevresearch.4.013091

  31. [31]

    2408.11110 , eprinttype =

    Towards a Theory of Phase Transitions in Quantum Control Landscapes , author =. 2408.11110 , eprinttype =

    work page arXiv

  32. [32]

    doi:10.1088/1367-2630/ab14b5 , abstract =

    Adversarial Quantum Circuit Learning for Pure State Approximation , author =. doi:10.1088/1367-2630/ab14b5 , abstract =

    work page doi:10.1088/1367-2630/ab14b5

  33. [33]

    Bowles, S

    Bowles, Joseph and Ahmed, Shahnawaz and Schuld, Maria , year =. Better than Classical?. 2403.07059 , eprinttype =

    work page arXiv

  34. [34]

    2021 , journaltitle =

    Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits , author =. 2021 , journaltitle =. doi:10.1038/s41467-021-21728-w , url =

    work page doi:10.1038/s41467-021-21728-w 2021

  35. [35]

    and Arrasmith, Andrew and Babbush, Ryan and Benjamin, Simon C

    Cerezo, M. and Arrasmith, Andrew and Babbush, Ryan and Benjamin, Simon C. and Endo, Suguru and Fujii, Keisuke and McClean, Jarrod R. and Mitarai, Kosuke and Yuan, Xiao and Cincio, Lukasz and Coles, Patrick J. , year =. Variational. doi:10.1038/s42254-021-00348-9 , abstract =

    work page doi:10.1038/s42254-021-00348-9

  36. [36]

    doi:10.1088/2058-9565/acef55 , abstract =

    Resource Frugal Optimizer for Quantum Machine Learning , author =. doi:10.1088/2058-9565/acef55 , abstract =

    work page doi:10.1088/2058-9565/acef55 2058

  37. [37]

    Cherrat, El Amine and Kerenidis, Iordanis and Mathur, Natansh and Landman, Jonas and Strahm, Martin and Li, Yun Yvonna , date =. Quantum. doi:10.22331/q-2024-02-22-1265 , url =. 2209.08167 , eprinttype =

    work page doi:10.22331/q-2024-02-22-1265 2024

  38. [38]

    Switching

    Cornelissen, Tim , date =. Switching. doi:10.3384/diss.diva-167271 , url =

    work page doi:10.3384/diss.diva-167271

  39. [39]

    Global Optimization of Quantum Dynamics with

    Dalgaard, Mogens and Motzoi, Felix and Sørensen, Jens Jakob and Sherson, Jacob , date =. Global Optimization of Quantum Dynamics with. doi:10.1038/s41534-019-0241-0 , url =

    work page doi:10.1038/s41534-019-0241-0

  40. [40]

    doi:10.1103/physrevresearch.2.043246 , abstract =

    Avoiding Local Minima in Variational Quantum Eigensolvers with the Natural Gradient Optimizer , author =. doi:10.1103/physrevresearch.2.043246 , abstract =

    work page doi:10.1103/physrevresearch.2.043246

  41. [41]

    General Parameter-Shift Rules for Quantum Gradients , author =

  42. [42]

    Essentially No Barriers in Neural Network Energy Landscape

    Essentially No Barriers in Neural Network Energy Landscape , author =. Proceedings of the 35th International Conference on Machine Learning , pages =. 2018 , editor =. doi:https://doi.org/10.48550/arXiv.1803.00885 , address =

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1803.00885 2018

  43. [43]

    doi:10.1088/2632-2153/acc8b7 , url =

    Bayesian Learning of Parameterised Quantum Circuits , author =. doi:10.1088/2632-2153/acc8b7 , url =

    work page doi:10.1088/2632-2153/acc8b7

  44. [44]

    Simultaneous

    Gacon, Julien and Zoufal, Christa and Carleo, Giuseppe and Woerner, Stefan , date =. Simultaneous. doi:10.22331/q-2021-10-20-567 , url =. 2103.09232 , eprinttype =

    work page doi:10.22331/q-2021-10-20-567 2021

  45. [45]

    Garipov, Timur and Izmailov, Pavel and Podoprikhin, Dmitrii and Vetrov, Dmitry P and Wilson, Andrew G , date =. Loss

  46. [46]

    Ge, Xiaozhen and Wu, Re-Bing and Rabitz, Herschel , date =. The. 2022 , eprint =

    2022

  47. [47]

    Implications of

    Gonzales, Julius Tan , date =. Implications of. doi:10.1186/s40008-023-00307-w , url =

    work page doi:10.1186/s40008-023-00307-w

  48. [48]

    Quantum Linear Algebra Is All You Need for

    Guo, Naixu and Yu, Zhan and Agrawal, Aman and Rebentrost, Patrick , date =. Quantum Linear Algebra Is All You Need for. 2402.16714 , eprinttype =

    work page arXiv

  49. [49]

    Hagerty, Alexa and Rubinov, Igor , date =. Global

  50. [50]

    Variational

    Hao, Tianyi and He, Zichang and Shaydulin, Ruslan and Pistoia, Marco and Tannu, Swamit , date =. Variational. 2405.10941 , eprinttype =

    work page arXiv

  51. [51]

    Enabling High Performance Debugging for Variational Quantum Algorithms using Compressed Sensing , url=

    Hao, Tianyi and Liu, Kun and Tannu, Swamit , year=. Enabling High Performance Debugging for Variational Quantum Algorithms using Compressed Sensing , url=. doi:10.1145/3579371.3589044 , booktitle=

    work page doi:10.1145/3579371.3589044

  52. [52]

    doi:10.48550/arxiv.2205.05056 , abstract =

    Fundamental Limitations on Optimization in Variational Quantum Algorithms , author =. doi:10.48550/arxiv.2205.05056 , abstract =

    work page doi:10.48550/arxiv.2205.05056

  53. [53]

    and Napp, John C

    Harrow, Aram W. and Napp, John C. , date =. Low-. doi:10.1103/PhysRevLett.126.140502 , url =

    work page doi:10.1103/physrevlett.126.140502

  54. [54]

    Molecular

    Hasegawa, Ryozo and Kobayashi, Masamichi and Tadokoro, Hiroyuki , date =. Molecular. doi:10.1295/polymj.3.591 , url =

    work page doi:10.1295/polymj.3.591

  55. [55]

    The Journal of Chemical Physics , volume =

    Henkelman, Graeme and Jónsson, Hannes , title =. The Journal of Chemical Physics , volume =. 2000 , month =. doi:10.1063/1.1323224 , url =

    work page doi:10.1063/1.1323224 2000

  56. [56]

    Mathematical and Bioinformatic Tools for Cell Tracking , booktitle =

    Hirsch, Peter and Epstein, Leo and Guignard, Léo , date =. Mathematical and Bioinformatic Tools for Cell Tracking , booktitle =. doi:10.1016/B978-0-323-90195-6.00013-9 , url =

    work page doi:10.1016/b978-0-323-90195-6.00013-9

  57. [57]

    doi:10.1002/gamm.202370009 , url =

    Coupled Simulations and Parameter Inversion for Neural System and Electrophysiological Muscle Models , author =. doi:10.1002/gamm.202370009 , url =

    work page doi:10.1002/gamm.202370009

  58. [58]

    Exploring the

    Horoi, Stefan and Huang, Jessie and Rieck, Bastian and Lajoie, Guillaume and Wolf, Guy and Krishnaswamy, Smita , date =. Exploring the. 2102.00485 , eprinttype =

    work page arXiv

  59. [59]

    doi:10.1088/2058-9565/abdbc9 , url =

    Characterizing the Loss Landscape of Variational Quantum Circuits , author =. doi:10.1088/2058-9565/abdbc9 , url =. 2008.02785 , eprinttype =

    work page doi:10.1088/2058-9565/abdbc9 2058

  60. [60]

    Variational Quantum Algorithm for Enhanced Continuous Variable Optical Phase Sensing , author =

  61. [61]

    2018 , journaltitle =

    Barren Plateaus in Quantum Neural Network Training Landscapes , author =. 2018 , journaltitle =. doi:10.1038/s41467-018-07090-4 , abstract =

    work page doi:10.1038/s41467-018-07090-4 2018

  62. [62]

    doi:10.1103/physreva.98.062324 , abstract =

    Differentiable Learning of Quantum Circuit. doi:10.1103/physreva.98.062324 , abstract =

    work page doi:10.1103/physreva.98.062324

  63. [63]

    Johri, Sonika and Debnath, Shantanu and Mocherla, Avinash and Singh, Alexandros and Prakash, Anupam and Kim, Jungsang and Kerenidis, Iordanis , date =. Nearest. 2012.04145 , eprinttype =

    work page arXiv 2012

  64. [64]

    Jones, R. O. , date =. Density Functional Theory:. doi:10.1103/RevModPhys.87.897 , url =

    work page doi:10.1103/revmodphys.87.897

  65. [65]

    , date =

    Jónsson, Hannes and Mills, Greg and Jacobsen, Karsten W. , date =. Nudged Elastic Band Method for Finding Minimum Energy Paths of Transitions , booktitle =. 1998 , pages =. doi:10.1142/9789812839664\_0016 , eventtitle =

    work page doi:10.1142/9789812839664 1998

  66. [66]

    Jumper, John and Evans, Richard and Pritzel, Alexander and Green, Tim and Figurnov, Michael and Ronneberger, Olaf and Tunyasuvunakool, Kathryn and Bates, Russ and Žídek, Augustin and Potapenko, Anna and Bridgland, Alex and Meyer, Clemens and Kohl, Simon A. A. and Ballard, Andrew J. and Cowie, Andrew and Romera-Paredes, Bernardino and Nikolov, Stanislav an...

    work page doi:10.1038/s41586-021-03819-2

  67. [67]

    2021 , journaltitle =

    Mode Connectivity in the Loss Landscape of Parameterized Quantum Circuits , author =. 2021 , journaltitle =. doi:10.1007/s42484-021-00059-5 , abstract =

    work page doi:10.1007/s42484-021-00059-5 2021

  68. [68]

    and Hamze, Firas and Zhu, Zheng and Ochoa, Andrew J

    Katzgraber, Helmut G. and Hamze, Firas and Zhu, Zheng and Ochoa, Andrew J. and Munoz-Bauza, H. , date =. Seeking. doi:10.1103/PhysRevX.5.031026 , url =

    work page doi:10.1103/physrevx.5.031026

  69. [69]

    Keskar, Nitish Shirish and Mudigere, Dheevatsa and Nocedal, Jorge and Smelyanskiy, Mikhail and Tang, Ping Tak Peter , date =. On. 2017 , eprint =. doi:10.48550/arXiv.1609.04836 , abstract =

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1609.04836 2017

  70. [70]

    doi:10.1038/s41586-019-1177-4 , url =

    Self-Verifying Variational Quantum Simulation of Lattice Models , author =. doi:10.1038/s41586-019-1177-4 , url =

    work page doi:10.1038/s41586-019-1177-4

  71. [71]

    and Arrasmith, Andrew and Cincio, Lukasz and Coles, Patrick J

    Kübler, Jonas M. and Arrasmith, Andrew and Cincio, Lukasz and Coles, Patrick J. , date =. An. doi:10.22331/q-2020-05-11-263 , url =. 1909.09083 , eprinttype =

    work page doi:10.22331/q-2020-05-11-263 2020

  72. [72]

    Explaining

    Kuditipudi, Rohith and Wang, Xiang and Lee, Holden and Zhang, Yi and Li, Zhiyuan and Hu, Wei and Arora, Sanjeev and Ge, Rong , date =. Explaining

  73. [73]

    and Kliem, H

    Kühn, M. and Kliem, H. , date =. Monte. doi:10.1002/pssb.200743272 , url =

    work page doi:10.1002/pssb.200743272

  74. [74]

    and Kusneniwar, Hrishikesh G

    Kumar, Lokesh and Sahay, Sanjay K. and Kusneniwar, Hrishikesh G. , date =. An Investigation of Two-Step Cascaded. doi:10.1016/j.procs.2023.08.205 , url =

    work page doi:10.1016/j.procs.2023.08.205 2023

  75. [75]

    Gradient-Free Quantum Optimization on

  76. [76]

    2018 , journaltitle =

    Quantum Control Landscape for a Two-Level System near the Quantum Speed Limit , author =. 2018 , journaltitle =. doi:10.1088/1751-8121/aad657 , url =

    work page doi:10.1088/1751-8121/aad657 2018

  77. [77]

    Larocca, S

    Larocca, Martin and Thanasilp, Supanut and Wang, Samson and Sharma, Kunal and Biamonte, Jacob and Coles, Patrick J. and Cincio, Lukasz and McClean, Jarrod R. and Holmes, Zoë and Cerezo, M. , year =. A. doi:https://doi.org/10.48550/arXiv.2405.00781 , abstract =. 2405.00781 , eprinttype =

    work page doi:10.48550/arxiv.2405.00781

  78. [78]

    Tight and

    Letcher, Alistair and Woerner, Stefan and Zoufal, Christa , date =. Tight and. 2309.12681 , eprinttype =

    work page arXiv

  79. [79]

    Visualizing the Loss Landscape of Neural Nets

    Li, Hao and Xu, Zheng and Taylor, Gavin and Studer, Christoph and Goldstein, Tom , date =. Visualizing the. 2018 , eprint =. doi:https://doi.org/10.48550/arXiv.1712.09913 , abstract =

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1712.09913 2018

  80. [80]

    Improved

    Li, Xiang and Huang, Jia-Cheng and Zhang, Guang-Ze and Li, Hao-En and Shen, Zhu-Ping and Zhao, Chen and Li, Jun and Hu, Han-Shi , date =. Improved. 2404.09280 , eprinttype =

    work page arXiv

Showing first 80 references.