Quantum
Halving the cost of QROM again via dense encoding
Publication: quant-ph updates on arXiv.org
Author: Danial Motlagh
Source published: 05/10/2026, 04:00:00 UTC
Briefing created: 05/10/2026, 04:25:21 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 05/10/2026, 04:13:24 UTC.
Briefings
A new arXiv preprint proposes a dense encoding method for Quantum Read-Only Memory (QROM) that halves the Toffoli count of SelectSwap, achieving a fourfold improvement over the baseline. The study focuses on the qubit-constrained regime where workspace limits table-block size, making table loading the dominant cost factor. By storing two classical bits per dirty qubit using both Z and X bases, the authors reduce the leading Toffoli count from 2N/λ to N/λ, then combine this with sequential bit packets to further halve the cost to (1+1/b)N/λ. This represents an approximate 4x improvement over SelectSwap for practical bit lengths b.
Key points
- The study introduces a dense encoding construction for QROM where two classical bits are stored in each dirty qubit using both Z and X bases, reducing the leading Toffoli count to N/λ.
- Combining dense encoding with sequential bit packets yields a leading Toffoli count of (1+1/b)N/λ, representing an approximately 4x improvement over SelectSwap in the large-N limit for practical bit lengths.
Context and limitations
The analysis is restricted to the qubit-constrained regime where workspace limits table-block size, making table loading the dominant cost factor. The results apply to the large-N limit for practical bit lengths b, and the preprint status indicates uncertainty regarding the final implementation details.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 05/10/2026, 04:25:21 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeia442emezh3bo6gzm3g6fgtfeaglhhnazlwvtqwdjgtqmxpxzyhoy