Probabilistic quantum memories.

@article{Trugenberger2000ProbabilisticQM,
  title={Probabilistic quantum memories.},
  author={Carlo A. Trugenberger},
  journal={Physical review letters},
  year={2000},
  volume={87 6},
  pages={
          067901
        },
  url={https://api.semanticscholar.org/CorpusID:23325931}
}
A model of a quantum memory that solves both problems: the storage capacity is exponential in the number of qbits and thus optimal, and the retrieval mechanism is probabilistic, with postselection of the measurement result.
[PDF] Semantic Reader
114 Citations
Highly Influential Citations
11
Background Citations
44
Methods Citations
27
Results Citations
3

114 Citations

Non-unitary Quantum Associative Memory

A nonunitary quantum memory retrieval algorithm is proposed that is used to recover incomplete input information and also in pattern classification task as an ensemble of memories.

Quantum probabilistic associative memory architecture

Quantum Pattern Recognition

This model solves the well-known capacity shortage problem of classical associative memories, providing a large improvement in capacity.

Parametric Probabilistic Quantum Memory

A Weightless Neural Node Based on a Probabilistic Quantum Memory

A new model of a quantum weightless neural node with a probabilistic quantum memory proposed by Trugen berger is defined, where one can store patterns with only quantum bits (qbits) and the memory of the node does not grow exponentially with the number of inputs.

High-Capacity Quantum Associative Memories

Probabilistic quantum memories, that make use of postselection of the measurement result of control qubits, overcome the famed linear storage limitation of their classical counterparts because they permit to completely eliminate crosstalk and spurious memories.

A WNN model based on Probabilistic Quantum Memories

This work presents the first evaluation of a quantum weight-less neural networks on public benchmark datasets and conducts classical experiments using an equivalent classical description of the Probabilist Quantum Memory algorithm.

Comment on "Probabilistic quantum memories".

It is shown that Trugenberger's scheme is no better than one where the quantum register is replaced with a classical one of equal size and that the Holevo bound and more recent bounds on "quantum random access codes" pretty much rule out powerful memories based on quantum states.

Alpha-Beta Hybrid Quantum Associative Memory Using Hamming Distance

A quantum associative memory (Alpha-Beta HQAM) that uses the Hamming distance for pattern recovery and is initially stored in the memory as a quantum superposition in order to take advantage of its properties.

Phase transitions in quantum pattern recognition.

It is shown that the associative memory undergoes a phase transition from a disordered, high-temperature phase with no correlation between input and output to an ordered, low-tem temperature phase with minimal input-output Hamming distance.
...

7 References

An Introduction to Quantum Computing Algorithms

This monograph is a good self-contained introductory resource for newcomers to the field of quantum computing algorithms, as well as a useful self-study guide for the more specialized scientist, mathematician, graduate student, or engineer.

Self-Organization and Associative Memory

The purpose and nature of Biological Memory, as well as some of the aspects of Memory Aspects, are explained.

Spin Glass Theory and Beyond

This book contains a detailed and self-contained presentation of the replica theory of infinite range spin glasses, paying particular attention to new applications in the study of optimization theory and neural networks.