Skip to content
DraconiticResearch
Search Sources API
194,164 studies31 sourcesUpdated 3 min ago
PreprintarXiv licencearXiv

Alignment of the amplitudes of stored states for solving the associative memory problem using quantum annealing

Abstract

The solution of combinatorial optimization problems by means of quantum annealing is based on the preparation of an equally superposition state. Such superposition is crucial to the associative memory problem of correctly recalling patterns. In this paper, we study the alignment of the amplitudes of stored states in memory using the proposed auxiliary Hamiltonian, which is switched off at the end of evolution. The results of the algorithm execution were obtained both by numerical modeling and by the perturbation theory method, which made it possible to obtain the dependences on physical parameters in explicit form. As examples, systems of two and three qutrits, represented by spins S=1, are considered. Since the Hamiltonian is expressed in a univer-sal form through projectors onto states stored in memory, it can be used for other quantum sys-tems (platforms).

Related

  1. Set-Packing and Sequence-Pair QUBOs for the 2D Cutting Stock Problem on Quantum Annealing Hardware
    Miguel Sánchez-Beato, Raul Martinez, Matilde Osa +2
    arXivPreprintarXiv licenceFull textOptimisation & controlQuantum physics & quantum informationarXiv
  2. "I don't have a good metric for what other people think:" Unpacking the double empathy problem in neurodivergent physics problem-solving
    Liam G. McDermott, Frank T. Dachille, George R. Keefe +3
    arXivPreprintCC BY 4.0Full textGeneral physicsarXiv
  3. Solving the MAX-k-CUT problem for hypergraphs with quantum computing
    V. S. Yarmus, Kh. P. Gnatenko
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Solving a non-abelian hidden subgroup problem on a trapped-ion quantum computer: the power of the measurement basis
    Oliver O'Brien
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  5. Resource and entanglement study of a hybrid qudit-qubit quantum algorithm for solving the integer programming problem
    Kapil Goswami, Rick Mukherjee, Peter Schmelcher
    arXivPreprintCC BY 4.0Full textComputational physicsQuantum physics & quantum informationarXiv
BibTeX
@misc{zobov2026alignment,
  title = {{Alignment of the amplitudes of stored states for solving the associative memory problem using quantum annealing}},
  author = {Vladimir E. Zobov and Ivan S. Pichkovskiy},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.29190},
  eprint = {2610.29190},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.29190},
}
RIS
TY  - UNPB
TI  - Alignment of the amplitudes of stored states for solving the associative memory problem using quantum annealing
AU  - Vladimir E. Zobov
AU  - Ivan S. Pichkovskiy
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.29190
UR  - https://arxiv.org/abs/2610.29190
AB  - The solution of combinatorial optimization problems by means of quantum annealing is based on the preparation of an equally superposition state. Such superposition is crucial to the associative memory problem of correctly recalling patterns. In this paper, we study the alignment of the amplitudes of stored states in memory using the proposed auxiliary Hamiltonian, which is switched off at the end of evolution. The results of the algorithm execution were obtained both by numerical modeling and by the perturbation theory method, which made it possible to obtain the dependences on physical parameters in explicit form. As examples, systems of two and three qutrits, represented by spins S=1, are considered. Since the Hamiltonian is expressed in a univer-sal form through projectors onto states stored in memory, it can be used for other quantum sys-tems (platforms).
ER  -