Digitalni repozitorij raziskovalnih organizacij Slovenije

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po

Možnosti:
  Ponastavi


Iskalni niz: "ključne besede" (max-algebra) .

1 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Relaxations and exact solutions to Quantum Max Cut via the algebraic structure of swap operators
Adam Bene Watts, Anirban Chowdhury, Aidan Epperly, J. William Helton, Igor Klep, 2024, izvirni znanstveni članek

Povzetek: The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using the algebraic structure of QMC, in particular the relationship between the quantum max cut Hamiltonian and the representation theory of the symmetric group. The first major contribution of this paper is an extension of non-commutative Sum of Squares (ncSoS) optimization techniques to give a new hierarchy of relaxations to Quantum Max Cut. The hierarchy we present is based on optimizations over polynomials in the qubit swap operators. This is in contrast to the "standard" quantum Lasserre Hierarchy, which is based on polynomials expressed in terms of the Pauli matrices. To prove correctness of this hierarchy, we exploit a finite presentation of the algebra generated by the qubit swap operators. This presentation allows for the use of computer algebraic techniques to manipulate and simplify polynomials written in terms of the swap operators, and may be of independent interest. Surprisingly, we find that level-2 of this new hierarchy is numerically exact (up to tolerance $10^{-7}$) on all QMC instances with uniform edge weights on graphs with at most 8 vertices. The second major contribution of this paper is a polynomial-time algorithm that computes (in exact arithmetic) the maximum eigenvalue of the QMC Hamiltonian for certain graphs, including graphs that can be "decomposed" as a signed combination of cliques. A special case of the latter are complete bipartite graphs with uniform edge-weights, for which exact solutions are known from the work of Lieb and Mattis. Our methods, which use representation theory of the symmetric group, can be seen as a generalization of the Lieb-Mattis result.
Ključne besede: Quantum Max Cut, swap operators, noncommutative polynomials, symmetric group, Gröbner bases
Objavljeno v DiRROS: 04.06.2024; Ogledov: 89; Prenosov: 65
.pdf Celotno besedilo (1,44 MB)
Gradivo ima več datotek! Več...

2.
On some aspects of spectral theory for infinite bounded non-negative matrices in max algebra
Vladimir Müller, Aljoša Peperko, 2024, izvirni znanstveni članek

Povzetek: Several spectral radii formulas for infinite bounded non-negative matrices in max algebra are obtained. We also prove some Perron–Frobenius type results for such matrices. In particular, we obtain results on block triangular forms, which are similar to results on Frobenius normal form of $n \times n$ matrices. Some continuity results are also established.
Ključne besede: non-negative matrices, infinite bounded matrices, max algebra, Bonsall’s cone spectral radius, eigenvalues, continuity
Objavljeno v DiRROS: 30.05.2024; Ogledov: 131; Prenosov: 131
.pdf Celotno besedilo (1,77 MB)
Gradivo ima več datotek! Več...

3.
Evaluation of parallel hierarchical differential evolution for min-max optimization problems using SciPy
Margarita Antoniou, Gregor Papa, 2022, objavljeni znanstveni prispevek na konferenci

Ključne besede: min-max optimization, parallelization, differential evolution, SciPy
Objavljeno v DiRROS: 19.05.2023; Ogledov: 360; Prenosov: 186
.pdf Celotno besedilo (1,39 MB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.12 sek.
Na vrh