Transfer-Based Strategies for Multi-Target Quantum Optimization

• URL: http://arxiv.org/abs/2508.11914v2
• Date: Sat, 27 Sep 2025 12:48:08 GMT
• Title: Transfer-Based Strategies for Multi-Target Quantum Optimization
• Authors: Vu Tuan Hai, Bui Cao Doanh, Le Vu Trung Duong, Pham Hoai Luan, Yasuhiko Nakashima,
• Abstract summary: We address the challenge of multi-target quantum optimization.<n>The objective is to simultaneously optimize multiple cost functions defined over the same quantum search space.<n>We investigate a range of strategies that enable knowledge transfer between related tasks.
• Score: 0.8481798330936976
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We address the challenge of multi-target quantum optimization, where the objective is to simultaneously optimize multiple cost functions defined over the same quantum search space. To accelerate optimization and reduce quantum resource usage, we investigate a range of strategies that enable knowledge transfer between related tasks. Specifically, we introduce a two-stage framework consisting of a training phase where solutions are progressively shared across tasks and an inference phase, where unoptimized targets are initialized based on prior optimized ones. We propose and evaluate several methods, including warm-start initialization, parameter estimation via first-order Taylor expansion, hierarchical clustering with D-level trees, and deep learning-based transfer. Our experimental results, using parameterized quantum circuits implemented with PennyLane, demonstrate that transfer techniques significantly reduce the number of required iterations while maintaining an acceptable cost value. These findings highlight the promise of multi-target generalization in quantum optimization pipelines and provide a foundation for scalable multi-target quantum optimization.

Related papers

• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Quantum-Enhanced Optimization by Warm Starts [1.1666234644810893]
  We present an approach, which we term quantum-enhanced optimization, to accelerate classical optimization algorithms by leveraging quantum samples.<n>Our method uses quantum-generated samples as warm starts to classical samplings for solving novel problems like Max-Cut and Maximum Independent Set (MIS)
  arXiv  Detail & Related papers  (2025-08-22T11:36:19Z)
• Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms [4.525216077859531]
  We introduce a new framework for optimizing parameterized quantum circuits (PQCs) that employs a classical, inspired by Model-Agnostic Meta-Learning (MAML) technique.<n>Our framework features a classical neural network, called Learner, which interacts with a PQC using the output of Learner as an initial parameter.<n>In the adaptation phase, the framework requires only a few PQC updates to converge to a more accurate value, while the learner remains unchanged.
  arXiv  Detail & Related papers  (2025-01-10T12:07:00Z)
• A coherent approach to quantum-classical optimization [0.0]
  Hybrid quantum-classical optimization techniques have been shown to allow for the reduction of quantum computational resources. We identify the coherence entropy as a crucial metric in determining the suitability of quantum states. We propose a quantum-classical optimization protocol that significantly improves on previous approaches for such tasks.
  arXiv  Detail & Related papers  (2024-09-20T22:22:53Z)
• Quantum landscape tomography for efficient single-gate optimization on quantum computers [0.0]
  Circuit optimization is a fundamental task for practical applications of near-term quantum computers. We propose a process called quantum landscape tomography to characterize the influence of individual gates on the entire circuit. Our findings highlight the potential of quantum landscape tomography to enhance circuit optimization in near-term quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-25T18:00:06Z)
• Surrogate-guided optimization in quantum networks [0.9148747049384086]
  We propose an optimization algorithm to improve the design and performance of quantum communication networks. Our framework allows for more comprehensive quantum network studies, integrating surrogate-assisted optimization with existing quantum network simulators.
  arXiv  Detail & Related papers  (2024-07-24T11:55:18Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs [0.0]
  Current quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device.<n>We propose to design classical programs for computing the objective function and certifying the constraints, and later compile them to quantum circuits.<n>We exploit this idea for optimization tasks like the Travelling Salesman Problem and Max-$K$-Cut and obtain circuits that are near-optimal with respect to all relevant cost measures.
  arXiv  Detail & Related papers  (2022-09-07T18:01:01Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.