paper-with-me

Papers

Magic-Informed Quantum Architecture Search

2026-05-05 · Vincenzo Lipardi, Domenica Dibenedetto, Georgios Stamoulis, Mark H. M. Winands arxiv

Nonstabilizerness, commonly referred to as magic, is a fundamental resource underpinning quantum advantage. In this paper, we propose a magic-informed quantum architecture search (QAS) technique that enables control over a quantum resource within the general framework of circuit design. Inspired by the AlphaGo approach, we tackle the problem with a Monte Carlo Tree Search technique equipped with a Graph Neural Network (GNN) that estimates the magic of candidate quantum circuits. The GNN model induces a magic-based bias that steers the search toward either high- or low-magic regimes, depending on the target objective. We benchmark the proposed magic-informed QAS technique on both the structured ground-state energy problem and on the more general quantum state approximation problem, spanning different sizes and target magic levels. Experimental results show that the proposed technique effectively influences the magic across the search tree and notably also on the resulting final circuit, even in regimes where the GNN operates on out-of-distribution instances. Although introducing a problem-agnostic magic bias could, in principle, constrain the search dynamics, we observe consistent improvements in solution quality across all problems tested.

📄 PDF Abstract BibTeX arXiv:2605.03932

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Neural Network

Similar Papers 제목 키워드 기반

A Quantum Search Approach to Magic Square Constraint Problems with Classical Benchmarking

2026-04-06 · Rituparna R, Harsha Varthini, Aswani Kumar Cherukuri arxiv

This paper presents a quantum search approach to combinatorial constraint satisfaction problems, demonstrated through the generation of magic squares. We reformulate magic square construction as a quantum search problem …

On the statistical complexity of quantum circuits

2021-01-15 · Kaifeng Bu, Dax Enshan Koh, Lu Li, Qingxian Luo 외

In theoretical machine learning, the statistical complexity is a notion that measures the richness of a hypothesis space. In this work, we apply a particular measure of statistical complexity, namely the Rademacher compl…

Advantage for Discrete Variational Quantum Algorithms in Circuit Recompilation

2025-10-01 · Oleksandr Kyriienko, Chukwudubem Umeano, Zoë Holmes arxiv

The relative power of quantum algorithms, using an adaptive access to quantum devices, versus classical post-processing methods that rely only on an initial quantum data set, remains the subject of active debate. Here, w…

HamQASBench: A Hamiltonian-Informed Diagnostic Benchmark for Evaluating Quantum Architecture Search

2026-07-06 · Jiayang Niu, Akib Karim, Yan Wang, Jie Li 외 arxiv

Quantum Architecture Search (QAS) automates the design of parameterized quantum circuits for variational quantum algorithms, yet existing benchmarks organize instances by molecular identity or qubit count -- criteria agn…

MAGIC: Multi-task Gaussian process for joint imputation and classification in healthcare time series

2025-09-23 · Dohyun Ku, Catherine D. Chong, Visar Berisha, Todd J. Schwedt 외 arxiv

Time series analysis has emerged as an important tool for improving patient diagnosis and management in healthcare applications. However, these applications commonly face two critical challenges: time misalignment and da…

Time Series Analysis