Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0303091 · Physical Review Letters

Comment on “Probabilistic Quantum Memories”

Todd A. Brun, Hartmut Klauck, Ashwin Nayak, Martin Rötteler, Christof Zalka

Published Nov 13, 2003• 14 citations
arXivHTMLPDF

Abstract

This is a comment on two wrong Phys. Rev. Letters papers by C.A. Trugenberger. Trugenberger claimed that quantum registers could be used as exponentially large "associative" memories. We show that his scheme is no better than one where the quantum register is replaced with a classical one of equal size. We also point out that the Holevo bound and more recent bounds on "quantum random access codes" pretty much rule out powerful memories (for classical information) based on quantum states.

DOI
10.1103/physrevlett.91.209801

Related papers

Comment on "Stable Quantum Computation of Unstable Classical Chaos"

Christof Zalka

This is a 1-page comment on a wrong paper that recently appeared in PRL (Phys. Rev. Lett. 86 (23), 5393 (2001), also quant-ph/0101004). The authors claim to have shown that using a quantum computer gives an "exponential advantage" for simulating and studying classical chaotic systems.

arXiv:quant-ph/0110019•Oct 2, 2001•1 citation

Comment on `Quantum optimization for combinatorial searches'

Christof Zalka, Todd A. Brun

A recent paper by Trugenberger ( C A Trugenberger 2002 New J. Phys. 4 26 ) is commented on.

arXiv:quant-ph/0206081•New Journal of Physics•Sep 3, 2002•1 citation

Optimal Probabilistic Storage and Retrieval of Unitary Channels

Michal Sedlák, Alessandro Bisio, Mário Ziman

We address the question of quantum memory storage for quantum dynamics. In particular, we design an optimal protocol for N→1 probabilistic storage and retrieval of unitary channels on d-dimensional quantum systems. If we access the unknown unitary gate only N times, the optimal success probability of perfect single-use retrieval is N/(N-1+d^{2}). The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perfect alignment of reference frames and probabilistic port-based teleportation.

arXiv:1809.04552•Physical Review Letters•May 3, 2019•60 citations

Comment on “Modified quantum-speed-limit bounds for open quantum dynamics in quantum channels”

Nicolás Mirkin, Fabricio Toscano, Diego A. Wisniacki

In a recent paper [Phys. Rev. A 95, 052118 (2017)], the authors claim that our criticism, in Phys. Rev. A 94, 052125 (2016), to some quantum speed limit bounds for open quantum dynamics that appeared recently in literature are invalid. According to the authors, the problem with our analysis would be generated by an artifact of the finite-precision numerical calculations. We analytically show here that it is not possible to have any inconsistency associated with the numerical precision of calculations. Therefore, our criticism of the quantum speed limit bounds continues to be valid.

Physical Review A•Apr 6, 2018•2 citations

Comment II on “Dense coding in entangled states”

Omid Akhavan, A. T. Rezakhani

In a recent Brief Report, L. Lee, D. Ahn, and S. W. Hwang [Phys. Rev. A 66, 024304 (2002)] have claimed that using pairwise entangled qubits gives rise to an exponentially more efficient dense coding when two parties are involved than using maximally entangled qubits shared among N parties. Here we show that their claim is not true.

arXiv:quant-ph/0306148•Physical Review A•Jul 9, 2003•11 citations

Probabilistic Quantum Memories

Carlo A. Trugenberger

Typical address-oriented computer memories cannot recognize incomplete or noisy information. Associative (content-addressable) memories solve this problem but suffer from severe capacity shortages. I propose a model of a quantum memory that solves both problems. The storage capacity is exponential in the number of qbits and thus optimal. The retrieval mechanism for incomplete or noisy inputs is probabilistic, with postselection of the measurement result. The output is determined by a probability distribution on the memory which is peaked around the stored patterns closest in Hamming distance to the input.

arXiv:quant-ph/0012100•Physical Review Letters•Jul 18, 2001•136 citations
This is a comment on two wrong Phys. Rev. Letters papers by C.A. Trugenberger. Trugenberger claimed that quantum registers could be used as exponentially large "associative" memories. We show that his scheme is no better than one where the quantum register is replaced with a classical one of equal size. We also point out that the Holevo bound and more recent bounds on "quantum random access codes" pretty much rule out powerful memories (for classical information) based on quantum states.
We address the question of quantum memory storage for quantum dynamics. In particular, we design an optimal protocol for N→1 probabilistic storage and retrieval of unitary channels on d-dimensional quantum systems. If we access the unknown unitary gate only N times, the optimal success probability of perfect single-use retrieval is N/(N-1+d^{2}). The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perfect alignment of reference frames and probabilistic port-based teleportation.
In a recent paper [Phys. Rev. A 95, 052118 (2017)], the authors claim that our criticism, in Phys. Rev. A 94, 052125 (2016), to some quantum speed limit bounds for open quantum dynamics that appeared recently in literature are invalid. According to the authors, the problem with our analysis would be generated by an artifact of the finite-precision numerical calculations. We analytically show here that it is not possible to have any inconsistency associated with the numerical precision of calculations. Therefore, our criticism of the quantum speed limit bounds continues to be valid.
Typical address-oriented computer memories cannot recognize incomplete or noisy information. Associative (content-addressable) memories solve this problem but suffer from severe capacity shortages. I propose a model of a quantum memory that solves both problems. The storage capacity is exponential in the number of qbits and thus optimal. The retrieval mechanism for incomplete or noisy inputs is probabilistic, with postselection of the measurement result. The output is determined by a probability distribution on the memory which is peaked around the stored patterns closest in Hamming distance to the input.