116
views
0
recommends
+1 Recommend
0
shares
    • Review: found
    Is Open Access

    Review of 'Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer'

    Bookmark
    3
    Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
    Demonstration of a quantum optimization algorithm for extractive summarization
    Average rating:
        Rated 3 of 5.
    Level of importance:
        Rated 3 of 5.
    Level of validity:
        Rated 3 of 5.
    Level of completeness:
        Rated 3 of 5.
    Level of comprehensibility:
        Rated 2 of 5.
    Competing interests:
    None

    Reviewed article

    • Record: found
    • Abstract: found
    • Article: found
    Is Open Access

    Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer

    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 the Quantinuum H1-1 trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 765 two-qubit gates with a two-qubit gate depth of up to 159, and all 20 qubits of the H1-1 device. 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. Our experimental results demonstrate that the rapid hardware and algorithmic progress is enabling the solution of constrained-optimization problems on quantum hardware.
      Bookmark

      Review information

      Review text

      The article discusses the potential for near-term quantum computers to solve constrained-optimization problems and their application in extractive summarization. The article presents a demonstration of the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on a trapped-ion quantum computer. The article also compares XY-QAOA to the Layer Variational Quantum Eigensolver algorithm and the Quantum Approximate Optimization Algorithm. The introduction provides a clear rationale for the importance of evaluating promising quantum algorithms on state-of-the-art hardware to assess their potential to provide quantum advantage in optimization. The authors also present experimental and numerical results to demonstrate the challenges associated with solving constrained-optimization problems with near-term quantum computers.

      As for revisions, the article is well-written and clearly structured. However, some technical terms and concepts might be difficult to understand for readers with limited knowledge of quantum computing. The authors could consider providing more explanations and illustrations to improve the article's accessibility. Additionally, the authors could further explain the practical applications of extractive summarization and the potential benefits of solving this problem on a quantum computer.

      The article lacks a detailed discussion on the limitations and assumptions of the proposed approach. While the authors acknowledge the challenges associated with solving constrained-optimization problems with near-term quantum computers, they do not provide a comprehensive analysis of the limitations and assumptions of their approach.

      The strength of the article is its demonstration of the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware, using up to 20 qubits and a two-qubit gate depth of up to 159. The authors provide a clear rationale for the importance of solving practical optimization problems using quantum computers and present experimental and numerical results to support their arguments. The weakness of the article is its limited discussion on the limitations and assumptions of the proposed approach.

       

      Comments

      Comment on this review

      Version and Review History