Pith. sign in

REVIEW 1 cited by

Mirror modular cloning and fast quantum associative retrieval

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 2206.01644 v1 pith:7EHJPE4F submitted 2022-06-03 quant-ph cs.AIcs.CV

M. C. Diamantini , C. A. Trugenberger This is my paper · ORCID
classification quant-phcs.AIcs.CV
keywords quantumassociativealgorithmcloningexponentiallyretrievalclassicalcloned
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We show that a quantum state can be perfectly cloned up to global mirroring with a unitary transformation that depends on one single parameter. We then show that this is equivalent to "perfect" cloning for quantum associative memories which, as a consequence efficiently hold exponentially more information than their classical counterparts. Finally, we present a quantum associative retrieval algorithm which can correct corrupted inputs and is exponentially faster than the Grover algorithm.

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. Nested Grover's Algorithm for Tree Search

    quant-ph 2025-09 reject novelty 4.0 of 10

    A nested Grover algorithm for tree search claims cost O(m*2^(m/4)) using partial candidate solutions, but the speedup relies on an unexamined assumption that the candidate set contains the solution.

Pith tools