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

International Conference on Internet of Things, Big Data and Security (IoTBDS)

Quantum Clustering on Streaming Data: A Novel Method for Analyzing Big Data

Rebecca Hofer, Kevin Mallinger

Published Jan 1, 2023• 1 citation
Publisher
DOI
10.5220/0011764200003482

Related papers

An investigation on support vector clustering for big data in quantum paradigm

Arit Kumar Bishwas, Ashish Mani, Vasile Palade

arXiv:1804.10905•Quantum Information Processing•Feb 11, 2020•16 citations

Quantum-Accelerated Big Data Clustering Techniques: Scalable Quantum Encoding for High-Dimensional Datasets

S. Venkatakiran, Noor Basha, Amolkumar Jadhav +2 more

International Conference on Computational and Cognitive Systems Science•Jan 1, 2025•0 citations

Methods and algorithms for processing big data using quantum algorithms

A.R. Akhatov, S.S. Kenjayev, U.R. Shadiyev +1 more

Nowadays, as a result of the development of information technology, there is a large flow of information. These data streams permeate every industry today. Analyzing and implementing this data through efficient processing and obtaining high results increases the relevance of the important research work called big data. This article presents an analysis of big data and approaches to its processing based on the analysis of materials from various sources. At the same time, general hypotheses of the approach to storing and processing big data using quantum computing, which is one of the modern approaches to processing big data, are presented.

CRC Press eBooks•Jun 27, 2024•0 citations

Transforming Big Data with Quantum Computing: Algorithmic Innovations and Applications

Pradnya Samit Mehta, Yash Kishor Maske, Sakshi Abasaheb Lokhande +1 more

Studies in big data•Jan 1, 2026•0 citations

An Incremental Tensor-Train Decomposition for Cyber-Physical-Social Big Data

Huazhong Liu, Laurence Tianruo Yang, Yimu Guo +2 more

Cyber-physical-social big data generated from ubiquitous devices and diverse spaces generally are multi-source, heterogeneous, and deeply intertwined. To efficiently analyze and handle the ubiquitous cyber-physical-social big data, tensor is considered as an effective tool, but the curse of dimensionality is still the main bottleneck of tensor-based big data analysis. Tensor networks can considerably alleviate or overcome it through the tensor approximate theory. Therefore, this paper focuses on developing an efficient big data processing framework based on tensor networks and providing an incremental tensor train decomposition approach for the streaming big data. Concretely, this paper first presents a hierarchical cyber-physical-social big data processing framework composed of three planes, namely, data representation and decomposition, data storage and processing, and data analysis and service, in which tensor train (TT) and quantized TT decompositions are particularly introduced to remarkably overcome the curse of dimensionality. Besides, to efficiently handle the continuous streaming big data and avoid the repeated decomposition for the history data, an incremental tensor train decomposition (ITTD) approach is proposed and the complexities are further analyzed in detail. Experimental results demonstrate that ITTD demonstrably outperforms the nonincremental TT decomposition in execution time on the precise of guaranteeing the nearly equal approximation error.

IEEE Transactions on Big Data•Aug 29, 2018•58 citations

Harmonic mean similarity based quantum annealing for k-means

Jo Takano, Toshiaki Omori

Clustering is an important machine learning approach in analyzing big data. In this study, we propose a clustering method using quantum annealing (QA) based on harmonic average of purity and inverse purity. By using harmonic average of purity and inverse purity, we introduce the effect of quantum noise for clustering algorithm while considering both quality of clusters and quality of categories. Using benchmark data, we show the effectiveness of the proposed QA clustering based on the harmonic average of purity and inverse purity.

Procedia Computer Science•Jan 1, 2018•3 citations
Nowadays, as a result of the development of information technology, there is a large flow of information. These data streams permeate every industry today. Analyzing and implementing this data through efficient processing and obtaining high results increases the relevance of the important research work called big data. This article presents an analysis of big data and approaches to its processing based on the analysis of materials from various sources. At the same time, general hypotheses of the approach to storing and processing big data using quantum computing, which is one of the modern approaches to processing big data, are presented.
Cyber-physical-social big data generated from ubiquitous devices and diverse spaces generally are multi-source, heterogeneous, and deeply intertwined. To efficiently analyze and handle the ubiquitous cyber-physical-social big data, tensor is considered as an effective tool, but the curse of dimensionality is still the main bottleneck of tensor-based big data analysis. Tensor networks can considerably alleviate or overcome it through the tensor approximate theory. Therefore, this paper focuses on developing an efficient big data processing framework based on tensor networks and providing an incremental tensor train decomposition approach for the streaming big data. Concretely, this paper first presents a hierarchical cyber-physical-social big data processing framework composed of three planes, namely, data representation and decomposition, data storage and processing, and data analysis and service, in which tensor train (TT) and quantized TT decompositions are particularly introduced to remarkably overcome the curse of dimensionality. Besides, to efficiently handle the continuous streaming big data and avoid the repeated decomposition for the history data, an incremental tensor train decomposition (ITTD) approach is proposed and the complexities are further analyzed in detail. Experimental results demonstrate that ITTD demonstrably outperforms the nonincremental TT decomposition in execution time on the precise of guaranteeing the nearly equal approximation error.
Clustering is an important machine learning approach in analyzing big data. In this study, we propose a clustering method using quantum annealing (QA) based on harmonic average of purity and inverse purity. By using harmonic average of purity and inverse purity, we introduce the effect of quantum noise for clustering algorithm while considering both quality of clusters and quality of categories. Using benchmark data, we show the effectiveness of the proposed QA clustering based on the harmonic average of purity and inverse purity.