Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

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

Published Jul 11, 2022• 0 citations
Publisher

Abstract

Data from the paper "Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer"
DOI
10.5281/zenodo.6819861

Related papers

Data from "Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem"

Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti +26 more

Data from the paper "Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem"

•Jul 27, 2023•0 citations

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

Pradeep Niroula, Ruslan Shaydulin, Romina Yalovetzky +4 more

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.

arXiv:2206.06290•Scientific Reports•Oct 13, 2022•59 citations

Advances in the study of ion trap structures in quantum computation and simulation

Chenxu Wang, Ran He, Rui-Rui Li +6 more

Ion trap system is one of the main quantum systems to realize quantum computation and simulation. Various ion trap research groups worldwide jointly drive the continuous enrichment of ion trap structures, and develop a series of high-performance three-dimensional ion trap, two-dimensional ion trap chip, and ion traps with integrated components. The structure of ion trap is gradually developing towards miniaturization, high-optical-access and integration, and is demonstrating its outstanding ability in quantum control. Ion traps are able to trap increasingly more ions and precisely manipulate the quantum state of the system. In this review, we will summarize the evolution history of the ion trap structures in the past few decades, as well as the latest advances of trapped-ion-based quantum computation and simulation. Here we present a selection of representative examples of trap structures. We will summarize the progresses in the processing technology, robustness and versatility of ion traps, and make prospects for the realization of scalable quantum computation and simulation based on ion trap system.

Acta Physica Sinica•Jan 1, 2022•1 citation

Advances for Quantum-Inspired Optimization (abstract only)

Fred Glover, Gary A. Kochenberger

•Oct 1, 2022•0 citations

Trapped-Ion Quantum Computers

Cornelius Hempel

Abstract The trapped-ion architecture was the first platform to demonstrate quantum gate operations in 1995 and continues to be a leading candidate for building a fault-tolerant quantum computer. This chapter provides a brief background on common performance metrics and nomenclature, summarizes the state of the art, and places them in context within the larger pursuit of error-corrected quantum computers. Current research thrusts in academia and industry are referenced, and an example roadmap is examined to show where the platform is right now and where it might be headed on the road to realizing a scaled-up device.

Springer eBooks•Dec 1, 2025•2 citations

TEXT SUMMARIZATION IN QUANTUM COMPUTING

Mohamed, Muzamil

•Jan 1, 2024•0 citations
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.
Ion trap system is one of the main quantum systems to realize quantum computation and simulation. Various ion trap research groups worldwide jointly drive the continuous enrichment of ion trap structures, and develop a series of high-performance three-dimensional ion trap, two-dimensional ion trap chip, and ion traps with integrated components. The structure of ion trap is gradually developing towards miniaturization, high-optical-access and integration, and is demonstrating its outstanding ability in quantum control. Ion traps are able to trap increasingly more ions and precisely manipulate the quantum state of the system. In this review, we will summarize the evolution history of the ion trap structures in the past few decades, as well as the latest advances of trapped-ion-based quantum computation and simulation. Here we present a selection of representative examples of trap structures. We will summarize the progresses in the processing technology, robustness and versatility of ion traps, and make prospects for the realization of scalable quantum computation and simulation based on ion trap system.
Abstract The trapped-ion architecture was the first platform to demonstrate quantum gate operations in 1995 and continues to be a leading candidate for building a fault-tolerant quantum computer. This chapter provides a brief background on common performance metrics and nomenclature, summarizes the state of the art, and places them in context within the larger pursuit of error-corrected quantum computers. Current research thrusts in academia and industry are referenced, and an example roadmap is examined to show where the platform is right now and where it might be headed on the road to realizing a scaled-up device.