Pith. sign in

REVIEW

Double sparse quantum state preparation

Not yet reviewed by Pith; the record is open.

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 2108.13527 v1 pith:PGLNQJHW submitted 2021-08-30 quant-ph cs.ET

classification quant-phcs.ET
keywords quantumstatealgorithmalgorithmsnumberpreparationsparsealternative
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Initializing classical data in a quantum device is an essential step in many quantum algorithms. As a consequence of measurement and noisy operations, some algorithms need to reinitialize the prepared state several times during its execution. In this work, we propose a quantum state preparation algorithm called CVO-QRAM with computational cost O(kM), where M is the number of nonzero probability amplitudes and $k$ is the maximum number of bits with value 1 in the patterns to be stored. The proposed algorithm can be an alternative to create sparse states in future NISQ devices.

Discussion (0). Continue with ORCID to comment.

Pith tools