Pith. sign in

REVIEW 1 cited by

Fault tolerant resource estimation of quantum random-access memories

Not yet reviewed by Pith; the record is open.

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

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.01329 v2 pith:AQ7QSKMH submitted 2019-02-04 quant-ph

Olivia Di Matteo , Vlad Gheorghiu , Michele Mosca This is my paper · ORCID
classification quant-ph
keywords quantumqramrandom-accesscostresourcealgorithmalgorithmsanalyze
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum random-access look-up of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation of the algorithm. In this paper we study the cost of fault-tolerantly implementing a qRAM. We construct and analyze generic families of circuits that function as a qRAM, discuss opportunities for qubit-time tradeoffs, and estimate their resource costs when embedded in a surface code.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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.

Pith tools