Pith. sign in

REVIEW 3 major objections 2 minor 52 references

The paper claims that a distributed quantum simulator using shared layered storage and De-TCP/IP can eliminate the inter-node network bottleneck and run a 27-qubit simulation more than 350% faster, but the full text supplied is an unrelated

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Abstract-level claim: a shared-storage, layered-memory architecture for distributed quantum simulation purportedly improves performance by over 350%; the manuscript body is an unrelated physics paper, so the claim cannot be checked.

T0 review reviewed 2026-08-05 challenge →

load-bearing objection The submission is an abstract-only claim whose body is an unrelated physics paper; there is no verifiable content to review. the 3 major comments →

arxiv 2508.15542 v1 pith:6BTJCT6N submitted 2025-08-21 cs.ET quant-ph

Distributed Shared Layered Storage Quantum Simulator: A novel quantum simulation system for efficient scaling and cost optimization

Mingyang Yu , Haorui Yang , Donglin Wang , Desheng Kong , Ji Du , Yulong Fu , Wei Wang , Jing Xu This is my paper
classification cs.ET quant-ph
keywords distributed quantum simulationstate-vector simulatorlayered storagenetwork bottleneckmultifractalityradial disorderAnderson localizationhigh-dimensional graphs
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The reading

The named paper sets out to establish that distributed state-vector quantum simulation is limited by East-West (node-to-node) network traffic, and that a Distributed Shared Layered Storage Quantum Simulator—where compute nodes read and write a shared storage pool directly and use De-TCP/IP instead of ordinary TCP/IP—can remove that bottleneck, use cheaper memory tiers, and run a 27-qubit simulation more than 350% faster than existing distributed simulators. If true, this would mean quantum simulation clusters could scale past single-node memory limits without paying for expensive high-performance memory on every node. However, the supplied document does not contain the described system or its experiments: the text after the abstract is an unrelated theoretical study of multifractal eigenstates on high-dimensional graphs with radial disorder. The abstract's performance claim is therefore the central claim on the table, and it currently rests on the abstract alone.

Core claim

The core assertion, as stated in the abstract, is that the primary performance bottleneck in distributed state-vector quantum simulation—tracking the full set of complex amplitudes of a quantum state—is the East-West network flow between computational nodes, and that sharing a layered storage tier directly across nodes, together with De-TCP/IP networking, eliminates that flow. The claimed consequence is a more than 350% performance improvement over existing distributed technologies, demonstrated in the abstract by a 27-qubit simulation that confirms layered storage inside the simulator. The full text supplied alongside the abstract does not describe this architecture, protocol, or experiment

What carries the argument

For the abstract's claim, the load-bearing mechanism is the shared layered storage tier: multiple compute nodes access a common storage pool directly, eliminating East-West inter-node messages, while De-TCP/IP handles the remaining transport; layered storage then moves most state-vector data onto cheaper tiers to cut memory cost. In the full-text portion, the mechanism is instead radial disorder—site energies that are equal for all sites at the same graph distance from a chosen root—which fragments high-dimensional graphs into effective one-dimensional chains whose Anderson-localized states produce unusually broad multifractal statistics.

Load-bearing premise

The load-bearing premise is that traffic between compute nodes is what slows distributed quantum simulation down, and that routing data through a shared storage tier makes things faster instead of simply moving the congestion to the storage connections; the supplied document offers no measurements of either the network or the storage behavior.

What would settle it

Run one fixed state-vector simulation (for example 27 qubits) on identical hardware and measure wall-clock time, bytes moved across the network, and bytes moved across the storage fabric, with the proposed shared-layered-storage/De-TCP/IP path enabled and disabled. If end-to-end time does not drop when node-to-node traffic is suppressed, the central claim fails. A simpler check also applies to this submission: after the abstract, the document contains no system design, protocol description, or 27-qubit benchmark results to inspect.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • If the abstract is right, distributed quantum simulators can scale past per-node memory limits by treating the storage fabric, not the network, as the main data path for state-vector updates.
  • A 350% improvement means the 27-qubit workload would complete in less than a quarter of the baseline time, making larger simulations practical on commodity clusters.
  • Layered storage would shift cluster cost from high-performance DRAM to cheaper storage tiers, lowering the price of running quantum simulation workloads.
  • The choice of De-TCP/IP would become a first-order scaling decision: standard networking stacks would be identified as part of the bottleneck the architecture removes.

Where Pith is reading between the lines

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

  • Because the supplied text never describes De-TCP/IP or the shared storage layer, the 350% figure is currently a claim about an unshown system; a natural next test is to benchmark a standard state-vector simulator on identical hardware with and without the shared storage tier while keeping the network stack fixed, isolating where the gain comes from.
  • If the elimination of East-West traffic is what matters, the architecture makes a concrete scaling prediction: per-node data movement should grow only slowly with node count, a prediction that could be checked at 30-40 qubits where network overhead is already severe.
  • The architecture could simply relocate the bottleneck: storage-fabric contention, coherency traffic, and lock contention may replace network traffic. Comparing byte-for-byte latency profiles of the network and storage fabrics would settle which bottleneck remains.
  • The radial-disorder result in the body is a separate contribution; read on its own, it offers a family of exactly analyzable multifractal models that could serve as testbeds for multifractal analysis methods in localization studies.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 2 minor

Summary. The abstract claims to introduce DSLSQS, a distributed shared layered storage quantum simulator, and asserts that it eliminates East-West data flow via De-TCP/IP networking, reduces memory cost via layered storage, and yields >350% performance improvement over existing distributed technologies based on a 27-qubit simulation. The full text of the submission, however, is a different manuscript: Logan & Roy, 'Multifractality in high-dimensional graphs induced by correlated radial disorder' (arXiv:2508.15551v2), which contains no reference to DSLSQS, distributed quantum simulation, De-TCP/IP, layered storage, or any 27-qubit benchmark. The submitted paper therefore provides no description of the claimed system beyond the abstract, and no experimental or analytical support for the abstract's quantitative claims.

Significance. The topic of the abstract—cost-efficient distributed state-vector simulation—is relevant to practical quantum computing, and the imagined result would be useful if demonstrated. However, the submission contains no verifiable content to support it: there are no architectural diagrams, no profiling data, no benchmark protocol, no cost model, and no code. The only testable assertion, the >350% improvement figure, is not backed by any data section. Under these conditions the significance cannot be assessed; the abstract is an unverifiable claim.

major comments (3)
  1. [Full text (title/authors and body)] The body of the submission is not the paper described in the abstract. The full text is Logan & Roy, arXiv:2508.15551v2, 'Multifractality in high-dimensional graphs induced by correlated radial disorder', with no mention of DSLSQS, distributed quantum simulation, De-TCP/IP, layered storage, or a 27-qubit benchmark. This mismatch means the central claim of the abstract has no supporting apparatus in the manuscript. Every load-bearing element—architecture, experiment, performance figure—is therefore unverifiable from this submission.
  2. [Abstract (performance claim)] The reported 'performance improvement of over 350% compared to existing distributed technologies' (abstract, final sentence) is not accompanied by a baseline definition, measurement protocol, hardware/software stack, workload class (e.g., state-vector size, gate count), or error analysis. No equation, table, or data section reports these results. The claim is therefore an unsupported quantitative assertion.
  3. [Abstract (bottleneck claim)] The architectural premise 'identifying distributed networking as the primary performance bottleneck' is asserted without profiling. The body contains no network-traffic measurements, storage- versus network-latency comparison, or cost model. If the argument is that routing East-West traffic through a shared storage tier removes the bottleneck, the manuscript must at least characterize storage-fabric contention, lock traffic, and coherence overhead; none appear. This is a load-bearing unstated assumption, not a demonstrated result.
minor comments (2)
  1. [Abstract] The phrase 'high-frequency traversal characteristic' is undefined. If it refers to frequent state-vector access, define it in a quantifiable way; otherwise it is not meaningful.
  2. [Full-text author affiliation] The first author's postal code is written 'Oxford13QXZ'; this appears to be a typo. This is minor compared to the body mismatch, but should be corrected in any resubmission.

Circularity Check

0 steps flagged

No circularity identified: the full text is a different paper, so there is no derivation chain to audit; the abstract's 350% claim is unverifiable but not circular.

full rationale

The submission's abstract claims DSLSQS, a distributed shared layered storage quantum simulator, with a 27-qubit experiment and a 'performance improvement of over 350% compared to existing distributed technologies.' However, the full text is Logan & Roy, arXiv:2508.15551v2, 'Multifractality in high-dimensional graphs induced by correlated radial disorder'—a condensed-matter theory paper with no mention of DSLSQS, quantum simulation, De-TCP/IP, layered storage, or benchmarks. Under the review rule that all manuscript text is in-scope, this mismatch is decisive for assessing the submission's support, but it is not a circularity. Circularity requires a claimed derivation or prediction that reduces by construction to an input, a fitted parameter, or a load-bearing self-citation. Here there is no derivation, no model, no equation, no fitted parameter, and no experimental protocol in the provided text. The abstract's performance claim is an unsupported assertion without a described baseline, which is a missing-evidence and integrity problem, not a self-referential logical circularity. No equation can be exhibited that equals its own input because no equations are present for the claimed system. Likewise, no self-citation is invoked as proof. Therefore, the correct circularity finding is no significant circularity, score 0. The absence of supporting apparatus should be addressed as a correctness/verification failure rather than as a circular reasoning defect.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The abstract's claims are asserted, not derived: no equations, model, or benchmark protocol appear in the available text, and the body is an unrelated manuscript. The ledger therefore records the abstract's implicit assumptions rather than audited derivations. No free parameters are identifiable. De-TCP/IP is the only coined technical entity, and it is not specified.

axioms (2)
  • domain assumption Distributed networking is the primary performance bottleneck in distributed quantum simulation clusters; shared storage eliminates East-West data flow.
    Stated in the abstract ('identifying distributed networking as the primary performance bottleneck'). Asserted without the profiling or benchmark data the abstract says the paper contains; the body provides none.
  • domain assumption Reducing high-performance memory usage via layered storage lowers cost without proportionally degrading simulation speed.
    Implicit in the cost-optimization contribution claim ('reduces usage of expensive high-performance memory and substantially lowers simulation costs'). Not demonstrated in the available text.
invented entities (1)
  • De-TCP/IP networking no independent evidence
    purpose: Networking technology intended to remove East-West data flow between nodes that share storage
    Coined in the abstract with no protocol specification, no implementation details, and no way to test it independently; the 27-qubit run allegedly validates it but no data are present.

reviewed 2026-08-05 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Distributed Shared Layered Storage Quantum Simulator: A novel quantum simulation system for efficient scaling and cost optimization." pith.science (2026). https://pith.science/paper/6BTJCT6N

@misc{pith2026250815542,
  author       = {Pith},
  title        = {Pith review of: Distributed Shared Layered Storage Quantum Simulator: A novel quantum simulation system for efficient scaling and cost optimization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6BTJCT6N}},
  note         = {Machine review of arXiv:2508.15542}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum simulators are essential tools for developing and testing quantum algorithms. However, the high-frequency traversal characteristic of quantum simulators represents an unprecedented demand in the history of IT, and existing distributed technologies is unable to meet this requirement, resulting in a single-node bottleneck of quantum simulator. To overcome this limitation, this paper introduces a novel Distributed Shared Layered Storage Quantum Simulator (DSLSQS). By leveraging an innovative distributed architecture in which multiple computational nodes share data storage directly, together with De-TCP/IP networking technology, DSLSQS effectively eliminates East-West data flow in distributed systems. This approach mitigates the bottleneck of distributed quantum simulation clusters and enhances the scalability. Moreover, the system employs layered storage technology, which reduces usage of expensive high-performance memory and substantially lowers simulation costs. Furthermore, this paper systematically analyzes the performance and cost constraints of distributed quantum simulator cluster, identifying distributed networking as the primary performance bottleneck and highlighting that minimizing storage costs is crucial to reducing the total cost. Finally, experimental evaluations with a 27-qubit simulation confirm the successful implementation of layered storage within the quantum simulator. DSLSQS significantly enhances simulation efficiency, yielding a performance improvement of over 350% compared to existing distributed technologies. These results underscore the superior performance and scalability of the proposed architecture in managing complex quantum computing tasks. This paper provides crucial insights for the practical deployment of quantum computing and presents an effective framework for the development of distributed quantum simulation clusters.

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

52 extracted references · 44 canonical work pages · 1 internal anchor

  1. [36]

    Scaling of Fock space propagator in quasiperiodic many-body localizing systems

    S. Ghosh, J. Sutradhar, S. Mukerjee, and S. Banerjee, Scaling of Fock space propagator in quasiperiodic many- body localizing systems (2024), arXiv:2401.03027 [cond- mat.dis-nn]

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  2. [37]

    Tikhonov and A

    K. Tikhonov and A. Mirlin, From Anderson localization on random regular graphs to many-body localization, An- nals of Physics 435, 168525 (2021)

    work page 2021

  3. [38]

    Roy and D

    S. Roy and D. E. Logan, The Fock-space landscape of many-body localisation, Journal of Physics: Condensed Matter 37, 073003 (2024)

    work page 2024

  4. [39]

    De Luca and A

    A. De Luca and A. Scardicchio, Ergodicity breaking in a model showing many-body localization, Europhys. Lett. 101, 37003 (2013)

    2013

  5. [40]

    Biroli and M

    G. Biroli and M. Tarzia, Delocalized glassy dynamics and many-body localization, Phys. Rev. B 96, 201114 (2017)

    work page 2017

  6. [41]

    Biroli and M

    G. Biroli and M. Tarzia, Anomalous dynamics on the ergodic side of the many-body localization transition and the glassy phase of directed polymers in random media, Phys. Rev. B 102, 064211 (2020)

    work page 2020

  7. [42]

    Roy and D

    S. Roy and D. E. Logan, Localization on Certain Graphs with Strongly Correlated Disorder, Phys. Rev. Lett. 125, 250402 (2020)

    work page 2020

  8. [43]

    Biroli, A

    G. Biroli, A. K. Hartmann, and M. Tarzia, Large- deviation analysis of rare resonances for the many-body localization transition, Phys. Rev. B 110, 014205 (2024)

    work page 2024

  9. [44]

    D. J. Luitz, N. Laflorencie, and F. Alet, Many-body local- ization edge in the random-field Heisenberg chain, Phys. Rev. B 91, 081103 (2015)

    2015

  10. [45]

    Mac´ e, F

    N. Mac´ e, F. Alet, and N. Laflorencie, Multifractal scal- ings across the many-body localization transition, Phys. Rev. Lett. 123, 180601 (2019)

    work page 2019

  11. [46]

    Rosenzweig and C

    N. Rosenzweig and C. E. Porter, Repulsion of energy levels in complex atomic spectra, Phys. Rev. 120, 1698 (1960)

    work page 1960

  12. [47]

    A. D. Mirlin, Y. V. Fyodorov, F.-M. Dittes, J. Quezada, and T. H. Seligman, Transition from localized to ex- tended eigenstates in the ensemble of power-law random banded matrices, Phys. Rev. E 54, 3221 (1996)

    work page 1996

  13. [48]

    Kravtsov, I

    V. Kravtsov, I. Khaymovich, E. Cuevas, and M. Amini, A random matrix model with localization and ergodic transitions, New J. Phys. 17, 122002 (2015)

    work page 2015

  14. [49]

    L. F. Cugliandolo, G. Schehr, M. Tarzia, and D. Ven- turelli, Multifractal phase in the weighted adjacency ma- trices of random Erd¨ os-R´ enyi graphs, Phys. Rev. B110, 174202 (2024)

    2024

  15. [50]

    J. T. Chalker, Scaling and correlations at a mobility edge in two dimensions, Journal of Physics C: Solid State Physics 21, L119 (1988)

    work page 1988

  16. [51]

    J. T. Chalker, Scaling and eigenfunction correlations near a mobility edge, Physica A: Statistical Mechanics and its Applications 167, 253 (1990)

    work page 1990

  17. [52]

    A. W. W. Ludwig, M. P. A. Fisher, R. Shankar, and G. Grinstein, Integer quantum Hall transition: An alter- native approach and exact results, Phys. Rev. B 50, 7526 (1994)

    work page 1994

  18. [53]

    Huckestein, Scaling theory of the integer quantum Hall effect, Rev

    B. Huckestein, Scaling theory of the integer quantum Hall effect, Rev. Mod. Phys. 67, 357 (1995)

    work page 1995

  19. [54]

    Evers, A

    F. Evers, A. Mildenberger, and A. D. Mirlin, Multifrac- tality of wave functions at the quantum Hall transition revisited, Phys. Rev. B 64, 241303 (2001)

    work page 2001

  20. [55]

    A. D. Mirlin and F. Evers, Multifractality and critical fluctuations at the Anderson transition, Phys. Rev. B 62, 7920 (2000)

    2000

  21. [56]

    K. S. Tikhonov and A. D. Mirlin, Critical behavior at the localization transition on random regular graphs, Phys. Rev. B 99, 214202 (2019)

    work page 2019

  22. [57]

    P. A. Nosov, I. M. Khaymovich, and V. E. Kravtsov, Correlation-induced localization, Phys. Rev. B 99, 104203 (2019)

    work page 2019

  23. [58]

    Duthie, S

    A. Duthie, S. Roy, and D. E. Logan, Anomalous mul- tifractality in quantum chains with strongly correlated disorder, Phys. Rev. B 106, L020201 (2022)

    work page 2022

  24. [59]

    M. R. Zirnbauer, Localization transition on the Bethe lattice, Phys. Rev. B 34, 6394 (1986)

    work page 1986

  25. [60]

    J. T. Chalker and S. Siak, Anderson localisation on a Cayley tree: a new model with a simple solution, J. Phys.: Cond. Matt. 2, 2671 (1990)

    work page 1990

  26. [61]

    A. D. Mirlin and Y. V. Fyodorov, Localization transition in the Anderson model on the Bethe lattice: Sponta- neous symmetry breaking and correlation functions, Nu- clear Physics B 366, 507 (1991)

    work page 1991

  27. [62]

    Derrida and G

    B. Derrida and G. J. Rodgers, Anderson model on a Cayley tree: the density of states, Journal of Physics A: Mathematical and General 26, L457 (1993)

    work page 1993

  28. [63]

    Monthus and T

    C. Monthus and T. Garel, Anderson transition on the Cayley tree as a traveling wave critical point for various probability distributions, Journal of Physics A: Mathe- matical and Theoretical 42, 075002 (2008)

    work page 2008

  29. [64]

    Monthus and T

    C. Monthus and T. Garel, Anderson localization on the Cayley tree: multifractal statistics of the transmission at criticality and off criticality, J. Phys. A 44, 145001 (2011)

    work page 2011

  30. [65]

    K. S. Tikhonov and A. D. Mirlin, Fractality of wave func- tions on a Cayley tree: Difference between tree and lo- cally treelike graph without boundary, Phys. Rev. B 94, 184203 (2016)

    work page 2016

  31. [66]

    Kravtsov, B

    V. Kravtsov, B. Altshuler, and L. Ioffe, Non-ergodic de- localized phase in Anderson model on Bethe lattice and regular graph, Annals of Physics 389, 148 (2018)

    work page 2018

  32. [67]

    Savitz, C

    S. Savitz, C. Peng, and G. Refael, Anderson localization on the Bethe lattice using cages and the Wegner flow, Phys. Rev. B 100, 094201 (2019)

    work page 2019

  33. [68]

    Parisi, S

    G. Parisi, S. Pascazio, F. Pietracaprina, V. Ros, and A. Scardicchio, Anderson transition on the Bethe lattice: an approach with real energies, Journal of Physics A: Mathematical and Theoretical 53, 014003 (2019)

    work page 2019

  34. [69]

    Derrida, Random-energy model: Limit of a family of disordered models, Phys

    B. Derrida, Random-energy model: Limit of a family of disordered models, Phys. Rev. Lett. 45, 79 (1980)

    1980

  35. [70]

    C. R. Laumann, A. Pal, and A. Scardicchio, Many-body mobility edge in a mean-field quantum spin glass, Phys. Rev. Lett. 113, 200405 (2014)

    work page 2014

  36. [71]

    C. L. Baldwin, C. R. Laumann, A. Pal, and A. Scardic- chio, The many-body localized phase of the quantum ran- dom energy model, Phys. Rev. B 93, 024202 (2016)

    work page 2016

  37. [72]

    Aubry and G

    S. Aubry and G. Andr´ e, Analyticity breaking and Ander- son localization in incommensurate lattices, Ann. Israel Phys. Soc 3, 18 (1980)

    work page 1980

  38. [73]

    Balasubramanian, P

    V. Balasubramanian, P. Caputa, J. M. Magan, and Q. Wu, Quantum chaos and the complexity of spread of states, Phys. Rev. D 106, 046007 (2022)

    work page 2022

  39. [74]

    Balasubramanian, J

    V. Balasubramanian, J. M. Magan, and Q. Wu, Tridi- agonalizing random matrices, Phys. Rev. D 107, 126001 (2023)

    work page 2023

  40. [75]

    Gautam, K

    M. Gautam, K. Pal, K. Pal, A. Gill, N. Jaiswal, and T. Sarkar, Spread complexity evolution in quenched in- teracting quantum systems, Phys. Rev. B 109, 014312 18 (2024)

    work page 2024

  41. [76]

    Nandy, A

    P. Nandy, A. S. Matsoukas-Roubeas, P. Mart ´ ınez- Azcona, A. Dymarsky, and A. del Campo, Quantum dynamics in Krylov space: Methods and applications, Physics Reports 1125-1128, 1 (2025)

    work page 2025

  42. [77]

    P. G. Harper, Single band motion of conduction electrons in a uniform magnetic field, Proceedings of the Physical Society. Section A 68, 874 (1955)

    work page 1955

  43. [78]

    D. J. Thouless, Bandwidths for a quasiperiodic tight- binding model, Phys. Rev. B 28, 4272 (1983)

    work page 1983

  44. [79]

    R. E. Prange, D. R. Grempel, and S. Fishman, Wave functions at a mobility edge: An example of a singular continuous spectrum, Phys. Rev. B 28, 7370 (1983)

    work page 1983

  45. [80]

    Das Sarma, S

    S. Das Sarma, S. He, and X. C. Xie, Mobility edge in a model one-dimensional potential, Phys. Rev. Lett. 61, 2144 (1988)

    work page 1988

  46. [81]

    D. J. Boers, B. Goedeke, D. Hinrichs, and M. Holthaus, Mobility edges in bichromatic optical lattices, Phys. Rev. A 75, 063404 (2007)

    work page 2007

  47. [82]

    Biddle, B

    J. Biddle, B. Wang, D. J. Priour, and S. Das Sarma, Localization in one-dimensional incommensurate lattices beyond the Aubry-Andr´ e model, Phys. Rev. A 80, 021603 (2009)

    work page 2009

  48. [83]

    Ganeshan, J

    S. Ganeshan, J. H. Pixley, and S. Das Sarma, Nearest neighbor tight binding models with an exact mobility edge in one dimension, Phys. Rev. Lett. 114, 146601 (2015)

    2015

  49. [84]

    H. Yao, A. Khoudli, L. Bresque, and L. Sanchez- Palencia, Critical behavior and fractality in shallow one- dimensional quasiperiodic potentials, Phys. Rev. Lett. 123, 070405 (2019)

    2019

  50. [85]

    Y. Wang, X. Xia, L. Zhang, H. Yao, S. Chen, J. You, Q. Zhou, and X.-J. Liu, One-dimensional quasiperiodic mosaic lattice with exact mobility edges, Phys. Rev. Lett. 125, 196604 (2020)

    2020

  51. [86]

    Duthie, S

    A. Duthie, S. Roy, and D. E. Logan, Self-consistent the- ory of mobility edges in quasiperiodic chains, Phys. Rev. B 103, L060201 (2021)

    work page 2021

  52. [87]

    E. N. Economou, Green ’s Functions in Quantum Physics (Springer, Berlin, 2006)

    work page 2006

This paper was first reviewed by deepseek-v4-flash on August 5, 2026.