pith. machine review for the scientific record. sign in

arxiv: 2604.25644 · v1 · submitted 2026-04-28 · 🪐 quant-ph

Recognition: unknown

Efficient Complex-Valued State Preparation on Bucket Brigade QRAM

Alessandro Berti , Francesco Ghisoni
Authors on Pith no claims yet

Pith reviewed 2026-05-07 16:42 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum state preparationbucket brigade QRAMcomplex amplitude encodingsegment treepolylogarithmic complexityquantum linear algebrahybrid quantum-classical
0
0 comments X

The pith

Storing precomputed rotation angles and phases in bucket-brigade QRAM lets complex quantum states be prepared using only retrievals and controlled rotations at polylogarithmic cost.

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

The paper seeks to simplify quantum state preparation for complex classical data by moving the heavy lifting into classical precomputation inside a bucket-brigade QRAM architecture. It uses a segment tree to calculate the exact fixed-point rotation angles needed for amplitude encoding, then stores those angles directly in the QRAM cells instead of raw values. For complex matrices the cells also hold a phase, so loading happens in two controlled-rotation steps: first magnitudes, then phases. This removes all reversible arithmetic from the quantum processor while keeping the query count at order log squared of the data size. A reader would care because efficient data loading is a bottleneck for quantum machine learning and linear-algebra algorithms, and off-loading arithmetic classically could make those algorithms more hardware-friendly.

Core claim

The authors show that the controlled-rotation subroutine can be removed by classically computing the segment-tree rotation angles and writing the resulting fixed-point values straight into the BBQRAM cells. Each cell also stores a leaf phase, allowing a two-step magnitude-then-phase procedure that prepares the state for any complex matrix. The signed real case reduces to the one-bit phase special case. The entire quantum procedure therefore consists only of BBQRAM retrievals followed by cascades of controlled rotations, using O(MN) memory cells per matrix and no arithmetic circuits on the QPU.

What carries the argument

Segment-tree precomputed fixed-point angles and leaf phases stored in BBQRAM cells, which drive controlled-rotation cascades for two-step magnitude-then-phase loading.

If this is right

  • Complex matrices can be amplitude-encoded without any reversible arithmetic circuits on the quantum processor.
  • The query complexity stays O(log₂²(MN)), the same as the earlier real-valued construction.
  • Memory usage scales linearly as O(MN) cells to hold all angles and phases for an M-by-N matrix.
  • The real signed case is recovered automatically by restricting phases to 0 or π.
  • Quantum algorithms that need to load complex data can do so with simpler quantum circuits.

Where Pith is reading between the lines

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

  • If fixed-point precision proves adequate, the method could reduce quantum gate counts for data loading on near-term hardware.
  • Precomputing control parameters classically might apply to other QRAM-based loading tasks beyond segment trees.
  • Simulator experiments on small matrices would directly test whether retrieval error stays below the threshold needed for high-fidelity states.
  • The same off-loading pattern could help neighbouring problems such as quantum kernel estimation or matrix inversion that also require complex data preparation.

Load-bearing premise

The precomputed fixed-point angles and phases retrieved from BBQRAM cells have enough numerical precision to produce the target state without unacceptable error or extra correction circuits.

What would settle it

Load a known 2-by-2 complex matrix using the procedure on a simulator or small device, then measure the fidelity between the prepared state and the ideal amplitude vector to check whether it stays within the error bound set by the fixed-point precision.

Figures

Figures reproduced from arXiv: 2604.25644 by Alessandro Berti, Francesco Ghisoni.

Figure 1
Figure 1. Figure 1: Cascade of controlled rotations (Definition 4). Each bit view at source ↗
Figure 2
Figure 2. Figure 2: BBQRAM architecture for N = 8 memory cells. Circles are routing switches initialized in the wait state |•⟩; rectangles are memory cells, which can be either classical or quantum bits, storing |xi⟩. for N = 8 memory cells. The device supports queries of the form defined in Definition 6. Definition 6 (BBQRAM query): A BBQRAM with N = 2n memory cells, each storing a t-qubit string xi , implements QRAM: |i⟩ n … view at source ↗
Figure 3
Figure 3. Figure 3: The angle tree Θ for K = 8 entries (Definition 10); nodes hold one t-bit unsigned rotation angle, depth log2 K − 1 = 2, node count K − 1 = 7. The orange leaf row shows the one-bit sign field {s0, . . . , s7} added for real signed data (Corollary 15); the complex case replaces this by the t-bit phase layer Φ of view at source ↗
Figure 4
Figure 4. Figure 4: The complex angle tree Γ = (Θ, Φ) for K = 8 entries (Definition 16). The angle tree Θ has depth log2 K − 1 and stores one unsigned amplitude-splitting angle per internal node of the squared-moduli tree T; it is consumed level by level during Step 1. The phase layer Φ holds one entry-wise phase φ¯z per leaf of T and is consumed by a single coherent retrieval in Step 2. controlled rotations. We count this as… view at source ↗
Figure 5
Figure 5. Figure 5: BBQRAM mapping of the complex angle tree view at source ↗
Figure 6
Figure 6. Figure 6: BBQRAM-cell layout for the example matrix, instantiating Figure 5 with the precomputed angles view at source ↗
read the original abstract

Efficient quantum state preparation is a critical component in quantum algorithms that process large classical data, and it is fundamental to realizing quantum advantage in domains such as machine learning, quantum linear algebra, and quantum finance. Building on the framework of~\cite{berti2025efficient}, which integrates Bucket Brigade QRAM (BBQRAM) with a segment tree to achieve amplitude encoding in polylogarithmic query time, we present two improvements within the same architecture-aware framework. First, we remove the $U_{2\mathrm{CR}}$ subroutine by classically precomputing the rotation angles determined by the segment tree and storing these angles directly in the BBQRAM cells. The tradeoff is that the classically loaded QRAM stores precomputed fixed-point angles rather than raw subtree weights. Second, we extend the construction to complex-valued matrices $A \in \mathbb{C}^{M \times N}$ by storing a leaf phase alongside each precomputed rotation angle and using a two-step magnitude-then-phase procedure; the real signed case is naturally subsumed as a one-bit phase specialization. At unchanged $\mathcal{O}(\log_2^2(MN))$ BBQRAM query complexity, the QPU procedure reduces to BBQRAM retrievals and controlled-rotation cascades, with $\mathcal{O}(MN)$ memory cells per matrix and no reversible arithmetic on the QPU.

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 manuscript extends the authors' prior BBQRAM-plus-segment-tree framework for amplitude encoding by classically precomputing fixed-point rotation angles (and leaf phases for the complex case), storing them directly in BBQRAM cells, and replacing the U_{2CR} subroutine with a two-step magnitude-then-phase retrieval-plus-controlled-rotation cascade. The central claim is that this yields complex-valued state preparation for arbitrary A in C^{M x N} at unchanged O(log_2^2(MN)) BBQRAM query complexity, O(MN) memory cells, and with no reversible arithmetic required on the QPU.

Significance. If the fixed-point precision and error-propagation claims hold, the result would meaningfully simplify quantum state preparation for complex data in QML, linear algebra, and finance by moving all arithmetic to classical precomputation while preserving the polylog query cost; the architecture-aware reduction to retrievals and rotations is a concrete practical advance over prior reversible-arithmetic approaches.

major comments (2)
  1. [Abstract and §3] Abstract and §3 (construction): the claim of unchanged O(log_2^2(MN)) BBQRAM query complexity after storing precomputed fixed-point angles assumes that the required bit-width per angle/phase remains O(1) or polyloglog(MN,1/ε) and does not increase cascade depth or introduce extra retrievals; no explicit bound or bit-width analysis is supplied to confirm this for arbitrary target precision ε and arbitrary complex matrices.
  2. [Abstract and §4] Abstract and §4 (complex extension): the two-step magnitude-then-phase procedure for complex matrices lacks a concrete error-propagation analysis showing that truncation or rounding errors in the precomputed angles do not accumulate across the binary segment tree beyond the target accuracy; this is load-bearing for the assertion that the procedure remains efficient without additional QPU arithmetic.
minor comments (2)
  1. [§2] Notation for the segment-tree angles and leaf phases should be introduced with explicit fixed-point representation (e.g., number of bits) in the first use, rather than only in the complexity discussion.
  2. [Introduction] The reference to berti2025efficient should be expanded with full bibliographic details and a one-sentence summary of which subroutines are removed versus extended.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and valuable feedback on our manuscript. We address each major comment below in detail. We agree that explicit analyses of bit-width requirements and error propagation are needed to fully support the complexity and accuracy claims, and we will incorporate these in the revised version.

read point-by-point responses

  1. Referee: [Abstract and §3] Abstract and §3 (construction): the claim of unchanged O(log_2^2(MN)) BBQRAM query complexity after storing precomputed fixed-point angles assumes that the required bit-width per angle/phase remains O(1) or polyloglog(MN,1/ε) and does not increase cascade depth or introduce extra retrievals; no explicit bound or bit-width analysis is supplied to confirm this for arbitrary target precision ε and arbitrary complex matrices.

    Authors: We thank the referee for this precise observation. The stated O(log₂²(MN)) complexity refers exclusively to the number of BBQRAM queries, which equals the number of segment-tree nodes accessed during the traversal and is independent of the fixed-point bit-width. Each BBQRAM cell stores the complete precomputed angle (or phase), so a single query per node retrieves the full value irrespective of bit-width; no additional retrievals are introduced. The bit-width b affects only the gate depth of the subsequent controlled-rotation implementation (scaling linearly with b) and the total QRAM memory size. For arbitrary target precision ε we will add, in the revised §3, an explicit bound b = Θ(log(1/ε) + log log(MN)) together with the resulting overall gate complexity O(log²(MN) · log(1/ε)). This preserves the query complexity while making the dependence on ε transparent. revision: yes

  2. Referee: [Abstract and §4] Abstract and §4 (complex extension): the two-step magnitude-then-phase procedure for complex matrices lacks a concrete error-propagation analysis showing that truncation or rounding errors in the precomputed angles do not accumulate across the binary segment tree beyond the target accuracy; this is load-bearing for the assertion that the procedure remains efficient without additional QPU arithmetic.

    Authors: We agree that a rigorous error-propagation analysis is required. In the revised manuscript we will insert, in §4, a dedicated error analysis. Because all angles and phases are precomputed classically to b-bit fixed-point precision (with b chosen as above), the only operations performed on the QPU are exact (within that precision) controlled rotations. We will bound the accumulation by noting that the segment tree has depth O(log(MN)) and that each rotation error contributes an additive amplitude error of O(2^{-b}). Standard telescoping arguments for successive controlled rotations then show that the total state-preparation error remains O(ε) when b = Θ(log(1/ε) + log log(MN)). Consequently, no reversible arithmetic or extra QPU operations beyond the retrieval-plus-rotation cascade are needed, confirming the efficiency claim. revision: yes

Circularity Check

0 steps flagged

No circularity: construction describes explicit procedural changes without reduction to inputs or self-cited uniqueness

full rationale

The paper describes a quantum circuit construction that removes a subroutine via classical precomputation of fixed-point angles/phases stored in BBQRAM cells and extends it to complex values via a two-step magnitude-then-phase procedure. The claimed O(log₂²(MN)) query complexity with only retrievals and controlled-rotation cascades follows directly from this design choice and the base BBQRAM properties; no equation or result is shown to equal its own inputs by construction, no parameter is fitted then renamed as a prediction, and the self-citation supplies only the starting architecture rather than a load-bearing uniqueness theorem or ansatz that forces the outcome. The derivation chain is therefore self-contained as an engineering extension.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The construction inherits the segment-tree and BBQRAM architecture from the cited prior paper; no new free parameters, invented entities, or ad-hoc axioms are introduced in the abstract itself.

axioms (2)
  • domain assumption The segment-tree structure and BBQRAM cell addressing from the cited 2025 framework remain valid when angles replace subtree weights.
    Invoked by the statement that the improvements operate 'within the same architecture-aware framework'.
  • domain assumption Fixed-point representation of rotation angles and leaf phases can be stored and retrieved without loss of the polylog query complexity.
    Implicit in the claim that the QPU procedure reduces to retrievals and controlled rotations at unchanged complexity.

pith-pipeline@v0.9.0 · 5534 in / 1559 out tokens · 61542 ms · 2026-05-07T16:42:01.258728+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

51 extracted references · 25 canonical work pages · 2 internal anchors

  1. [1]

    Efficient Quantum State Preparation with Bucket Brigade QRAM

    A. Berti and F. Ghisoni, “Efficient quantum state preparation with bucket brigade qram,”arXiv preprint arXiv:2510.16149, 2025

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  2. [2]

    Practicality of quantum random access memory,

    C. T. Hann, “Practicality of quantum random access memory,” Ph.D. dissertation, Yale University, 2021

    2021

  3. [3]

    The quantumalgorithms. org project,

    A. Luongo, A. Bellanteet al., “The quantumalgorithms. org project,” inIEEE, International Conference on Quantum Computing and Engi- neering, QCE 2021, Workshop: Developing Effective Methodologies to Teach Quantum Information Science to Early-Stage Learners, 2021

    2021

  4. [4]

    Prakash,Quantum algorithms for linear algebra and machine learn- ing

    A. Prakash,Quantum algorithms for linear algebra and machine learn- ing. University of California, Berkeley, 2014

    2014

  5. [5]

    Quantum machine learning,

    J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, “Quantum machine learning,”Nature, vol. 549, no. 7671, pp. 195–202, 2017

    2017

  6. [6]

    Quantum support vector machine for big data classification,

    P. Rebentrost, M. Mohseni, and S. Lloyd, “Quantum support vector machine for big data classification,”Physical Review Letters, vol. 113, no. 13, Sep. 2014. [Online]. Available: http://dx.doi.org/10.1103/ PhysRevLett.113.130503

    2014

  7. [7]

    Quantum gradient descent for linear systems and least squares,

    I. Kerenidis and A. Prakash, “Quantum gradient descent for linear systems and least squares,”Physical Review A, vol. 101, no. 2, p. 022316, 2020

    2020

  8. [8]

    Quantum algorithm for data fitting,

    N. Wiebe, D. Braun, and S. Lloyd, “Quantum algorithm for data fitting,”Physical Review Letters, vol. 109, no. 5, Aug. 2012. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.109.050505

    work page doi:10.1103/physrevlett.109.050505 2012

  9. [9]

    Quantum algorithm for solving linear systems of equations,

    S. Lloyd, “Quantum algorithm for solving linear systems of equations,” inAPS March Meeting Abstracts, vol. 2010, 2010, pp. D4–002

    2010

  10. [10]

    Quantum linear system algorithm for dense matrices,

    L. Wossnig, Z. Zhao, and A. Prakash, “Quantum linear system algorithm for dense matrices,”Physical Review Letters, vol. 120, no. 5, Jan. 2018. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.120.050502

    work page doi:10.1103/physrevlett.120.050502 2018

  11. [11]

    Quantum subroutine for efficient matrix multiplication,

    A. Bernasconi, A. Berti, G. M. d. Corso, and A. Poggiali, “Quantum subroutine for efficient matrix multiplication,”IEEE Access, vol. 12, pp. 116 274–116 284, 2024

    2024

  12. [12]

    Quantum linear algebra is all you need for Transformer architectures

    N. Guo, Z. Yu, M. Choi, A. Agrawal, K. Nakaji, A. Aspuru- Guzik, and P. Rebentrost, “Quantum linear algebra is all you need for transformer architectures,” 2024. [Online]. Available: https: //arxiv.org/abs/2402.16714

    work page arXiv 2024

  13. [13]

    Quantum computational finance: martingale asset pricing for incomplete markets,

    P. Rebentrost, A. Luongo, S. Bosch, and S. Lloyd, “Quantum computational finance: martingale asset pricing for incomplete markets,” 2022. [Online]. Available: https://arxiv.org/abs/2209.08867

    work page arXiv 2022

  14. [14]

    Quantum algorithm for stochastic optimal stopping problems with applications in finance

    J. F. Doriguello, A. Luongo, J. Bao, P. Rebentrost, and M. Santha, “Quantum algorithm for stochastic optimal stopping problems with applications in finance.” Schloss Dagstuhl – Leibniz-Zentrum f ¨ur Informatik, 2022. [Online]. Available: https://drops.dagstuhl.de/entities/ document/10.4230/LIPIcs.TQC.2022.2

    work page doi:10.4230/lipics.tqc.2022.2 2022

  15. [15]

    Encoding electronic spectra in quantum circuits with linear t complexity,

    R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, “Encoding electronic spectra in quantum circuits with linear t complexity,”Physical Review X, vol. 8, no. 4, Oct

  16. [16]

    Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven

    [Online]. Available: http://dx.doi.org/10.1103/PhysRevX.8.041015

    work page doi:10.1103/physrevx.8.041015

  17. [17]

    Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization,

    D. W. Berry, C. Gidney, M. Motta, J. R. McClean, and R. Babbush, “Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization,”Quantum, vol. 3, p. 208, Dec. 2019. [Online]. Available: http://dx.doi.org/10.22331/q-2019-12-02-208

    work page doi:10.22331/q-2019-12-02-208 2019

  18. [18]

    Initial state preparation for quantum chemistry on quantum computers,

    S. Fomichev, K. Hejazi, M. S. Zini, M. Kiser, J. Fraxanet, P. A. M. Casares, A. Delgado, J. Huh, A.-C. V oigt, J. E. Muelleret al., “Initial state preparation for quantum chemistry on quantum computers,”PRX Quantum, vol. 5, no. 4, p. 040339, 2024

    2024

  19. [19]

    Quantum random access memory,

    V . Giovannetti, S. Lloyd, and L. Maccone, “Quantum random access memory,”Physical review letters, vol. 100, no. 16, p. 160501, 2008

    2008

  20. [20]

    Architectures for a quantum random access memory,

    S. Giovannetti, Vittorio Lloyd and L. Maccone, “Architectures for a quantum random access memory,”Physical Review A—Atomic, Molec- ular, and Optical Physics, vol. 78, no. 5, p. 052310, 2008

    2008

  21. [21]

    T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,Introduction to algorithms. MIT press, 2022

    2022

  22. [22]

    Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints,

    Y . Chen and R. de Wolf, “Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints,” in50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), ser. Leibniz International Proceedings in Informatics (LIPIcs), K. Etessami, U. Feige, and G. Puppis, Eds., vol

    2023

  23. [23]

    38:1–38:21

    Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum f¨ur Informatik, 2023, pp. 38:1–38:21. [Online]. Available: https: //drops.dagstuhl.de/opus/volltexte/2023/18090

    2023

  24. [24]

    Transformation of quantum states using uniformly controlled rotations,

    M. M ¨ott¨onen, J. J. Vartiainen, V . Bergholm, and M. M. Salomaa, “Transformation of quantum states using uniformly controlled rotations,” Quantum Information & Computation, vol. 5, no. 6, pp. 467–473, 2005

    2005

  25. [25]

    Quantum Recommendation Systems

    I. Kerenidis and A. Prakash, “Quantum Recommendation Systems,” in8th Innovations in Theoretical Computer Science Conference (ITCS 2017), ser. Leibniz International Proceedings in Informatics (LIPIcs), C. H. Papadimitriou, Ed., vol. 67. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum f ¨ur Informatik, 2017, pp. 49:1– 49:21. [Online]. Available: https...

    work page doi:10.4230/lipics.itcs.2017.49 2017

  26. [26]

    Toward optimal circuit size for sparse quantum state preparation,

    R. Mao, G. Tian, and X. Sun, “Toward optimal circuit size for sparse quantum state preparation,”Phys. Rev. A, vol. 110, p. 032439, Sep

  27. [27]

    & DiVincenzo, D

    [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA. 110.032439

    work page doi:10.1103/physreva

  28. [28]

    Circuit implementation of bucket brigade qram for quantum state preparation,

    P. A. M. Casares, “Circuit implementation of bucket brigade qram for quantum state preparation,” 2020. [Online]. Available: https://arxiv.org/abs/2006.11761

    work page arXiv 2020

  29. [29]

    Robust and optimal loading of general classical data into quantum computers,

    X.-M. Zhang, “Robust and optimal loading of general classical data into quantum computers,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, p. 1–1, 2025. [Online]. Available: http://dx.doi.org/10.1109/TCAD.2025.3600368

    work page doi:10.1109/tcad.2025.3600368 2025

  30. [30]

    Quantum resources required to block-encode a matrix of classical data,

    B. D. Clader, A. M. Dalzell, N. Stamatopoulos, G. Salton, M. Berta, and W. J. Zeng, “Quantum resources required to block-encode a matrix of classical data,”IEEE Transactions on Quantum Engineering, vol. 3, p. 1–23, 2022. [Online]. Available: http://dx.doi.org/10.1109/TQE.2022.3231194

    work page doi:10.1109/tqe.2022.3231194 2022

  31. [31]

    Quantum state preparation with optimal circuit depth: Implementa- tions and applications.Phys

    X.-M. Zhang, T. Li, and X. Yuan, “Quantum state preparation with optimal circuit depth: Implementations and applications,”Phys. Rev. Lett., vol. 129, p. 230504, Nov 2022. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.129.230504

    work page doi:10.1103/physrevlett.129.230504 2022

  32. [32]

    QRAM: A Survey and Critique,

    S. Jaques and A. G. Rattew, “QRAM: A Survey and Critique,” Quantum, vol. 9, p. 1922, Dec. 2025. [Online]. Available: https: //doi.org/10.22331/q-2025-12-02-1922

    work page doi:10.22331/q-2025-12-02-1922 1922

  33. [33]

    Creating superpositions that correspond to efficiently integrable probability distributions

    L. Grover and T. Rudolph, “Creating superpositions that correspond to efficiently integrable probability distributions,” 2002. [Online]. Available: https://arxiv.org/abs/quant-ph/0208112

    work page Pith review arXiv 2002

  34. [34]

    Variational quantum algorithms,

    M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, “Variational quantum algorithms,”Nature Reviews Physics, vol. 3, no. 9, pp. 625–644, 2021

    2021

  35. [35]

    Variational compression of circuits for state preparation,

    A. Berti, G. Antonioli, A. Bernasconi, G. M. Del Corso, R. Guidotti, and A. Poggiali, “Variational compression of circuits for state preparation,” in2024 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 2. IEEE, 2024, pp. 44–48

    2024

  36. [36]

    Variational quantum state preparation for quantum-enhanced metrology in noisy systems,

    J. C. Zu ˜niga Castro, J. Larson, S. H. K. Narayanan, V . E. Colussi, M. A. Perlin, and R. J. Lewis-Swan, “Variational quantum state preparation for quantum-enhanced metrology in noisy systems,” Phys. Rev. A, vol. 110, p. 052615, Nov 2024. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.110.052615

    work page doi:10.1103/physreva.110.052615 2024

  37. [37]

    M. A. Nielsen and I. L. Chuang,Quantum computation and quantum information. Cambridge university press, 2010

    2010

  38. [38]

    Resilience of quantum random access memory to generic noise,

    C. T. Hann, G. Lee, S. Girvin, and L. Jiang, “Resilience of quantum random access memory to generic noise,”Prx Quantum, 2021

    2021

  39. [39]

    Systems architecture for quantum random access memory,

    S. Xu, C. T. Hann, B. Foxman, S. M. Girvin, and Y . Ding, “Systems architecture for quantum random access memory,” inProceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture, 2023, pp. 526–538

    2023

  40. [40]

    De Berg, O

    M. De Berg, O. Cheong, M. Van Kreveld, and M. Overmars,Computa- tional geometry: algorithms and applications. Springer, 2008

    2008

  41. [41]

    Hardware-efficient quantum random access memory with hybrid quantum acoustic systems,

    C. T. Hann, C.-L. Zou, Y . Zhang, Y . Chu, R. J. Schoelkopf, S. Girvin, and L. Jiang, “Hardware-efficient quantum random access memory with hybrid quantum acoustic systems,”Physical Review Letters, vol. 123, no. 25, Dec. 2019. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.123.250501

    work page doi:10.1103/physrevlett.123.250501 2019

  42. [42]

    A logarithmic- depth quantum carry-lookahead adder,

    T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore, “A logarithmic- depth quantum carry-lookahead adder,”Quantum Info. Comput., vol. 6, no. 4, p. 351–369, Jul. 2006

    2006

  43. [43]

    Black-box quantum state preparation without arithmetic,

    Y . R. Sanders, G. H. Low, A. Scherer, and D. W. Berry, “Black-box quantum state preparation without arithmetic,”Physical Review Letters, vol. 122, no. 2, Jan. 2019. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.122.020502

    work page doi:10.1103/physrevlett.122.020502 2019

  44. [44]

    Fast and error-correctable quantum ram,

    F. Cesa, H. Bernien, and H. Pichler, “Fast and error-correctable quantum ram,” 2025. [Online]. Available: https://arxiv.org/abs/2503.19172

    work page arXiv 2025

  45. [45]

    A distillation- teleportation protocol for fault-tolerant qram,

    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. [Online]. Available: https://arxiv.org/abs/2505.20265

    work page arXiv 2025

  46. [46]

    Quantum random access memory with transmon-controlled phonon routing,

    Z. Wang, H. Qiao, A. N. Cleland, and L. Jiang, “Quantum random access memory with transmon-controlled phonon routing,”Physical Review Letters, vol. 134, no. 21, May 2025. [Online]. Available: http://dx.doi.org/10.1103/PhysRevLett.134.210601

    work page doi:10.1103/physrevlett.134.210601 2025

  47. [47]

    Quantum random access memory architectures using 3d superconducting cavities,

    D. Weiss, S. Puri, and S. Girvin, “Quantum random access memory architectures using 3d superconducting cavities,”PRX Quantum, vol. 5, p. 020312, Apr 2024. [Online]. Available: https://link.aps.org/doi/10.1103/PRXQuantum.5.020312

    work page doi:10.1103/prxquantum.5.020312 2024

  48. [48]

    Scalable and high-fidelity quantum random access memory in spin- photon networks,

    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, vol. 2, p. 030319, Aug 2021. [Online]. Available: https://link.aps.org/doi/10.1103/PRXQuantum.2.030319

    work page doi:10.1103/prxquantum.2.030319 2021

  49. [49]

    A resource-efficient quantum-walker Quantum RAM

    G. D. Riso, G. Catalano, S. Lloyd, V . Giovannetti, and D. D. Santis, “A resource-efficient quantum-walker quantum ram,” 2025. [Online]. Available: https://arxiv.org/abs/2508.02855

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  50. [50]

    Block-encoding structured matrices for data input in quantum computing,

    C. S ¨underhauf, E. Campbell, and J. Camps, “Block-encoding structured matrices for data input in quantum computing,”Quantum, vol. 8, p. 1226, 2024

    2024

  51. [51]

    Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics,

    A. Gily ´en, Y . Su, G. H. Low, and N. Wiebe, “Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics,” inProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, pp. 193–204

    2019