Pith. sign in

REVIEW 3 major objections 5 minor 2 cited by

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

T0 review · 3 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read A defective QRAM can be repaired by rerouting around its broken routers, yielding a working memory of half size with only a handful of extra qubits.

desk verdict A genuinely useful repair scheme for faulty interior QRAM routers, with honest accounting of the assumptions; the headline resource numbers hold up under conditional acceptance. read the letter →

arxiv 2411.15612 v1 pith:ZG2GTQHR submitted 2024-11-23 quant-ph

D. K. Weiss , Shifan Xu , Shruti Puri , Yongshan Ding , S. M. Girvin This is my paper · ORCID
classification quant-ph MSC 68Q1281P68 PACS 03.67.Lx
keywords quantumrandomaccessmemoryQRAMfaultyroutersfabricationdefectsbucket-brigadearchitectureancillaflagqubitsreroutingrepairalgorithm
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 (QRAM) is a binary-tree network of routers that lets a quantum computer read classical data at addresses in superposition; a single broken router cuts off every address beneath it. This paper asks whether a chip with fabrication defects can still be used, and answers yes: if the top three routers survive and at least half of the $2^n$ addresses remain reachable, the defective $n$-bit tree can be converted into a working $(n-1)$-bit QRAM by relabelling addresses or by rerouting queries around dead routers layer by layer. The repair uses ancilla flag qubits that detect an incoming query aimed at a faulty router and flip the address qubits to redirect it to a spare working router. The headline quantitative result is that for $n=13$ and a router failure rate of $\epsilon=1\%$, the average of about 214 faulty routers on the repairable side can be handled with roughly 1.5 flag qubits. If correct, this means fabrication defects need not be fatal for solid-state QRAM: a partly failed chip can still deliver most of its intended memory with modest overhead and only polylogarithmic query slowdown.

What carries the argument

The load-bearing objects are the router-based bucket-brigade QRAM tree and the faulty-router table obtained by local quantum process tomography, which immediately implies the faulty-address table. On top of these sit three algorithmic devices: one-way-street relabelling; layer-by-layer self-repair in which the already-repaired upper QRAM routes flag qubits to detect and redirect queries aimed at faulty routers; and a generating-set construction in which each flag qubit applies one address bit-flip pattern and combinations of patterns cover all assignments, drastically reducing the ancilla count. The statistical treatment uses a Galton-Watson branching-process recursion giving the expected faulty-address count $F_n(\epsilon)=2^n(1-(1-\epsilon)^n)$ and an exact recursion for the probability that an instance is repairable.

What would settle it

Randomly generate depth-13 trees with 1% per-router failure conditioned on the top three routers being good and on at least $2^{12}$ reachable leaves, run IterativeRepair, and count flag qubits per layer; the central claim is false if a nontrivial fraction of such repairable instances fail to yield a 12-bit QRAM, or if the maximum per-layer flag-qubit count systematically exceeds $n-3$.

Watch

Extended reading notes

Core claim

The paper's central claim is that a repairable faulty QRAM—one with at least $2^{n-1}$ accessible leaves and healthy routers at the top two levels—can be turned into a functioning $(n-1)$-bit QRAM. It establishes this constructively with two algorithms. RelabelRepair treats some routers as one-way streets and relabels surviving addresses as the addresses of a reduced QRAM; when that fails, IterativeRepair grows the working QRAM one layer at a time: at each layer it classically assigns each faulty router on the repairable side to an available router on the spare side, then uses the already-working smaller QRAM to activate ancilla flag qubits that encode the required rerouting, unloads the address qubits, applies the corresponding CNOTs, and reloads them one layer deeper before uncomputing. The flag qubits are reused across layers. A greedy classical algorithm, FlagQubitMinimization, chooses which address bit-flip pattern each flag qubit encodes so that the fewest generating patterns cover all needed reroutings; simulation shows about 1.5 flag qubits suffice on average for the depth-13, 1%-defect case, versus 13 for the naive mask technique.

Load-bearing premise

The whole procedure starts only if the top three routers (a functioning 2-bit QRAM) are defect-free and at least half the addresses remain reachable; if a router among the top levels is dead, the recursive repair cannot get off the ground.

Editorial extensions

If this is right

  • A fabricated QRAM with a few percent router loss need not be discarded; it can be commissioned as a next-smaller memory with all of its addresses working.
  • The per-query time of the repaired memory grows from $\mathcal{O}(n)$ to $\mathcal{O}(n^2)$, which is still polylogarithmic in the memory size $N=2^n$.
  • The flag-qubit cost is far below the naive one-flag-per-address-qubit count: for $\epsilon=1\%$ and $n=13$, about 1.5 flag qubits on average instead of 13.
  • Interior router faults, not just bottom-cell faults, are covered; a faulty router deep in the tree can be routed around, unlike prior redundancy schemes that only repaired bottom memory cells.

Reading between the lines

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

  • Beyond the paper, the layer-by-layer repair strategy transfers to any binary-tree routing fabric with known bad nodes, such as classical memory repair or photonic and atomic routing networks where a fault table is available.
  • Because the repair mapping is classical and reused across queries, the per-query cost is dominated by recomputing the flag-qubit CNOT patterns; one could cache assignments and update only when the fault table changes, a dynamic-fault regime the paper does not analyze.
  • The authors divide the tree into just repairable and spare halves; subdividing into quarters or using more spare partitions is an obvious generalization that should improve the repairable fraction and likely reduce flag-qubit counts further.
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 / 5 minor

Summary. This paper addresses fabrication defects in binary-tree quantum random access memory (QRAM). Assuming a faulty-router table is available and at least 2^(n-1) addresses remain accessible, the authors propose two classical repair strategies: RelabelRepair, which relabels addresses and fixes some routers as one-way streets, and IterativeRepair, which repairs the tree layer by layer using ancilla flag qubits to reroute queries from faulty routers to available spare routers. The paper derives analytic expressions for the expected number of faulty addresses (Eqs. (4) and (7)) and for the unrepairable fraction (Eq. (11)), and validates them with Monte Carlo simulations. For n=13 and a router failure rate of 1%, the headline claim is that on average about 430 addresses need repair while only about 1.5 ancilla flag qubits are required on average. Pseudocode for all algorithms is provided, and the simulation code is released at a public repository.

Significance. If the results hold, this is a useful contribution to the practical problem of improving QRAM fabrication yield. The paper's strengths include a clean analytic faulty-address count based on a Galton-Watson recursion, a semi-analytic unrepairability estimate that agrees well with numerical sampling, explicit pseudocode for all proposed algorithms, Monte Carlo simulations with stated numbers of instances, and a public code release. The result that a small number of flag qubits can reroute many faulty addresses is striking and potentially important for hardware proposals. The main caveats are that the headline flag-qubit numbers are produced by a greedy, not optimal, assignment heuristic, and that IterativeRepair relies on interior-tree classical-data access that is explicitly documented only for the authors' own hardware proposal.

major comments (3)
  1. [VI.B and Eq. (7)] The text states that for n=13 and epsilon=0.01, '857 faulty addresses, thus 429 faulty routers' and that '214 routers need repair.' This inference is not justified by Eq. (7), which counts inaccessible bottom addresses, not faulty routers. A router at depth k renders 2^(n-k+1) addresses inaccessible, so the expected number of faulty routers is not F*_n(epsilon)/2. Moreover, in IterativeRepair, a faulty router whose parent is faulty is never reached and is removed in Algorithm 2, so the number of routers that actually require assignment is the number of 'first' faulty routers on accessible paths, which is substantially smaller than F*_n(epsilon)/2. Please report the actually simulated number of router assignments and correct the abstract and Sec. VI.B accordingly.
  2. [IV-B] The IterativeRepair algorithm requires the flag-qubit lookup to access classical data at interior nodes of the QRAM tree, as stated in Sec. IV-B: 'this strategy assumes that we can access classical data even in the interior of the QRAM tree, and not just at the leaves.' The only cited support for this functionality is Ref. [7], the authors' own hardware proposal. Because IterativeRepair is exactly the algorithm used when RelabelRepair fails, the central resource claim is conditional on this architectural feature. Please either provide independent evidence that the other QRAM platforms cited in Sec. II-C support mid-tree data access, or explicitly scope the claims to architectures with interior data registers and explain how the flag-qubit lookup would be performed otherwise.
  3. [V-B and VI.B] FlagQubitMinimization is a greedy heuristic, and the paper acknowledges that it can require up to n-1 flag qubits even in cases where n-3 suffice (Sec. VI.B and Fig. 10). The abstract's statement 'we require only 1.5 ancilla flag qubits on average' should therefore be phrased as the number used by the greedy heuristic, not as the minimum required. If the minimal number is intended, please provide an optimality check, for example by comparing the greedy result with an exact integer-programming solution for small instances.
minor comments (5)
  1. [Algorithm 3] The description of FlagQubitMinimization says the algorithm chooses the bit-flip pattern that 'assigns the most unique faulty routers to the most unique available routers'; this wording is ambiguous, and the tie-breaking rule should be specified.
  2. [Eq. (11)] The exponent '2n-1-2' in Eq. (11) should be typeset as 2^{n-1}-2 to avoid ambiguity with the text-based rendering.
  3. [Fig. 9] Fig. 9 shows average flag-qubit counts without error bars; please state whether error bars are omitted for readability or are too small to display.
  4. [General terminology] The term 'faulty routers' is used both for physical defective routers and for bottom-layer address pairs that are inaccessible as a consequence of higher-level faults, especially in Sec. VI.B. Please unify this terminology throughout the paper.
  5. [References] Reference [20] lists 'S. Heng' twice; please verify the author list.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the paper's analytic statistics and simulated flag-qubit counts are derived from stated parameters, and its explicit hardware assumptions are acknowledged conditions rather than hidden inputs.

full rationale

The paper's central quantitative claims are not fitted inputs disguised as predictions. The expected faulty-address count F_n(epsilon) is derived recursively from a Galton-Watson branching model in Eqs. (2)-(4), and the unrepairable fraction in Eqs. (9)-(11) is a semi-analytic calculation of the probability that fewer than 2^(n-1) addresses remain available; the Monte Carlo simulations test exactly these formulas with no parameters fitted to the simulated outputs. The flag-qubit resource counts (e.g., 1.5 ancillas on average for n=13, epsilon=1%) are outputs of the greedy FlagQubitMinimization and IterativeRepair algorithms run on randomly generated faulty-tree instances, not quantities used to calibrate the model. The two load-bearing conditions are explicitly stated: the paper says in Sec. IV-B that it 'assume[s] only that we initially have access to a functioning 2-bit QRAM (i.e., the top three routers are not faulty),' and it explicitly flags that IterativeRepair 'assumes that we can access classical data even in the interior of the QRAM tree, and not just at the leaves,' citing the authors' own hardware proposal Ref. [7]. These are transparent assumptions and limitations, not circular reductions; the algorithmic construction is an inductive bootstrapping from a small working seed to a larger repaired tree, with the base case and the interior-access requirement stated as conditions. The self-citation to Ref. [7] is load-bearing for the architectural applicability of IterativeRepair, but the paper does not claim to derive that capability from within the present argument, nor does it rename a fitted value as a prediction. No equation or algorithm reduces to its own input by construction, so no circularity is established.

Assumptions & free parameters 1 free parameters · 6 assumptions · 2 invented entities

The central claim rests on the availability of a functioning top of the tree, the ability to access data at interior nodes, and an exact fault map. The first two are stated assumptions; the third is plausible but not analyzed with tomography noise. The only free parameter is the input failure rate epsilon, which is not fitted to the paper's results. No new physical entities are introduced; flag qubits and one-way routers are operational roles for existing hardware.

free parameters (1)
  • router failure rate epsilon = 0.01, 0.02, 0.04, 0.08
    This is an input parameter taken from fabrication-defect literature, not fitted to the paper's own data. It is varied across simulations to show the trend.
assumptions (6)
  • domain assumption The top three routers (top two levels) are not faulty.
    Used throughout Secs. III and IV to define repairable instances. The paper states that any configuration where the top three are faulty is 'generally unrepairable.' This assumption is necessary for the seed 2-bit QRAM required by IterativeRepair.
  • domain assumption Classical data can be accessed at interior nodes of the QRAM tree, not just at the leaves.
    Stated in Sec. IV-B: 'Importantly, this strategy assumes that we can access classical data even in the interior of the QRAM tree.' This is required to activate flag qubits at intermediate layers. The paper cites Ref. [7] (authors' own superconducting-cavity proposal) as support.
  • domain assumption A faulty link is equivalent to a faulty router beneath it.
    Stated in the introduction: 'A faulty link makes the router beneath it unreachable, which is equivalent to that router itself being faulty.' This simplifies the model by reducing all defects to router failures.
  • domain assumption The faulty-router table (FRT) is known exactly.
    Assumed throughout Sec. IV. The paper notes the FRT can be constructed from local quantum process tomography, but does not model tomography errors.
  • standard math QRAM query time is O(j + b) for a j-bit QRAM with b bus qubits.
    Cited to Ref. [36] and used to compute the O(n^2) query-time overhead. This is a prior result, not derived in the paper.
  • domain assumption Routers that are not faulty operate perfectly during a query.
    The paper explicitly separates fabrication faults from transient noise, citing the resilience result for bucket-brigade QRAM [13]. The repair analysis assumes no transient errors.
invented entities (2)
  • ancilla flag qubits
    purpose: Detect queries that would arrive at a faulty router and flip address bits to reroute the query to an available router.
    Flag qubits are not a new physical entity; they are ordinary ancilla qubits with a specific role. Their usefulness is demonstrated in simulation, but no experimental implementation or hardware-specific resource count is provided.
  • one-way street routers
    purpose: Routers that permanently route in a single direction, used by RelabelRepair to bypass faulty subtrees.
    This is a mode of operation for existing routers, not a new physical device. No hardware proposal for implementing a permanently one-way router is given.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Faulty towers: recovering a functioning quantum random access memory in the presence of defective routers." pith.science (2026). https://pith.science/paper/ZG2GTQHR

@misc{pith2026241115612,
  author       = {Pith},
  title        = {Pith review of: Faulty towers: recovering a functioning quantum random access memory in the presence of defective routers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZG2GTQHR}},
  note         = {Machine review of arXiv:2411.15612}
}
abstract

Proposals for quantum random access memory (QRAM) generally have a binary-tree structure, and thus require hardware that is exponential in the depth of the QRAM. For solid-state based devices, a fabrication yield that is less than $100\%$ implies that certain addresses at the bottom of the tree become inaccessible if a router in the unique path to that address is faulty. We discuss how to recover a functioning QRAM in the presence of faulty routers. We present the \texttt{IterativeRepair} algorithm, which constructs QRAMs layer by layer until the desired depth is reached. This algorithm utilizes ancilla flag qubits which reroute queries to faulty routers. We present a classical algorithm \texttt{FlagQubitMinimization} that attempts to minimize the required number of such ancilla. For a router failure rate of $1\%$ and a QRAM of depth $n=13$, we expect that on average 430 addresses need repair: we require only 1.5 ancilla flag qubits on average to perform this rerouting.

Figures

Figures reproduced from arXiv: 2411.15612 by the authors.

Figure 1
Figure 1. Schematic of the proposed QRAM repair schemes. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. (a) A quantum router consists of four qubits and [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Faulty address and unrepairable fractions. For both [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: Illustration of the RelabelRepair algorithm. We attempt to repair a QRAM by treating certain routers as “one-way streets.” The required number of addresses below each router is shown in parentheses and the actual number of available addresses is indicated in blue (ther…
Figure 5
Figure 5. Figure 5: Average failure probability of RelabelRepair as a function of tree depth for ϵ = 0.04. This average is only computed among repairable trees. As the QRAM depth increases, the probability of RelabelRepair failing for a given desired depth increases exponentially, demonst…
Figure 6
Figure 6. Figure 6: In the IterativeRepair scheme, we construct QRAMs layer by layer, avoiding faulty routers (shown in red). Here, the goal is to obtain a working 4-bit QRAM from the given faulty 5-bit QRAM. (a) The layer second from the bottom of the tree is the first layer needing repa…
Figure 7
Figure 7. Figure 7: The number of necessary flag qubits can be minimized [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 8
Figure 8. Figure 8: To recursively repair the QRAM, address and bus qubits are routed in and out of the QRAM layer by layer. We first [PITH_FULL_IMAGE:figures/full_fig_p010_8.png]
Figure 9
Figure 9. Figure 9: Among QRAM instances that have at least 2 n−1 available addresses, we run FlagQubitMinimization on the lowest layer of the QRAM (solid) as well as the full IterativeRepair algorithm (dashed) and compute the average number of required flag qubits. Remarkably, even in ca…
Figure 11
Figure 11. Figure 11: Average runtime of FlagQubitMinimization to repair the lowest layer of the QRAM. The dashed lines are the best fit to aNb , indicating that the runtime increases approximately quadratically with the physical memory size N. The numerical runtime of FlagQubitMinimizatio…

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. OQRAM: Oblivious Quantum Random Access Memory for Securing Delegated Quantum Queries

    quant-ph 2026-07 conditional novelty 6.0 of 10

    OQRAM hides coherent QRAM address states and encrypted data from an untrusted server via offline shuffle/encrypt plus online qPRP or qOTP address masking, with optional decoy checks.

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

    quant-ph 2024-12 conditional novelty 6.0 of 10

    The bucket-brigade QRAM retains polylogarithmic query infidelity under arbitrary initialization, spatially correlated noise, and coherent noise, with a delayed Pauli twirling scheme restoring quadratic scaling.

Reference graph

Works this paper leans on

38 extracted references · 10 canonical work pages · cited by 2 Pith papers

  1. [7]

    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, 2024. [Online]. Available: https: //link.aps.org/doi/10.1103/PRXQuantum.5.020312

    doi:10.1103/prxquantum.5.020312 2024

  2. [1]

    A fast quantum mechanical algorithm for database search,

    L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing , ser. STOC ’96. New York, NY , USA: Association for Computing Machinery, 1996, p. 212. [Online]. Available: https://doi.org/10.1145/237814.237866

    arXiv 1996

  3. [2]

    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,” Phys. Rev. X , vol. 8, p. 041015, Oct 2018. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevX.8.041015

    doi:10.1103/physrevx.8.041015 2018

  4. [3]

    QRAM: A Survey and Critique,

    S. Jaques and A. G. Rattew, “QRAM: A Survey and Critique,” 2023, arXiv:2305.10310 [quant-ph]. [Online]. Available: http://arxiv.org/abs/ 2305.10310

    arXiv 2023

  5. [4]

    Quantum algorithms: A survey of applications and end-to-end complexities,

    A. M. Dalzell, S. McArdle, M. Berta, P. Bienias, C.-F. Chen, A. Gily ´en, C. T. Hann, M. J. Kastoryano, E. T. Khabiboulline, A. Kubica, G. Salton, S. Wang, and F. G. S. L. Brand ˜ao, “Quantum algorithms: A survey of applications and end-to-end complexities,” 2023

    work page 2023

  6. [5]

    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. M. Girvin, and L. Jiang, “Hardware-efficient quantum random access memory with hybrid quantum acoustic systems,” Phys. Rev. Lett. , vol. 123, p. 250501, 2019. [Online]. Available: https: //link.aps.org/doi/10.1103/PhysRevLett.123.250501

    doi:10.1103/physrevlett.123.250501 2019

  7. [6]

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

    arXiv 2024

  8. [8]

    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

    doi:10.1103/prxquantum.2.030319 2021

Show all 38 references
  1. [9]

    Robust quantum random access memory,

    F.-Y . Hong, Y . Xiang, Z.-Y . Zhu, L.-Z. Jiang, and L.-N. Wu, “Robust quantum random access memory,” Phys. Rev. A, vol. 86, p. 010306(R), Jul 2012. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA. 86.010306

    2012 doi

  2. [10]

    Architectures for a quantum random access memory,

    V . Giovannetti, S. Lloyd, and L. Maccone, “Architectures for a quantum random access memory,” Phys. Rev. A, vol. 78, p. 052310, Nov 2008. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.78.052310

    2008 doi

  3. [11]

    M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition . Cambridge University Press, 2010

    2010

  4. [12]

    Quantum random access memory,

    V . Giovannetti, S. Lloyd, and L. Maccone, “Quantum random access memory,” Phys. Rev. Lett. , vol. 100, p. 160501, Apr 2008. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.100.160501

    2008 doi

  5. [13]

    Resilience of Quantum Random Access Memory to Generic Noise,

    C. T. Hann, G. Lee, S. M. Girvin, and L. Jiang, “Resilience of Quantum Random Access Memory to Generic Noise,” PRX Quantum, vol. 2, p. 020311, 2021. [Online]. Available: https: //doi.org/10.1103/PRXQuantum.2.020311

    2021 doi

  6. [14]

    Efficient spare allocation in reconfigurable arrays,

    S.-Y . Kuo and W. K. Fuchs, “Efficient spare allocation in reconfigurable arrays,” in Proceedings of the 23rd ACM/IEEE Design Automation Conference, ser. DAC ’86. IEEE Press, 1986, p. 385

    1986

  7. [15]

    Quantum supremacy using a programmable superconducting processor,

    F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandao, D. A. Buell, B. Burkett, Y . Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, A. Dunsworth, E. Farhi, B. Foxen, A. Fowler, C. Gidney, M. Giustina, R. Graff, K. Guerin...

    2019

  8. [16]

    Quantum computational advantage via 60-qubit 24-cycle random circuit sampling,

    Q. Zhu, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y . Du, D. Fan, M. Gong, C. Guo, C. Guo, S. Guo, L. Han, L. Hong, H.-L. Huang, Y .-H. Huo, L. Li, N. Li, S. Li, Y . Li, F. Liang, C. Lin, J. Lin, H. Qian, D. Qiao, H. Rong, H. Su, L. Sun, L. Wang, S. Wang, D. ...

    2021 arXiv

  9. [17]

    Fault-tolerance thresholds for the surface code with fabrication errors,

    J. M. Auger, H. Anwar, M. Gimeno-Segovia, T. M. Stace, and D. E. Browne, “Fault-tolerance thresholds for the surface code with fabrication errors,” Phys. Rev. A , vol. 96, p. 042316, 2017. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.96.042316

    2017 doi

  10. [18]

    Luci in the surface code with dropouts,

    D. M. Debroy, M. McEwen, C. Gidney, N. Shutty, and A. Zalcman, “Luci in the surface code with dropouts,” 2024. [Online]. Available: https://arxiv.org/abs/2410.14891

    2024

  11. [19]

    Codesign of quantum error-correcting codes and modular chiplets in the presence of defects,

    S. F. Lin, J. Viszlai, K. N. Smith, G. S. Ravi, C. Yuan, F. T. Chong, and B. J. Brown, “Codesign of quantum error-correcting codes and modular chiplets in the presence of defects,” in Proceedings of the 29th ACM International Conference on Architectural Support for Programming...

    2024

  12. [20]

    Maximizing the yield of bucket brigade quantum random access memory using redundancy repair,

    D. Kim, S. Heng, S. Heng, and Y . Han, “Maximizing the yield of bucket brigade quantum random access memory using redundancy repair,” 2023

    2023

  13. [21]

    Circuit quantum electrodynamics,

    A. Blais, A. L. Grimsmo, S. M. Girvin, and A. Wallraff, “Circuit quantum electrodynamics,” Rev. Mod. Phys. , vol. 93, p. 025005, May

  14. [22]

    Trapped-ion quantum computing: Progress and challenges,

    C. D. Bruzewicz, J. Chiaverini, R. McConnell, and J. M. Sage, “Trapped-ion quantum computing: Progress and challenges,” Appl. Phys. Rev. , vol. 6, no. 2, p. 021314, 2019. [Online]. Available: https://doi.org/10.1063/1.5088164

    2019 doi

  15. [23]

    Logical quantum processor based on reconfigurable atom arrays,

    D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V . Vuleti ´c, and M. D. Luk...

    2024 doi

  16. [24]

    Hardware-efficient, fault-tolerant quantum computation with rydberg atoms,

    I. Cong, H. Levine, A. Keesling, D. Bluvstein, S.-T. Wang, and M. D. Lukin, “Hardware-efficient, fault-tolerant quantum computation with rydberg atoms,” Phys. Rev. X , vol. 12, p. 021049, 2022. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevX.12.021049

    2022 doi

  17. [25]

    Diamond nv centers for quantum computing and quantum networks,

    L. Childress and R. Hanson, “Diamond nv centers for quantum computing and quantum networks,” MRS Bulletin , vol. 38, no. 2, pp. 134–138, 2013. [Online]. Available: https://doi.org/10.1557/mrs.2013.20

    2013 doi

  18. [26]

    Quantum computing is scalable on a planar array of qubits with fabrication defects,

    A. Strikis, S. C. Benjamin, and B. J. Brown, “Quantum computing is scalable on a planar array of qubits with fabrication defects,” Phys. Rev. Appl. , vol. 19, p. 064081, 2023. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevApplied.19.064081

    2023 doi

  19. [27]

    Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits,

    M. McEwen, L. Faoro, K. Arya, A. Dunsworth, T. Huang, S. Kim, B. Burkett, A. Fowler, F. Arute, J. C. Bardin, A. Bengtsson, A. Bilmes, B. B. Buckley, N. Bushnell, Z. Chen, R. Collins, S. Demura, A. R. Derk, C. Erickson, M. Giustina, S. D. Harrington, S. Hong, E. Jeffrey, J. Kel...

    2022

  20. [28]

    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,” in Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture, ser. MICRO ’23. New York, NY , USA: Association for Computing Machinery, ...

    2023

  21. [29]

    Dram errors in the wild: a large-scale field study,

    B. Schroeder, E. Pinheiro, and W.-D. Weber, “Dram errors in the wild: a large-scale field study,” ACM SIGMETRICS Performance Evaluation Review, vol. 37, no. 1, pp. 193–204, 2009

    2009

  22. [30]

    A case for redundant arrays of inexpensive disks (raid),

    D. A. Patterson, G. Gibson, and R. H. Katz, “A case for redundant arrays of inexpensive disks (raid),” in Proceedings of the 1988 ACM SIGMOD international conference on Management of data , 1988, pp. 109–116

    1988

  23. [31]

    Comparison of accelerated dram soft error rates measured at component and system level,

    L. Borucki, G. Schindlbeck, and C. Slayman, “Comparison of accelerated dram soft error rates measured at component and system level,” in 2008 IEEE International Reliability Physics Symposium . IEEE, 2008, pp. 482–487

    2008

  24. [32]

    Good quantum error-correcting codes exist,

    A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Physical Review A , vol. 54, no. 2, p. 1098, 1996

    1996

  25. [33]

    The heisenberg representation of quantum computers,

    D. Gottesman, “The heisenberg representation of quantum computers,” arXiv:quant-ph/9807006, 1998. [Online]. Available: https://arxiv.org/abs/ quant-ph/9807006

    1998 arXiv

  26. [34]

    Practicality of quantum random access memory,

    C. Hann, “Practicality of quantum random access memory,” Ph.D. Dissertation, Yale Graduate School of Arts and Sciences, 2021, yale Graduate School of Arts and Sciences Dissertations. 346. [Online]. Available: https://elischolar.library.yale.edu/gsas dissertations/346

    2021

  27. [35]

    T. E. Harris, The Theory of Branching Processes , ser. Die Grundlehren der Mathematischen Wissenschaften. Berlin, Heidelberg: Springer, 1964, vol. 119

    1964

  28. [36]

    Efficient and error-resilient data access protocols for a limited- sized quantum random access memory,

    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 access protocols for a limited- sized quantum random access memory,” 2023. [Online]. Available: https://arxiv.or...

    2023 arXiv

  29. [37]

    D. K. Weiss, https://github.com/dkweiss31/QRAMfaultyrouters, 2024

    2024

  30. [2021]

    Available: https://link.aps.org/doi/10.1103/RevModPhys

    [Online]. Available: https://link.aps.org/doi/10.1103/RevModPhys. 93.025005

    doi

Pith tools

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