INQA Conference 2025: Anna Maria Dziubyna - Jagiellonian University

INQA Conference 2025: Anna Maria Dziubyna - Jagiellonian University

🎙 Anna Maria Dziubyna 👥 311 📅 November 28, 2025 ⏱ 42 min 👁 20 📄 original study 🧭 2026-08-16
Available in: English (current) Français

Keywords

tensor networksquantum annealingspin glassesbranch and boundPegasus graphZephyr graphLHZ architecture

Summary

Anna Maria Dziubyna presents a heuristic algorithm based on tensor network contractions to solve discrete optimization problems, specifically Ising spin-glass problems on graphs relevant to quantum annealers. The method combines branch-and-bound search with approximate tensor network contractions to find low-energy states. The talk covers the algorithm’s setup, including the representation of the problem as a projected entangled pair state (PEPS) tensor network, and the use of sparse tensor structures and boundary matrix product state (MPS) approximations. Benchmark results are shown for random Ising instances and tile-planting problems on Pegasus and Zephyr graphs with up to 5000 spins, comparing against the D-Wave Advantage quantum annealer and the Simulated Bifurcation Machine (SBM). For large i.i.d. problems, tensor networks yield solutions 0.1% to 1% worse than the best Ising machines, but for embedded tile-planting instances, they achieve approximately 0.1% from the planted ground state, a factor of 3 better. The talk also discusses the diversity of solutions and the stability of the algorithm, noting trade-offs between temperature and contraction stability. Finally, the speaker outlines extensions to the Lechner-Hauke-Zoller (LHZ) architecture for fully connected spin-glass problems.

182 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides valuable insights into the application of tensor network methods to optimization problems, a relatively novel approach. The argumentation is solid, supported by benchmark results on multiple problem instances and comparisons with established solvers. The speaker clearly explains the algorithm’s steps and the challenges encountered, such as contraction instabilities. The presentation of both strengths and limitations adds to its credibility.

Scientific Rigor, Source Quality, Title Accuracy

The talk demonstrates scientific rigor through detailed algorithmic descriptions and systematic benchmarking. However, specific sources are not explicitly cited within the talk, and the description does not provide references. The title accurately reflects the content, as it is a conference presentation by the named researcher. The lack of explicit citations limits the ability to verify claims independently.

134 words

Title / Content Match

The title accurately reflects the content: a conference presentation by Anna Maria Dziubyna from Jagiellonian University.

Quality & Reliability

8/10

The talk presents original research with detailed algorithmic descriptions and benchmark results, but lacks peer-reviewed publication details and independent verification.

Key Moments

Contribution & Novelties

The talk presents a novel application of tensor network methods to discrete optimization on quantum annealing geometries, demonstrating competitive performance on certain problem classes. The approach offers a deterministic alternative to probabilistic solvers, with potential advantages in solution diversity for specific instances.

Pour aller plus loin :

102 words

Radar Profile

The radar profile shows high scores in technical level and information quantity, with slightly lower scores in quality and reliability, reflecting the advanced technical content and the lack of explicit citations.

Reliability 7/10