Quick Navigation

Topics

Quantum Optimization

Probabilistic tensor optimization of quantum circuits for the max-k-cut problem

arXiv
Authors: G. V. Paradezhenko, A. A. Pervishko, D. Yudin

Year

2023

Paper ID

53781

Status

Preprint

Abstract Read

~2 min

Abstract Words

98

Citations

N/A

Abstract

We propose a technique for optimizing parameterized circuits in variational quantum algorithms based on the probabilistic tensor sampling optimization. This method allows one to relax random initialization issues or heuristics for generating initial guess of variational parameters, and can be used to avoid local minima. We illustrate our approach on the example of the quantum approximate optimization algorithm (QAOA) applied to the max-k-cut problem based on the binary encoding efficient in the number of qubits. We discuss the advantages of our technique for searching optimal variational parameters of QAOA circuits in comparison to classical optimization methods.

Why This Paper Matters

  • This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
  • It adds a 2023 reference point for readers tracking recent quantum research.
  • We propose a technique for optimizing parameterized circuits in variational quantum algorithms based on the probabilistic tensor sampling optimization.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #53781

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.