MedElevator Войти в исследования
← Поиск публикаций

DOI 10.1038/s41598-022-20853-w

Медицинская библиотека · Scientific reports · 2022

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer.

Niroula Pradeep, Shaydulin Ruslan, Yalovetzky Romina, Minssen Pierre, Herman Dylan, Hu Shaohan, Pistoia Marco

СтатьяПеревод в очереди

Аннотация

Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

Для цитирования: Niroula Pradeep, Shaydulin Ruslan, Yalovetzky Romina, Minssen Pierre, Herman Dylan, Hu Shaohan, Pistoia Marco. Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer.. Scientific reports. 2022. DOI: 10.1038/s41598-022-20853-w.
Подготовка и перевод публикации
Обработка статьи · этапы, ошибки и управление
Загрузка состояния…

История · было → стало

Состояние обновляется каждые 5 секунд, пока блок открыт. Процент показывается только там, где известен объём работы. Пауза останавливает продолжение этапа; текущий запрос к источнику может завершиться.

Тип публикации указан по данным источника. Уровень доказательности автоматически не присваивается.