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

Quantum optimization algorithms for near-term hardware

Jernej Rudi Finžgar, Christian B. Mendl, Technische Universität München

Published Jan 1, 2025• 0 citations
OpenAlex

Related papers

Synergistic Dynamical Decoupling and Circuit Design for Enhanced Algorithm Performance on Near-Term Quantum Devices

Yanjun Ji, Ilia Polian

Dynamical decoupling (DD) is a promising technique for mitigating errors in near-term quantum devices. However, its effectiveness depends on both hardware characteristics and algorithm implementation details. This paper explores the synergistic effects of dynamical decoupling and optimized circuit design in maximizing the performance and robustness of algorithms on near-term quantum devices. By utilizing eight IBM quantum devices, we analyze how hardware features and algorithm design impact the effectiveness of DD for error mitigation. Our analysis takes into account factors such as circuit fidelity, scheduling duration, and hardware-native gate set. We also examine the influence of algorithmic implementation details, including specific gate decompositions, DD sequences, and optimization levels. The results reveal an inverse relationship between the effectiveness of DD and the inherent performance of the algorithm. Furthermore, we emphasize the importance of gate directionality and circuit symmetry in improving performance. This study offers valuable insights for optimizing DD protocols and circuit designs, highlighting the significance of a holistic approach that leverages both hardware features and algorithm design for the high-quality and reliable execution of near-term quantum algorithms.

arXiv:2405.17230•Entropy•Jul 10, 2024•12 citations

Optimization Using Quantum Algorithms

Kolla Bhanu Prakash

Wiley eBooks•Aug 17, 2026•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•76 citations

Further Quantum Algorithms and Hardware

Bettina Just

Springer eBooks•Jan 1, 2022•0 citations

Hybrid quantum-classical algorithms: Foundation, design and applications

Ran-Yi-Liu Chen, Benchi Zhao, Zhixin Song +3 more

Quantum computing, as an emerging computing paradigm, is expected to tackle problems such as quantum chemistry, optimization, quantum chemistry, information security, and artificial intelligence, which are intractable with using classical computing. Quantum computing hardware and software continue to develop rapidly, but they are not expected to realize universal quantum computation in the next few years. Therefore, the use of quantum hardware to solve practical problems in the near term has become a hot topic in the field of quantum computing. Exploration of the applications of near-term quantum hardware is of great significance in understanding the capability of quantum hardware and promoting the practical process of quantum computing. Hybrid quantum-classical algorithm (also known as variational quantum algorithm) is an appropriate model for near-term quantum hardware. In the hybrid quantum-classical algorithm, classical computers are used to maximize the power of quantum devices. By combining quantum computing with machine learning, the hybrid quantum-classical algorithm is expected to achieve the first practical application of quantum computation and play an important role in the studying of quantum computing. In this review, we introduce the framework of hybrid quantum-classical algorithm and its applications in quantum chemistry, quantum information, combinatorial optimization, quantum machine learning, and other fields. We further discuss the challenges and future research directions of the hybrid quantum-classical algorithm.

Acta Physica Sinica•Jan 1, 2021•13 citations

Quantum Computing on near term devices

Alessandro Baroni

•Feb 21, 2024•0 citations
Dynamical decoupling (DD) is a promising technique for mitigating errors in near-term quantum devices. However, its effectiveness depends on both hardware characteristics and algorithm implementation details. This paper explores the synergistic effects of dynamical decoupling and optimized circuit design in maximizing the performance and robustness of algorithms on near-term quantum devices. By utilizing eight IBM quantum devices, we analyze how hardware features and algorithm design impact the effectiveness of DD for error mitigation. Our analysis takes into account factors such as circuit fidelity, scheduling duration, and hardware-native gate set. We also examine the influence of algorithmic implementation details, including specific gate decompositions, DD sequences, and optimization levels. The results reveal an inverse relationship between the effectiveness of DD and the inherent performance of the algorithm. Furthermore, we emphasize the importance of gate directionality and circuit symmetry in improving performance. This study offers valuable insights for optimizing DD protocols and circuit designs, highlighting the significance of a holistic approach that leverages both hardware features and algorithm design for the high-quality and reliable execution of near-term quantum algorithms.
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.
Quantum computing, as an emerging computing paradigm, is expected to tackle problems such as quantum chemistry, optimization, quantum chemistry, information security, and artificial intelligence, which are intractable with using classical computing. Quantum computing hardware and software continue to develop rapidly, but they are not expected to realize universal quantum computation in the next few years. Therefore, the use of quantum hardware to solve practical problems in the near term has become a hot topic in the field of quantum computing. Exploration of the applications of near-term quantum hardware is of great significance in understanding the capability of quantum hardware and promoting the practical process of quantum computing. Hybrid quantum-classical algorithm (also known as variational quantum algorithm) is an appropriate model for near-term quantum hardware. In the hybrid quantum-classical algorithm, classical computers are used to maximize the power of quantum devices. By combining quantum computing with machine learning, the hybrid quantum-classical algorithm is expected to achieve the first practical application of quantum computation and play an important role in the studying of quantum computing. In this review, we introduce the framework of hybrid quantum-classical algorithm and its applications in quantum chemistry, quantum information, combinatorial optimization, quantum machine learning, and other fields. We further discuss the challenges and future research directions of the hybrid quantum-classical algorithm.