pith. sign in

arxiv: 2503.13832 · v2 · submitted 2025-03-18 · 🪐 quant-ph

Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator

Yun-Jie Wang , Tai-Ping Sun , Xi-Ning Zhuang , Xiao-Fan Xu , Huan-Yu Liu , Cheng Xue , Yu-Chun Wu , Zhao-Yun Chen
show 1 more author
Guo-Ping Guo
This is my paper

Pith reviewed 2026-05-23 00:19 UTC · model grok-4.3

classification 🪐 quant-ph
keywords QRAMerror filtrationbucket-brigade QRAMquantum simulatorerror suppressionpost-selectionquantum memorynoise-aware pruning
0
0 comments X

The pith

Large-scale QRAM simulations reveal post-selection limits that refine error filtration into size-dependent success criteria.

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

The paper introduces an efficient simulator for bucket-brigade QRAM that combines sparse state encoding with a noise-aware pruning algorithm, allowing full state access for systems up to 20 layers while using under 1 GB of memory. Simulations with this tool uncover suppression anomalies where error filtration fails to improve at high noise levels or large address sizes because post-selection probability imposes a fundamental constraint. The authors incorporate this constraint to turn existing error filtration theory into near-deterministic criteria that tie base infidelity directly to the suppression level that can be achieved. These criteria mark the operating window in which error filtration produces ongoing gains rather than hitting a performance ceiling. The work supplies concrete guidance for when this hardware-efficient noise suppression technique remains useful in realistic QRAM deployments.

Core claim

Incorporating the post-selection probability constraint refines error filtration theory into near-deterministic criteria that link base infidelity to achievable suppression, thereby delineating the regime in which EF yields progressive improvement for bucket-brigade QRAM.

What carries the argument

The noise-aware pruning algorithm paired with sparse state encoding, which enables scalable full-quantum-state simulation of noisy bucket-brigade QRAM while reproducing error dynamics and post-selection statistics.

If this is right

  • Error filtration produces progressive suppression only inside a regime bounded by base infidelity, system size, and post-selection probability.
  • Suppression anomalies emerge at high noise or large address sizes, capping EF scaling regardless of further parameter tuning.
  • The simulator enables quantitative runtime and memory costing for noisy bucket-brigade QRAM up to 20 layers under 1 GB.
  • The framework serves as a practical tool for assessing QRAM performance in parameter regimes beyond prior small-scale studies.

Where Pith is reading between the lines

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

  • Hardware teams could use the criteria to set target base infidelity levels before scaling address size in early QRAM prototypes.
  • The same pruning-plus-sparse-encoding approach may extend to simulators for other quantum memory architectures or hybrid error-mitigation schemes.
  • If the criteria prove robust, algorithm designers might prefer shallower address registers over deeper ones when relying on error filtration.
  • Direct hardware validation of the predicted anomaly thresholds would test whether the simulator's noise model transfers to real devices.

Load-bearing premise

The simulator's pruning and encoding steps accurately reproduce the error dynamics and post-selection statistics of actual bucket-brigade QRAM without systematic bias that would alter the observed suppression behavior.

What would settle it

An experiment on a physical bucket-brigade QRAM device at high noise that measures suppression factors violating the refined infidelity-to-suppression criteria would falsify the claimed regime boundaries.

Figures

Figures reproduced from arXiv: 2503.13832 by Cheng Xue, Guo-Ping Guo, Huan-Yu Liu, Tai-Ping Sun, Xiao-Fan Xu, Xi-Ning Zhuang, Yu-Chun Wu, Yun-Jie Wang, Zhao-Yun Chen.

Figure 2
Figure 2. Figure 2: FIG. 2 [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 1
Figure 1. Figure 1: FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4 [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5 [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6 [PITH_FULL_IMAGE:figures/full_fig_p010_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7 [PITH_FULL_IMAGE:figures/full_fig_p011_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8 [PITH_FULL_IMAGE:figures/full_fig_p012_8.png] view at source ↗
read the original abstract

Quantum random access memory (QRAM) is a critical primitive for quantum algorithms that require data lookup in superposition, but its lack of fault tolerance poses a major obstacle to practical deployment. Error filtration (EF) has been proposed as a hardware-efficient alternative to error correction, capable of suppressing incoherent noise without encoding overhead. However, its performance in realistic QRAM systems with moderate fidelity has remained unclear, as existing analyses rely on asymptotic approximations and numerical simulations have been limited to small sizes. We address this gap using a new simulator for bucket-brigade (BB) QRAM that combines sparse state encoding with a noise-aware pruning algorithm. This framework provides full quantum state access and scales efficiently, enabling us to probe EF performance in size and noise regimes far beyond previous studies. Our simulations reveal suppression anomalies at high noise levels or large address sizes, where post-selection probability fundamentally constrains EF scaling. Incorporating this effect, we refine EF theory into near-deterministic criteria linking base infidelity to achievable suppression, thereby delineating the regime in which EF yields progressive improvement. Beyond refining EF, we quantitatively characterize the runtime and memory costs of our noisy BB QRAM simulator, achieving simulations of systems with 20 layers using less than 1 GB of memory. This efficiency is what enables us to probe parameter regimes beyond previous work and to establish the simulator as a practical, ``fine-print'' analysis tool for assessing QRAM as a quantum resource.

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 / 1 minor

Summary. The manuscript claims to develop a new large-scale simulator for noisy bucket-brigade QRAM combining sparse state encoding with a noise-aware pruning algorithm. This enables efficient simulations (e.g., 20 layers with <1 GB memory) that reveal suppression anomalies in error filtration (EF) at high noise levels or large address sizes. These observations are used to refine EF theory into near-deterministic criteria that link base infidelity to achievable suppression, accounting for post-selection probability constraints.

Significance. The simulator's efficiency allows probing regimes beyond prior work, and the refined criteria could help delineate when EF yields improvement in realistic QRAM. The quantitative characterization of runtime and memory costs is a strength that supports its use as a practical analysis tool.

major comments (2)
  1. [Simulator description and methods] The manuscript does not report any validation of the noise-aware pruning algorithm or sparse encoding against exact small-system bucket-brigade simulations to confirm that post-selection probabilities and error filtration dynamics are reproduced without systematic bias (e.g., premature discarding of amplitudes).
  2. [Results on EF performance and anomalies] The central refined EF criteria are derived from observed suppression anomalies; without reported error bars, verification of pruning decisions, or cross-checks on post-selection statistics, it is unclear whether the anomalies (and thus the criteria) are robust or artifacts of the approximation.
minor comments (1)
  1. [Abstract] The abstract states that simulations reveal anomalies but provides no quantitative details on the address sizes, noise levels, or number of trials used to identify the post-selection constraints.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments on our manuscript. We address each major comment point by point below, indicating where revisions will be made to improve clarity and rigor.

read point-by-point responses

  1. Referee: [Simulator description and methods] The manuscript does not report any validation of the noise-aware pruning algorithm or sparse encoding against exact small-system bucket-brigade simulations to confirm that post-selection probabilities and error filtration dynamics are reproduced without systematic bias (e.g., premature discarding of amplitudes).

    Authors: We agree that direct validation against exact simulations is essential to rule out systematic bias. In the revised manuscript we will add an appendix with explicit comparisons for small systems (address sizes up to 5 qubits, where exact simulation remains feasible). These will demonstrate that post-selection probabilities agree to within 1% relative error and that error-filtration suppression factors match the exact results, confirming that the pruning threshold does not prematurely discard relevant amplitudes in the regimes studied. revision: yes

  2. Referee: [Results on EF performance and anomalies] The central refined EF criteria are derived from observed suppression anomalies; without reported error bars, verification of pruning decisions, or cross-checks on post-selection statistics, it is unclear whether the anomalies (and thus the criteria) are robust or artifacts of the approximation.

    Authors: The refined criteria incorporate an analytical post-selection probability bound that is independent of the numerical method; the simulator observations serve only to motivate the form of the bound. To strengthen the presentation we will add (i) error bars obtained from ensemble averages over independent noise realizations and (ii) tables reporting the fraction of amplitudes retained after each pruning step. While exhaustive exact cross-checks are impossible for the largest address sizes, the small-system validations described above will provide supporting evidence that the observed anomalies are not artifacts. We therefore view the revision as partial, as full verification for every data point remains computationally out of reach. revision: partial

Circularity Check

0 steps flagged

No significant circularity; criteria derived from independent numerical observations

full rationale

The paper's central refinement of EF theory into near-deterministic criteria is explicitly based on numerical observations of post-selection probability and suppression anomalies extracted from large-scale simulations using the new sparse-encoding + noise-aware-pruning simulator. No load-bearing step reduces by the paper's own equations to a fitted parameter, self-citation chain, or definitional equivalence; the simulator output serves as external computational evidence rather than an internal tautology. The derivation chain therefore remains self-contained against the provided simulation data.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract mentions no free parameters or new postulated entities. The work rests on standard quantum noise models and the bucket-brigade architecture.

axioms (1)
  • domain assumption Standard models of incoherent noise apply to the bucket-brigade QRAM circuits being simulated.
    The simulator is described as noise-aware and the anomalies are attributed to post-selection under those noise models.

pith-pipeline@v0.9.0 · 5817 in / 1113 out tokens · 104871 ms · 2026-05-23T00:19:27.271712+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

60 extracted references · 60 canonical work pages · 3 internal anchors

  1. [1]

    Its data register contains the correct result

    work page

  2. [2]

    Its QRAM routing tree is in the same state |Q⟩ as all other reliable branches. For a randomly sampled noise configuration on the QRAM binary tree, we could determine the set Sgood of reliable addresses in advance and the final state of a single representative branch |Q0⟩ will be: |i⟩|di⟩|Q0⟩, i ∈ Sgood. (6) Branches in Sbad (the complement) are simulated ...

    work page

  3. [3]

    Static Cost Baseline a. Time. In noiseless simulations with fixed branch size, runtime is essentially independent of address size n [Fig. 4(a)]. For branch sizes 2 0–210 runtimes remain flat around 10−1–100 ms. For 2 15, the runtime is proportion- ally larger but still insensitive to n. This confirms that noiseless cost depends only on branch size, not th...

    work page

  4. [4]

    Fig- ures 4(c,d) show runtime and memory overhead in full mode, while Figs

    Noise-Induced Overhead The dynamic cost, defined as ∆Cost = Cost noisy − Costnoiseless, reflects noise-induced overhead. Fig- ures 4(c,d) show runtime and memory overhead in full mode, while Figs. 5(a,b) show pruning mode. In all cases, scaling with (n, p) follows theoretical predictions: the ex- pected number of faulty nodes is N ε with N = O(2n), and ea...

    work page

  5. [5]

    n2p2n ≪ 1 (dashed line n2pmax2n = 1), Costs equal noiseless baseline

    Region I: Noise-free regime. n2p2n ≪ 1 (dashed line n2pmax2n = 1), Costs equal noiseless baseline

    work page

  6. [6]

    1 ≲ n2p2n ≲ 102, gradual increase with n

    Region II: Transitional regime. 1 ≲ n2p2n ≲ 102, gradual increase with n

    work page

  7. [7]

    n2p2n ≫ 1, rapid growth with clear separa- tion by p

    Region III: Noise-dominated regime. n2p2n ≫ 1, rapid growth with clear separa- tion by p. Log–log plots confirm polynomial growth in n and di- vergence between noise levels only at sufficiently large n. This matches theoretical expectations

    work page

  8. [8]

    fine print

    Pruning Mode Performance Figures 5(a,b) show that pruning preserves the same scaling patterns as full mode while reducing absolute costs. Ratios of noisy to noiseless memory, e.g. 2.01 (p = 10 −5) and 11.93 ( p = 10 −4), agree with the pre- dicted linear dependence, Memnoisy Memnoiseless ≈ 1 + p · polylog(N). Direct comparisons [Figs. 5(c,d)] show that pr...

    work page

  9. [9]

    Jaeger and T

    R. Jaeger and T. Blalock, Microelectronic Circuit Design, Connect learn succeed (McGraw-Hill, 2011)

    work page 2011

  10. [10]

    L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the Twenty-Eighth An- nual ACM Symposium on Theory of Computing , STOC ’96 (Association for Computing Machinery, New York, NY, USA, 1996) p. 212–219

    work page 1996

  11. [11]

    P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quan- tum computer, SIAM Review 41, 303 (1999), https://doi.org/10.1137/S0036144598347011

    work page doi:10.1137/s0036144598347011 1999

  12. [12]

    Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018)

    J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018)

    work page 2018

  13. [13]

    Preskill

    J. Preskill, Beyond nisq: The megaquop machine, ACM Transactions on Quantum Computing 6, 10.1145/3723153 (2025)

    work page doi:10.1145/3723153 2025

  14. [14]

    A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum al- gorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009)

    work page 2009

  15. [15]

    B. D. Clader, B. C. Jacobs, and C. R. Sprouse, Precondi- tioned quantum linear system algorithm, Phys. Rev. Lett. 110, 250504 (2013)

    work page 2013

  16. [16]

    A. M. Childs, R. Kothari, and R. D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on preci- sion, SIAM Journal on Computing 46, 1920 (2017), https://doi.org/10.1137/16M1087072

    work page internal anchor Pith review doi:10.1137/16m1087072 1920

  17. [17]

    Kassal, S

    I. Kassal, S. P. Jordan, P. J. Love, M. Mohseni, and A. Aspuru-Guzik, Polynomial-time quantum algorithm for the simulation of chemical dynamics, Proceedings of the National Academy of Sciences 105, 18681 (2008), https://www.pnas.org/doi/pdf/10.1073/pnas.0808245105

    work page doi:10.1073/pnas.0808245105 2008

  18. [18]

    D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, Simulating hamiltonian dynamics with a truncated taylor series, Phys. Rev. Lett. 114, 090502 (2015)

    work page 2015

  19. [19]

    Babbush, C

    R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. Mc- Clean, A. Paler, A. Fowler, and H. Neven, Encoding elec- tronic spectra in quantum circuits with linear t complex- ity, Phys. Rev. X 8, 041015 (2018)

    work page 2018

  20. [20]

    Y. Cao, J. Romero, J. P. Olson, M. Degroote, P. D. John- son, M. Kieferov´ a, I. D. Kivlichan, T. Menke, B. Per- opadre, N. P. D. Sawaya, S. Sim, L. Veis, and A. Aspuru- Guzik, Quantum chemistry in the age of quantum com- puting, Chemical Reviews 119, 10856 (2019), pMID: 31469277, https://doi.org/10.1021/acs.chemrev.8b00803

    work page doi:10.1021/acs.chemrev.8b00803 2019

  21. [21]

    Rebentrost, M

    P. Rebentrost, M. Mohseni, and S. Lloyd, Quantum sup- port vector machine for big data classification, Phys. Rev. Lett. 113, 130503 (2014)

    work page 2014

  22. [22]

    Lloyd, M

    S. Lloyd, M. Mohseni, and P. Rebentrost, Quantum prin- cipal component analysis, Nature Physics 10, 631–633 (2014)

    work page 2014

  23. [23]

    Biamonte, P

    J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Na- ture 549, 195–202 (2017)

    work page 2017

  24. [24]

    Asaka, K

    R. Asaka, K. Sakai, and R. Yahagi, Quantum random access memory via quantum walk, Quantum Science and Technology 6, 035004 (2021)

    work page 2021

  25. [25]

    Asaka, K

    R. Asaka, K. Sakai, and R. Yahagi, Two-level quantum walkers on directed graphs. ii. application to quantum random access memory, Phys. Rev. A107, 022416 (2023)

    work page 2023

  26. [26]

    D. K. Park, F. Petruccione, and J.-K. K. Rhee, Circuit- based quantum random access memory for classical data, Scientific Reports 9, 10.1038/s41598-019-40439-3 (2019)

    work page doi:10.1038/s41598-019-40439-3 2019

  27. [27]

    K. C. Chen, W. Dai, C. Errando-Herranz, S. Lloyd, and D. Englund, Scalable and high-fidelity quantum random access memory in spin-photon networks, PRX Quantum 2, 030319 (2021)

    work page 2021

  28. [28]

    Bugalho, E

    L. Bugalho, E. Z. Cruzeiro, K. C. Chen, W. Dai, D. Englund, and Y. Omar, Resource-efficient simulation of noisy quantum circuits and application to network- enabled qram optimization, npj Quantum Information 9, 10.1038/s41534-023-00773-x (2023)

    work page doi:10.1038/s41534-023-00773-x 2023

  29. [29]

    Mukhopadhyay, A quantum random access memory (qram) using a polynomial encoding of binary strings, Sci- entific Reports 15, 10.1038/s41598-025-95283-5 (2025)

    P. Mukhopadhyay, A quantum random access memory (qram) using a polynomial encoding of binary strings, Sci- entific Reports 15, 10.1038/s41598-025-95283-5 (2025)

    work page doi:10.1038/s41598-025-95283-5 2025

  30. [30]

    G. D. Riso, G. Catalano, S. Lloyd, V. Giovannetti, and D. D. Santis, A resource-efficient quantum-walker quan- tum ram (2025), arXiv:2508.02855 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  31. [31]

    Giovannetti, S

    V. Giovannetti, S. Lloyd, and L. Maccone, Quantum ran- dom access memory, Phys. Rev. Lett.100, 160501 (2008)

    work page 2008

  32. [33]

    C. T. Hann, G. Lee, S. Girvin, and L. Jiang, Resilience of quantum random access memory to generic noise, PRX Quantum 2, 020311 (2021)

    work page 2021

  33. [34]

    C. T. Hann, Practicality of quantum random access mem- ory, Ph.D. thesis, Yale University (2021)

    work page 2021

  34. [35]

    Mehta, G

    R. Mehta, G. Lee, and L. Jiang, Analysis and suppres- sion of errors in quantum random access memory under extended noise models (2024), arXiv:2412.10318 [quant- ph]

    work page arXiv 2024

  35. [36]

    S. Xu, C. T. Hann, B. Foxman, S. M. Girvin, and Y. Ding, Systems architecture for quantum random access mem- ory, in Proceedings of the 56th Annual IEEE/ACM In- 14 ternational Symposium on Microarchitecture, MICRO ’23 (Association for Computing Machinery, New York, NY, USA, 2023) p. 526–538

    work page 2023

  36. [37]

    Weiss, S

    D. Weiss, S. Puri, and S. Girvin, Quantum random access memory architectures using 3d superconducting cavities, PRX Quantum 5, 020312 (2024)

    work page 2024

  37. [38]

    Y.-J. Wang, S. Zhang, T.-P. Sun, Z.-A. Zhao, X.-F. Xu, X.-N. Zhuang, H.-Y. Liu, C. Xue, P. Duan, Y.-C. Wu, Z.-Y. Chen, and G.-P. Guo, Hardware-efficient quantum random access memory design with a native gate set on superconducting platforms, Advanced Quantum Tech- nologies , 2400519

    work page

  38. [39]

    Z. Wang, H. Qiao, A. N. Cleland, and L. Jiang, Quantum random access memory with transmon-controlled phonon routing, Phys. Rev. Lett. 134, 210601 (2025)

    work page 2025

  39. [40]

    Zhang, Y.-J

    S. Zhang, Y.-J. Wang, P. Wang, R.-Z. Zhao, X.-Y. Yang, Z.-A. Zhao, T.-L. Wang, H.-F. Zhang, Z.-F. Li, Y. Wu, H.-R. Tao, L.-L. Guo, L. Du, C. Zhang, Z.-L. Jia, W.- C. Kong, Z.-Z. Zhang, X.-X. Song, Y.-C. Wu, Z.-Y. Chen, P. Duan, and G.-P. Guo, Demonstrating coher- ent quantum routers for bucket-brigade quantum random access memory on a superconducting proc...

    work page arXiv 2025

  40. [41]

    F. Shen, Y. Ji, D. Xiang, Y. Wang, K. Wang, C. Zhang, A. Zhang, Y. Zou, Y. Gao, Z. Cui, G. Liu, J. Yang, Y. Han, J. Deng, A. Wang, Z. Zhang, H. Li, Q. Guo, P. Zhang, C. Song, L. Lu, Z. Wang, and J. Yin, Experi- mental realization of the bucket-brigade quantum random access memory (2025), arXiv:2506.16682 [quant-ph]

    work page arXiv 2025

  41. [42]

    Aaronson, Read the fine print, Nature Physics 11, 291–293 (2015)

    S. Aaronson, Read the fine print, Nature Physics 11, 291–293 (2015)

    work page 2015

  42. [43]

    C. Liu, M. Wang, S. A. Stein, Y. Ding, and A. Li, Quan- tum memory: A missing piece in quantum computing units (2023), arXiv:2309.14432 [quant-ph]

    work page arXiv 2023

  43. [44]

    Jaques and A

    S. Jaques and A. G. Rattew, Qram: A survey and critique (2023), arXiv:2305.10310 [quant-ph]

    work page arXiv 2023

  44. [45]

    Newman and Y

    M. Newman and Y. Shi, Limitations on transversal computation through quantum homomorphic encryption, Quantum Info. Comput. 18, 927–948 (2018)

    work page 2018

  45. [46]

    O. D. Matteo, V. Gheorghiu, and M. Mosca, Fault- tolerant resource estimation of quantum random-access memories, IEEE Transactions on Quantum Engineering 1, 1 (2020)

    work page 2020

  46. [47]

    A. M. Dalzell, A. Gily´ en, C. T. Hann, S. McArdle, G. Salton, Q. T. Nguyen, A. Kubica, and F. G. S. L. Brand˜ ao, A distillation-teleportation protocol for fault- tolerant qram (2025), arXiv:2505.20265 [quant-ph]

    work page arXiv 2025

  47. [48]

    G. Lee, C. T. Hann, S. Puri, S. M. Girvin, and L. Jiang, Error suppression for arbitrary-size black box quantum operations, Phys. Rev. Lett. 131, 190601 (2023)

    work page 2023

  48. [49]

    Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum 5, 497 (2021)

    C. Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum 5, 497 (2021)

    work page 2021

  49. [50]

    Z. Cai, R. Babbush, S. C. Benjamin, S. Endo, W. J. Hug- gins, Y. Li, J. R. McClean, and T. E. O’Brien, Quantum error mitigation, Rev. Mod. Phys. 95, 045005 (2023)

    work page 2023

  50. [51]

    Z.-Y. Chen, C. Xue, Y.-J. Wang, T.-P. Sun, H.-Y. Liu, X.-N. Zhuang, M.-H. Dou, T.-R. Zou, Y. Fang, Y.-C. Wu, and G.-P. Guo, Efficient and error-resilient data ac- cess protocols for a limited-sized quantum random access memory (2023), arXiv:2303.05207 [quant-ph]

    work page arXiv 2023

  51. [52]

    Z.-Y. Chen, C. Xue, X.-N. Zhuang, T.-P. Sun, H.-Y. Liu, Y. Li, Y.-C. Wu, and G.-P. Guo, Scalable program im- plementation and simulation of the large-scale quantum algorithm: 1024 ×1024 quantum linear solver and beyond (2023), arXiv:2303.06890 [quant-ph]

    work page arXiv 2023

  52. [53]

    Giovannetti, S

    V. Giovannetti, S. Lloyd, and L. Maccone, Architectures for a quantum random access memory, Phys. Rev. A 78, 052310 (2008)

    work page 2008

  53. [54]

    H¨ aner and D

    T. H¨ aner and D. S. Steiger, 0.5 petabyte simulation of a 45-qubit quantum circuit, in Proceedings of the Inter- national Conference for High Performance Computing, Networking, Storage and Analysis , SC ’17 (Association for Computing Machinery, New York, NY, USA, 2017)

    work page 2017

  54. [55]

    Jaques and T

    S. Jaques and T. H¨ aner, Leveraging state sparsity for more efficient quantum simulations, ACM Transactions on Quantum Computing 3, 10.1145/3491248 (2022)

    work page doi:10.1145/3491248 2022

  55. [56]

    Effect of flipping noise on the entanglement dynamics of a 3x3 system

    M. Ramzan, Effect of flipping noise on the entanglement dynamics of a 3x3 system (2011), arXiv:1111.0947 [quant- ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2011

  56. [57]

    Takahashi, Y

    Y. Takahashi, Y. Takeuchi, and S. Tani, Classically sim- ulating quantum circuits with local depolarizing noise, Theoretical Computer Science 893, 117 (2021). 15 Supplementary Information: Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator I. INTRODUCTION TO BUCKET-BRIGADE QRAM This section provides a comprehensive overvi...

    work page 2021

  57. [58]

    At very small n, runtimes approach the measurement resolution, producing visible scatter

    For small branch sizes (2 0, 2 5, 2 10), the runtime is on the order of 10 −1–100 ms and remains essentially flat for n ≳ 10. At very small n, runtimes approach the measurement resolution, producing visible scatter. For the largest branch size tested (2 15), the runtime is proportionally larger, but still exhibits no appreciable growth with n. These resul...

    work page

  58. [59]

    n2p 2n ≪ 1 (dashed line n2pmax2n = 1)

    Region I: Noise-free regime. n2p 2n ≪ 1 (dashed line n2pmax2n = 1). The expected number of faulty branches is < 1, so noisy simulations match noiseless costs. Runtime per branch and total memory remain flat. 19

    work page

  59. [60]

    1 ≲ n2p 2n ≲ 256

    Region II: Transitional regime. 1 ≲ n2p 2n ≲ 256. Faulty branches grow from O(1) to O(102), producing gradual increases in per-branch load time and total memory. Higher p values (e.g., 10 −4) exhibit visible slope changes in log–log plots, though differences between noise levels remain modest

    work page

  60. [61]

    n2p 2n ≫ 1

    Region III: Noise-dominated regime. n2p 2n ≫ 1. Most branches become unreliable, and cost grows signif- icantly with both n and p. Runtime curves separate clearly by noise strength, with approximately polynomial dependence on n at fixed p. In both figures, dynamic time and memory scale as straight lines in log–log plots, indicating polynomial growth in n....

    work page