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

arXiv:2302.00566 · Quantum Information Processing

NISQ-friendly measurement-based quantum clustering algorithms

Srushti Patil, Shreya Banerjee, Prasanta Kumar Panigrahi

Published Oct 8, 2024• 6 citations
arXivHTMLPDF
DOI
10.1007/s11128-024-04553-0

Related papers

Generative-Based Algorithm for Data Clustering on Hybrid Classical-Quantum NISQ Architecture

Julien Rauch, Damien Rontani, Stéphane Vialle

Lecture notes in computer science•Jan 1, 2024•1 citation

Circuit Design Informed Adaptive Variational Quantum Algorithms

Muhammad Umer, Dimitris G. Angelakis

Resource-efficient computation is of central importance in the noisy intermediate-scale quantum (NISQ) era, where decoherence, gate errors, and restricted qubit connectivity severely limit the reliable execution of quantum algorithms. In this work, we demonstrate that incorporating circuit design considerations is crucial for developing resource-efficient variational quantum algorithms. By focusing on the Hadamard test circuit architecture, hardware-aware qubit connectivity, and problem-specific adaptive framework, we analyze how circuit design constraints can systematically reduce the measurement overhead associated with repeated evaluations of the candidate gate pool in adaptive algorithms. Specifically, we demonstrate reductions in the required measurement resources ranging from at least 25% to as high as 50% - 55%. To assess the effectiveness of our approach, we investigate the ground state problem of the nonlinear Schrödinger equation. Overall, our work contributes to resource-friendly strategies for quantum computation and underscores that algorithmic frameworks should systematically integrate circuit design constraints with hardware-aware and problem-specific structures to enhance the practical feasibility of quantum devices in the NISQ era.

quant-pharXiv:2607.04110•Jul 7, 2026•1 citation

Data clustering on hybrid classical-quantum NISQ architecture with generative-based variational and parallel algorithms

Julien Rauch, Damien Rontani, Stéphane Vialle

Journal of Systems Architecture•May 6, 2025•4 citations

Hybrid quantum-classical framework for clustering

Antonin Lefevre

Elsevier eBooks•Jan 1, 2025•0 citations

Qsyn: A Developer-Friendly Quantum Circuit Synthesis Framework for NISQ Era and Beyond

Mu-Te Lau, Chin-Yi Cheng, Cheng-Hua Lu +12 more

In this paper, we introduce Qsyn, a novel quantum circuit synthesis (QCS) framework designed to facilitate the research, development, testing, and experimentation of QCS algorithms and tools. Our framework is more developer-friendly than other modern QCS frameworks in three aspects: (1) Qsyn provides a comprehensive command-line interface that enables developers to design various testing scenarios with ease and conduct flexible experiments on their algorithms. This feature significantly streamlines the development process, making it more efficient and user-friendly. (2) Qsyn offers detailed access to multiple data representations at different abstraction levels of quantum circuits. This capability allows developers to optimize their algorithms extensively, gaining deeper insights and control over the structure and behavior of quantum circuits. By understanding the intricacies of circuit design, developers can achieve higher levels of optimization and performance in their algorithms. (3) Qsyn implements a rigorous development flow and environment to help developers maintain high-quality standards using modern software engineering practices, including robust quality assurance measures like regression testing, continuous integration and continuous delivery (CI/CD) pipelines, and code linting. We demonstrate Qsyn's superior performance through fair comparisons with PyZX [1], highlighting its efficiency and optimization capabilities. By providing a unified and user-friendly development environment, Qsyn empowers researchers and developers to prototype, implement, and evaluate their QCS algorithms effectively.

arXiv:2405.07197•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2024•5 citations

Quantum approximate optimization and k-means algorithms for data clustering

Jirawat Saiphet, Sujin Suwanna, Thiparat Chotibut +1 more

Abstract Noisy intermediate-scale quantum (NISQ) devices are cutting-edge technology expected to demonstrate potential and advantages of quantum computing over classical computing. Its low number of qubits and imperfection from noises restrict running full-scale quantum algorithms on such devices; however, quantum advantages can still be obtained. To achieve quantum advantages from NISQ devices, the hybrid quantum-classical algorithms were introduced. Quantum approximate optimization algorithm (QAOA) is a variational hybrid algorithm, which utilizes a NISQ device as a sub-unit for specific tasks and performs most calculations on a classical computer. QAOA provides an approximate solution, with arbitrary precision as the number of operations increases, for optimization problems. In this work we investigate the possibility of applying QAOA to a clustering problem and compare its performance with the classical k-means algorithm. It turns out that the weights in graph connectivity can degrade the algorithm operation and make it more difficult to approximate the solution. We also benchmark the QAOA by comparing the approximated solutions with the exact one obtained from a classical clustering algorithm.

Journal of Physics Conference Series•Jan 1, 2021•3 citations
Resource-efficient computation is of central importance in the noisy intermediate-scale quantum (NISQ) era, where decoherence, gate errors, and restricted qubit connectivity severely limit the reliable execution of quantum algorithms. In this work, we demonstrate that incorporating circuit design considerations is crucial for developing resource-efficient variational quantum algorithms. By focusing on the Hadamard test circuit architecture, hardware-aware qubit connectivity, and problem-specific adaptive framework, we analyze how circuit design constraints can systematically reduce the measurement overhead associated with repeated evaluations of the candidate gate pool in adaptive algorithms. Specifically, we demonstrate reductions in the required measurement resources ranging from at least 25% to as high as 50% - 55%. To assess the effectiveness of our approach, we investigate the ground state problem of the nonlinear Schrödinger equation. Overall, our work contributes to resource-friendly strategies for quantum computation and underscores that algorithmic frameworks should systematically integrate circuit design constraints with hardware-aware and problem-specific structures to enhance the practical feasibility of quantum devices in the NISQ era.
In this paper, we introduce Qsyn, a novel quantum circuit synthesis (QCS) framework designed to facilitate the research, development, testing, and experimentation of QCS algorithms and tools. Our framework is more developer-friendly than other modern QCS frameworks in three aspects: (1) Qsyn provides a comprehensive command-line interface that enables developers to design various testing scenarios with ease and conduct flexible experiments on their algorithms. This feature significantly streamlines the development process, making it more efficient and user-friendly. (2) Qsyn offers detailed access to multiple data representations at different abstraction levels of quantum circuits. This capability allows developers to optimize their algorithms extensively, gaining deeper insights and control over the structure and behavior of quantum circuits. By understanding the intricacies of circuit design, developers can achieve higher levels of optimization and performance in their algorithms. (3) Qsyn implements a rigorous development flow and environment to help developers maintain high-quality standards using modern software engineering practices, including robust quality assurance measures like regression testing, continuous integration and continuous delivery (CI/CD) pipelines, and code linting. We demonstrate Qsyn's superior performance through fair comparisons with PyZX [1], highlighting its efficiency and optimization capabilities. By providing a unified and user-friendly development environment, Qsyn empowers researchers and developers to prototype, implement, and evaluate their QCS algorithms effectively.
Abstract Noisy intermediate-scale quantum (NISQ) devices are cutting-edge technology expected to demonstrate potential and advantages of quantum computing over classical computing. Its low number of qubits and imperfection from noises restrict running full-scale quantum algorithms on such devices; however, quantum advantages can still be obtained. To achieve quantum advantages from NISQ devices, the hybrid quantum-classical algorithms were introduced. Quantum approximate optimization algorithm (QAOA) is a variational hybrid algorithm, which utilizes a NISQ device as a sub-unit for specific tasks and performs most calculations on a classical computer. QAOA provides an approximate solution, with arbitrary precision as the number of operations increases, for optimization problems. In this work we investigate the possibility of applying QAOA to a clustering problem and compare its performance with the classical k-means algorithm. It turns out that the weights in graph connectivity can degrade the algorithm operation and make it more difficult to approximate the solution. We also benchmark the QAOA by comparing the approximated solutions with the exact one obtained from a classical clustering algorithm.