Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut

نویسندگان

چکیده

Finding high-quality parameters is a central obstacle to using the quantum approximate optimization algorithm (QAOA). Previous work partially addresses this issue for QAOA on unweighted MaxCut problems by leveraging similarities in objective landscape among different problem instances. However, we show that more general weighted has significantly modified landscapes, with proliferation of poor local optima. Our main contribution simple rescaling scheme overcomes these deleterious effects weights. We given depth, single “typical” vector can be successfully transferred This transfer leads median decrease approximation ratio only 2.0 percentage points relative considerably expensive direct dataset 34,701 instances up 20 nodes and multiple weight distributions. reduced 1.2 at cost 10 additional circuit evaluations sampled from pretrained metadistribution, or used as starting point run obtain ratios equivalent those achieved exhaustive 96.35% our cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Nonlinear Optimization over Weighted Independence Systems

We consider optimizing a nonlinear objective function over a weighted independence system presented by a linear-optimization oracle. We provide an efficient algorithm that determines an r-best solution for nonlinear functions of the total weight of an independent set, where r depends only on certain Frobenius numbers of the individual weights and is independent of the size of the ground set. In...

متن کامل

Regret Transfer and Parameter Optimization

Regret matching is a widely-used algorithm for learning how to act. We begin by proving that regrets on actions in one setting (game) can be transferred to warm start the regrets for solving a different setting with same structure but different payoffs that can be written as a function of parameters. We prove how this can be done by carefully discounting the prior regrets. This provides, to our...

متن کامل

Temporal Planning for Compilation of Quantum Approximate Optimization Algorithm Circuits

We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and allow highly parallel plans. We report on experiments using several temporal planners to compile ci...

متن کامل

Temporal Planning for Compilation of Quantum Approximate Optimization Circuits

We investigate the application of temporal planners to the problem of compiling quantum circuits to emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and thus allow highly parallel plans. We report on experiments using several temporal planners to compile cir...

متن کامل

Sensitivity optimization in quantum parameter estimation

We present a general framework for sensitivity optimization in quantum parameter estimation schemes based on continuous ~indirect! observation of a dynamical system. As an illustrative example, we analyze the canonical scenario of monitoring the position of a free mass or harmonic oscillator to detect weak classical forces. We show that our framework allows the consideration of sensitivity sche...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM transactions on quantum computing

سال: 2023

ISSN: ['2643-6817', '2643-6809']

DOI: https://doi.org/10.1145/3584706