Pith. sign in

REVIEW 3 major objections 6 minor 2 cited by

Analysis and Suppression of Errors in Quantum Random Access Memory under Extended Noise Models

T0 review · 3 major / 6 minor · reviewed 2026-08-11 · deepseek-v4-flash

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

Pith's one-line read This paper proves bucket-brigade QRAM keeps polylogarithmic error growth under arbitrary router initialization, spatially correlated noise, and coherent errors, with a twirling protocol that restores the tighter quadratic scaling.

desk verdict Solid extensions of QRAM noise-resilience, but the coherent-noise theorem has a proof gap that must be fixed. read the letter →

arxiv 2412.10318 v2 pith:LDAF7TNY submitted 2024-12-13 quant-ph

Rohan Mehta , Gideon Lee , Liang Jiang This is my paper · ORCID
classification quant-ph
keywords bucket-brigadeQRAMnoiseresiliencecoherenterrorsquantumrandomaccessmemoryPaulitwirlinginitializationcorrelatedqueryfidelity
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Quantum random access memory in the bucket-brigade architecture routes a query through a binary tree of small quantum routers, and earlier work showed that when errors hit individual routers, the query infidelity grows only polylogarithmically with memory size. This paper tries to establish that this resilience is not an accident of a narrow noise model: it survives arbitrary router initialization, spatially correlated noise over router clusters, and coherent (unitary) errors, with infidelity still polylogarithmic in all three cases. The price of coherent errors is a quadratic worsening of the bound, from roughly $O(n^2)$ to $O(n^4)$. The paper also proposes a delayed Pauli twirling scheme that exploits the query circuit’s compute–uncompute symmetry to turn coherent errors into stochastic Pauli noise and restore the $O(n^2)$ scaling. If right, these results mean QRAM hardware need not include per-router reset or measurement, simplifying near-term architectures.

What carries the argument

The central object is the mutually coherent subspace $V'_\chi$ of address states that remain both successful and mutually coherent for a given error configuration $\chi$; the proof shows the noisy channel maps this subspace disjointly from its orthogonal complement, forcing the reduced output state to be rank one on that block (the analogue of Eq. 17). Two further mechanisms carry the argument: the time-reversal symmetry $V_t = V_{\tau-t}$ of the query circuit, which lets a twirling correction applied at time $t$ be delayed to its conjugate partner at time $\tau-t$, and a coarse-graining map that turns a connected cluster of corrupted routers into a single local error on a coarser tree, which is how correlated noise is handled.

What would settle it

Simulate or measure a two-level bucket-brigade QRAM with routers initialized to $\left|+\right\rangle^{\otimes N}$, no resets between queries, and per-router coherent rotations $e^{i\kappa Z}$ for fixed small $\kappa$; the paper predicts $1-F$ scales as $O(n^4)$, so observing exponential or super-polynomial growth in $n$ would falsify the resilience claim. Including comparable noise on the address and bus qubits should make the stated bounds fail, since the theorems do not cover it.

Watch

Extended reading notes

Core claim

On the paper’s own terms, the bucket-brigade QRAM’s natural noise resilience, previously proved for local incoherent single-router noise, extends to three practically important classes of error. Theorem 4 and Corollary 4.1 show that even when routers are initialized to an arbitrary state, possibly mixed and of any dimension, a two-level QRAM using the doubled query circuit $Q' = Q\,\mathrm{CX}_{B,B'}\,Q$ obeys $1-F \le 4\varepsilon(\tau+1)(n+1)^2$, so resetting the tree between queries is unnecessary. Section III B shows that quasi-local spatially correlated errors preserve the polylogarithmic scaling after a coarse-graining of the tree, with only an $L$-dependent rescaling of the error rate. Theorem 6 generalizes the bound to arbitrary single-router noise, including coherent errors, giving $1-F \le A\varepsilon(\tau+1)^2(n+1)^2 \in O(n^4)$. Section IV’s delayed twirling protocol then tailors coherent noise to stochastic Pauli noise by using the circuit’s time-reversal symmetry, restoring $O(n^2)$ infidelity scaling.

Load-bearing premise

The central bounds assume that the address and bus qubits are noiseless throughout the circuit, so the polylogarithmic resilience is proven only for errors on the router qutrits; comparable noise on the address or bus registers would add an extra contribution not bounded by these theorems.

Editorial extensions

If this is right

  • A QRAM can be queried repeatedly without resetting or measuring the router tree between queries; Corollary 4.1 says any qudit initialization, mixed or pure, retains the same polylog bound, removing a major hardware requirement.
  • Spatially correlated noise that is quasi-local, meaning supported on connected clusters of bounded size $L$, only rescales the effective error rate, so crosstalk and miscalibrated multi-router gates do not break the architecture’s resilience unless the correlations are long-range.
  • Coherent errors are the least favorable of the extended classes: they raise the infidelity bound from $O(n^2)$ to $O(n^4)$, so unitary error buildup must be tracked separately from stochastic noise.
  • The delayed twirling protocol converts coherent errors into stochastic Pauli channels and restores $O(n^2)$ scaling, or $O(n^3)$ when classical memory reshuffling replaces SWAP corrections, making the tighter bound available without full error correction.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A direct experimental test is to operate a two-level QRAM with routers left in random states and compare query fidelity with and without a reset step; the paper predicts no reset penalty at polylog order, a claim measurable on small devices.
  • If reset-free operation works, the dominant remaining error source will be address- and bus-register noise, which this paper explicitly brackets; extending the proof to those registers is the natural next step for the architecture.
  • The delayed-twirling idea should transfer to any circuit with compute–uncompute symmetry and non-Clifford gates, offering a route to randomized compiling beyond the Pauli-Clifford setting.
  • The $n^2 \to n^4$ coherent-error penalty implies that QRAM error budgets in fault-tolerant designs should either twirl or otherwise decorrelate unitary errors before allocating error-correction overhead.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 6 minor

Summary. The paper studies the bucket-brigade QRAM under generalized noise models. It claims: (i) arbitrary initialization of the routing tree does not destroy polylogarithmic infidelity scaling, with a query-doubling protocol making reset protocols unnecessary (Theorem 4, Corollary 4.1); (ii) spatially correlated quasi-local noise preserves polylogarithmic scaling via a cluster expansion and coarse graining (Section III B); (iii) arbitrary single-router coherent noise yields an O(n^4) infidelity bound (Theorem 6); and (iv) a delayed Pauli twirling scheme restores O(n^2) scaling (Theorem 7). The paper also reviews the bucket-brigade architecture and the prior Hann et al. result, and discusses the implications for reset-free and twirled QRAM designs.

Significance. If the theorems are correct, the paper meaningfully extends the known noise resilience of bucket-brigade QRAM: it supports reset-free operation, robustness to crosstalk-like correlated errors, and a concrete twirling scheme that exploits the compute-uncompute symmetry. The structural observations about branch-permutation symmetry and wait-state confinement are valuable and go beyond a simple restatement of [10]. The paper also gives credit where due by building on a published external benchmark rather than circularly reducing to its own assumptions. However, the proof of the coherent-noise extension is incomplete, and the correlated-noise and twirling results are only sketched; the central claims therefore need additional rigorous support before the paper can be accepted.

major comments (3)
  1. [Section III C, Eqs. (54)-(55)] The proof of Theorem 6 is not valid as written. Equation (54) has the wrong inequality direction: for K0 = exp(iκZ) with small real κ, Definition 2 gives ε = 1 - cos²κ ≈ κ², while min_ψ |Re⟨K0^{⊗n}⟩| = |cos κ|^n ≈ 1 - nκ²/2. For n=2 and κ=0.1 this gives LHS ≈ 0.995 and RHS ≈ 0.04, so the printed inequality cannot hold. The intended statement is presumably a lower bound of the form min_ψ |Re⟨K0^{⊗n}⟩| ≥ 1 - O(n²ε), but even with that correction the inference to Eq. (55) is not derived. The non-Hermitian part V0 introduces phase correlations across routers and time steps that are absent in the Hermitian-K0 proof of Theorem 2 in [10], so the statement 'the rest of the proof of Theorem 2 follows' is not a substitute for a derivation. Footnote [30] itself notes that the non-Hermitian case in [10] required ε to scale inversely with n; Theorem 6 claims to overcome this, and the proof must show explicitly why that restriction is removed. Because Theorem 6 is the basis for the coherent-noise O(n^4) claim and for the motivation of Section IV, this gap is load-bearing.
  2. [Section III B, Eqs. (43)-(47)] The cluster expansion for correlated noise is an uncontrolled approximation. The text states that 'to order O(ε²), we can commute the noise channels' and then uses the resulting ordering in Eq. (45), but no bound on the commutator remainder is provided. Similarly, Eq. (46) asserts additivity of infidelities across coarse-grained trees without a proof, and Eq. (48) defines ε_d with an ambiguous summation index ('Et' is not defined). Since the polylogarithmic scaling for spatially correlated errors is one of the paper's headline results, these steps need to be turned into a rigorous inequality or explicitly identified as a conjecture.
  3. [Section IV B, Theorem 7] Theorem 7 is stated without a proof. The paragraphs around Algorithm 1 and the discussion of nested twirls give a plausible mechanism, but they do not demonstrate that the delayed twirling operators, which must be correlated between the two queries to avoid extra copying, produce a Pauli channel with the claimed constants, nor that the in-situ SWAP corrections or classical memory reshuffling do not introduce un-twirled errors at a level that alters the scaling. Equations (61) and (62) are therefore unsupported. As the main suppression result, this requires a detailed derivation.
minor comments (6)
  1. [Section II, Eq. (24)] The displayed equality E_χ[|⟨ψout|Π(Vχ)|ψout⟩|²] = E_χ[∥Π(Vχ)|ψout⟩∥] is dimensionally inconsistent; it should presumably involve ∥Π(Vχ)|ψout⟩∥² or an equivalent expression.
  2. [Section IV A, around Eq. (59)] Eq. (59) is an empty numbered display; please remove the placeholder or fill in the intended statement.
  3. [Table I] The column headings and row entries are confusing, e.g., 'Two-level Yes No No O(n^6)' and 'Either No No Yes O(n^6)'; please define all combinations and explain how the entries follow from the theorems.
  4. [Section IV B, Algorithm 1] The notation 'T ∈ P2 and M = CXP†CX ∈ P2' is not defined; please spell out P2 and the action of CX.
  5. [Section III B, Eq. (48)] The summation over 'Et' should be over time steps and/or error clusters; please make the index explicit.
  6. [Section III A, proof of Theorem 4] The phrase 'under mixed-unitary noise, so does the infidelity' is not defined; the theorem itself is stated for Bernoulli noise, so this sentence should be clarified.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: new bounds are derived from an external published base theorem and explicit calculations; the coherent-noise proof gap is a correctness issue, not circularity.

full rationale

The derivation chain for the new claims is self-contained: Theorem 4 (arbitrary initialization), the correlated-noise analysis of Section III B, Theorem 6 (coherent noise), and Theorem 7 (delayed twirling) are each argued from the previously published bucket-brigade robustness theorem (Theorem 2, attributed to Hann et al., PRX Quantum 2, 020311 (2021)) together with explicit calculations in this paper. Although two of the present authors overlap with the authors of [10], Theorem 2 is an external, published, parameter-free result with stated assumptions that do not include the target results of this paper; it is therefore independent support rather than an unverified self-citation chain. Definition 2's error rate is not the same object as the query infidelity: the polylogarithmic bound is a nontrivial statement about error accumulation across exponentially many routers and O(n) depth, not a relabeling of the definition. No fitted parameter is renamed as a prediction, and no known empirical pattern is merely re-expressed in new coordinates. The main caveat is in the coherent-noise proof: Eq. (54) appears to have a mistyped inequality direction, and the transition to Eq. (55), followed by 'the rest of the proof of Theorem 2 follows,' is asserted rather than derived. That is an omitted or flawed proof step—a correctness risk—not a circular reduction; the hard rules require exhibiting an equivalence to inputs by construction, which is not present here. Footnote [30] also explicitly flags the definitional scaling issue for non-Hermitian K0 and states the intended restoration, which is a declared limitation rather than a hidden circular assumption. Accordingly, the circularity score is 0.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central bounds rely on the router-only noise model, the principal-Kraus error-rate definition, quasi-locality of correlated noise, and noiseless twirling gates. No data are fitted; all parameters are model inputs. No new physical entities are postulated; query doubling, delayed twirling, and memory reshuffle are procedures, not entities.

assumptions (5)
  • domain assumption Errors on address and bus registers are absent throughout the query circuit.
    Stated in Section II: 'We assume the address and bus registers to be noiseless throughout the circuit, though we will revisit this assumption in Section V.' The fidelity bounds apply only to noise on router qutrits.
  • domain assumption The error rate epsilon of a router channel is captured by the principal Kraus operator K0, and the channel's Choi spectrum is dominated by K0.
    Definition 2 defines epsilon via min over Kraus representations of max_psi (1 - |Re<K0>_psi|^2), and the text assumes the Choi spectrum is dominated by K0. The proofs of Theorems 1, 2, and 6 rely on this error-rate definition.
  • domain assumption For correlated noise, error channels are quasi-local and supported on connected subgraphs of size less than L.
    Definition 4 defines quasi-local errors on connected subgraphs; the cluster expansion in Eq (43) assumes this locality. The bounds in Section III.B depend on L.
  • domain assumption The twirling and correction gates in the proposed protocol are noiseless or 'easy', meaning implementable with much lower error than the routing gates.
    Definition 6 states U and M are assumed noiseless, later relaxed to 'easy' gates. The delayed twirling protocol in Section IV.B relies on this to claim no additional noise scaling.
  • ad hoc to paper To order O(epsilon^2), noise channels in the cluster expansion can be commuted and grouped by coarse-graining.
    Section III.B states 'To order O(epsilon^2), we can commute the noise channels in (43) and order them...' This is an approximation introduced to make the product form (45) valid; it is not generally true for non-commuting channels.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Analysis and Suppression of Errors in Quantum Random Access Memory under Extended Noise Models." pith.science (2026). https://pith.science/paper/LDAF7TNY

@misc{pith2026241210318,
  author       = {Pith},
  title        = {Pith review of: Analysis and Suppression of Errors in Quantum Random Access Memory under Extended Noise Models},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LDAF7TNY}},
  note         = {Machine review of arXiv:2412.10318}
}
read the original abstract

Quantum random access memory (QRAM) is required for numerous quantum algorithms and network architectures. Previous work has shown that the ubiquitous bucket-brigade QRAM is highly resilient to arbitrary local incoherent noise channels occurring during the operation of the QRAM [PRX Quantum 2, 020311 (2021)], with query infidelities growing only polylogarithmically with memory width when errors are assumed to only occur on individual routers. We extend this result to a large class of generalized settings that arise in realistic situations, including arbitrary initialization errors, spatially correlated errors, as well as coherent errors, maintaining the polylogarithmic scaling in all instances. Fully quantifying the extent to which QRAM's noise resilience holds may provide a guide for the design of QRAM architectures - for instance, the resilience to initialization errors indicates that a reset protocol between successive queries may not be necessary. In the case of coherent errors, we find an up-to-quadratic increase in the infidelity bound, and therefore discuss generalizations to randomized compiling schemes, which usually are rendered inapplicable in the QRAM setting, to tailor these errors into more favorable stochastic noise.

Figures

Figures reproduced from arXiv: 2412.10318 by the authors.

Figure 1
Figure 1. FIG. 1. Conceptual overview of the role of quantum random [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. Microscopic depiction of a quantum router. (a) A [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3. Blueprint of the bucket-brigade scheme. Circuit diagrams for the query (b), (f) are depicted alongside the hardware [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: FIG. 4. Constrained error propagation of a fault. The red [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5. Error propagation dynamics for computational basis [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: FIG. 6. The coarse grainings [PITH_FULL_IMAGE:figures/full_fig_p012_6.png]
Figure 7
Figure 7. Figure 7: FIG. 7. Delayed twirling with classical corrections. The yellow [PITH_FULL_IMAGE:figures/full_fig_p015_7.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A distillation-teleportation protocol for fault-tolerant QRAM

    quant-ph 2025-05 accept novelty 8.0 of 10

    An adaptive distillation-teleportation protocol implements a fault-tolerant QRAM query with poly(n) quantum resources and 1/poly(n) device fidelity, at the cost of an exponential classical dataset update each round.

  2. Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries

    quant-ph 2025-02 conditional novelty 7.0 of 10

    Fat-Tree QRAM pipelines up to log(N) simultaneous queries to a size-N memory in about log(N) time, using only about twice the hardware of a bucket-brigade QRAM.

Reference graph

Works this paper leans on

51 extracted references · 37 canonical work pages · cited by 2 Pith papers

  1. [10]

    For m from 1 to n, if |Pm| ∈ {X, Y}, (a) For i ∈ Fn 2 , exchange xi with xNOTm(i)

    work page

  2. [30]

    Weiss, S

    D. Weiss, S. Puri, and S. Girvin, PRX Quantum 5, 020312 (2024)

    work page 2024

  3. [1]

    We expect this not to be the case

    Error Propagation : One may be concerned that twirling mid-query around Vτ −t · · ·Vt where t > 1 may undermine the noise robustness of the arbitrarily-initialized two-level QRAM proven in Theorem 2. We expect this not to be the case. Al- though having applied a twirling operator may alter which routers are candidates to propagate errors, the twirling ope...

    work page

  4. [2]

    No Extra Copying : Returning to the second of our aforementioned criteria, since delayed twirling does not restore the tree to its initial state prior to Vx, we need to employ the query doubling protocol used for arbitrary initializations (Section III A). However, it is also imperative that our twirling scheme does not violate the effectiveness of the com...

    work page

  5. [3]

    This way, they intro- duce few, if any, additional errors

    Twirling Errors : In randomized compiling protocols to compile the twirling and correction gates into flanking layers of easy gates. This way, they intro- duce few, if any, additional errors. However, in the query circuit, these clock cycles of easy gates consist of only bit flips on the relevant control qubits. On the target modes of a controlled-SW AP, ...

    work page

  6. [4]

    Output the resulting ⃗ xas the adaptively permuted memory. FIG. 7. Delayed twirling with classical corrections. The yellow gates correspond to data copying operations, but with the memory data permuted according to Algorithm 2. The boxed product should be compiled into a single Pauli. C. Challenges with three-level twirling The predominant issue with twir...

    work page 2020

  7. [5]

    (b) We “dress” the U gates from Vt to Vτ +1−t by appending the necessary SW APs as described in the main text

    We construct a randomly twirled Qtw: (a) For each gate layer Vt of Q, we sample a ran- dom Pauli P on the support of Vt to precede Vt. (b) We “dress” the U gates from Vt to Vτ +1−t by appending the necessary SW APs as described in the main text

    work page

  8. [6]

    easy” to implement, a categorization that is experimentally motivated. The easy gates should be implementable with higher fidelity than their “hard

    Moreover, one can repeat the proofs for non-Bernoulli noise with Hermitian K0 identically to the presentation in [10] for Theorem 2, yielding the subsequent lemma. Lemma 5. In a generalized bucket-brigade model, where the QRAM architecture involves d-dimensional routers, extensions to all preceding Theorems 1, 2, 4, and 6 per- sist with the implicit repla...

    work page

Show all 51 references
  1. [7]

    edge twirling

    Obtain the twirled query unitary Q′ tw = Q† twM CXB,B′ T Qtw, (60) where T ∈ P2 and M = CXP †CX ∈ P2. We describe the twirling protocol in Algorithm 1. Each twirling map extends for a prolonged duration, rather than just conjugating one gate as in randomized com- piling. Howev...

  2. [8]

    Input: Twirling Pauli Pm for the mth address qubit, m = 1, . . . , n

  3. [9]

    Input: Classical memory vector, ⃗ x

  4. [11]

    Tang, Phys

    E. Tang, Phys. Rev. Lett. 127, 060503 (2021)

    2021

  5. [12]

    A. W. Harrow, A. Hassidim, and S. Lloyd, Phys. Rev. Lett. 103, 150502 (2009)

    2009

  6. [13]

    Sch¨ utzhold, Phys

    R. Sch¨ utzhold, Phys. Rev. A67, 062311 (2003)

    2003

  7. [14]

    K. Gui, A. M. Dalzell, A. Achille, M. Suchara, and F. T. Chong, Quantum 8, 1257 (2024)

    2024

  8. [15]

    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), arXiv:2006.11761 [quant-ph]

    2020 arXiv

  9. [16]

    Ashhab, Phys

    S. Ashhab, Phys. Rev. Res. 4, 013091 (2022)

    2022

  10. [17]

    J. Liu, C. T. Hann, and L. Jiang, Phys. Rev. A 108, 032610 (2023)

    2023

  11. [18]

    E. T. Khabiboulline, J. Borregaard, K. De Greve, and M. D. Lukin, Phys. Rev. Lett. 123, 070504 (2019)

    2019

  12. [19]

    E. T. Khabiboulline, J. Borregaard, K. De Greve, and M. D. Lukin, Phys. Rev. A 100, 022316 (2019)

    2019

  13. [20]

    C. T. Hann, G. Lee, S. Girvin, and L. Jiang, PRX Quantum 2, 020311 (2021)

    2021

  14. [21]

    O. D. Matteo, V. Gheorghiu, and M. Mosca, IEEE Trans- actions on Quantum Engineering 1, 1–13 (2020)

    2020

  15. [22]

    G. Lee, C. T. Hann, S. Puri, S. M. Girvin, and L. Jiang, Phys. Rev. Lett. 131, 190601 (2023)

    2023

  16. [23]

    Qram: A survey and cri- tique,

    S. Jaques and A. G. Rattew, “Qram: A survey and cri- tique,” (2023), arXiv:2305.10310 [quant-ph]. 17

    2023

  17. [24]

    C. T. Hann, C.-L. Zou, Y. Zhang, Y. Chu, R. J. Schoelkopf, S. M. Girvin, and L. Jiang, Phys. Rev. Lett. 123, 250501 (2019)

    2019

  18. [25]

    F.-Y. Hong, Y. Xiang, Z.-Y. Zhu, L.-z. Jiang, and L.-n. Wu, Phys. Rev. A 86, 010306 (2012)

    2012

  19. [26]

    E. S. Moiseev and S. A. Moiseev, Jour- nal of Modern Optics 63, 2081 (2016), https://doi.org/10.1080/09500340.2016.1182222

    2016

  20. [27]

    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,” (2024), arXiv:2411.00719 [quant-ph]

    2024 arXiv

  21. [28]

    Z. Wang, Y. Wu, Z. Bao, Y. Li, C. Ma, H. Wang, Y. Song, H. Zhang, and L. Duan, Phys. Rev. Appl. 15, 014049 (2021)

    2021

  22. [29]

    K. C. Chen, W. Dai, C. Errando-Herranz, S. Lloyd, and D. Englund, PRX Quantum 2, 030319 (2021)

    2021

  23. [31]

    Asaka, K

    R. Asaka, K. Sakai, and R. Yahagi, Quantum Science and Technology 6, 035004 (2021)

    2021

  24. [32]

    Giovannetti, S

    V. Giovannetti, S. Lloyd, and L. Maccone, Phys. Rev. A 78, 052310 (2008)

    2008

  25. [33]

    Giovannetti, S

    V. Giovannetti, S. Lloyd, and L. Maccone, Phys. Rev. Lett. 100, 160501 (2008)

    2008

  26. [34]

    Faulty towers: recovering a functioning quantum random access memory in the presence of defective routers,

    D. K. Weiss, S. Xu, S. Puri, Y. Ding, and S. M. Girvin, “Faulty towers: recovering a functioning quantum random access memory in the presence of defective routers,” (2024), arXiv:2411.15612 [quant-ph]

    2024 arXiv

  27. [35]

    Fat-tree qram: A high-bandwidth shared quantum random access memory for parallel queries,

    S. Xu and Y. Ding, “Fat-tree qram: A high-bandwidth shared quantum random access memory for parallel queries,” In preparation

  28. [36]

    S. Xu, C. T. Hann, B. Foxman, S. M. Girvin, and Y. Ding, in 56th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO ’23 (ACM, 2023) p. 526–538

    2023

  29. [37]

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

    2023

  30. [38]

    Error-mitigated quantum random access memory,

    W. Shi, N. K. Kundu, M. R. McKay, and R. Malaney, “Error-mitigated quantum random access memory,” (2024), arXiv:2403.06340 [quant-ph]

    2024 arXiv

  31. [39]

    J. J. Wallman and J. Emerson, Phys. Rev. A 94, 052325 (2016)

    2016

  32. [40]

    We note that in restricting K0 to be Hermitian, we are stating a weaker version of the result presented in [ 10]. As we discuss in Sec III C, for channels where K0 is not Hermitian, the definition of Equation (D5) in [ 10] im- plicitly requires that ε scales inversely with n, ...

  33. [41]

    Arunachalam, V

    S. Arunachalam, V. Gheorghiu, T. Jochym-O’Connor, M. Mosca, and P. V. Srinivasan, New Journal of Physics 17, 123010 (2015)

    2015

  34. [42]

    Cryptographic distin- guishability measures for quantum mechanical states,

    C. A. Fuchs and J. van de Graaf, “Cryptographic distin- guishability measures for quantum mechanical states,” (1998), arXiv:quant-ph/9712042 [quant-ph]

    1998 arXiv

  35. [43]

    Wallman, C

    J. Wallman, C. Granade, R. Harper, and S. T. Flammia, New Journal of Physics 17, 113020 (2015)

    2015

  36. [44]

    J. K. Iverson and J. Preskill, New J. Phys. 22, 073066 (2020)

    2020

  37. [45]

    Cai and S

    Z. Cai and S. C. Benjamin, Scientific Reports 9 (2019), 10.1038/s41598-019-46722-7

    2019 doi

  38. [46]

    Y. Kim, C. J. Wood, T. J. Yoder, S. T. Merkel, J. M. Gambetta, K. Temme, and A. Kandala, Nature Physics 19, 752 (2023)

    2023

  39. [47]

    S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V. Vuleti´ c, and M. D. Lukin, Nature 622, 268 (2023)

    2023

  40. [48]

    Pseudo twirling mitigation of coherent errors in non-clifford gates,

    J. P. Santos, B. Bar, and R. Uzdin, “Pseudo twirling mitigation of coherent errors in non-clifford gates,” (2024), arXiv:2401.09040 [quant-ph]

    2024 arXiv

  41. [49]

    Quantum Information and Computation for Chemistry (Wiley, 2014)

    2014

  42. [50]

    Over-rotation coherent error in quantum gates subjected to pseudo twirling,

    T. Pandit and R. Uzdin, “Over-rotation coherent error in quantum gates subjected to pseudo twirling,” (2024), arXiv:2407.06055 [quant-ph]

    2024

  43. [51]

    Mitsuhashi and N

    Y. Mitsuhashi and N. Yoshioka, PRX Quantum 4, 040331 (2023)

    2023

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.