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:0911.0462 · Nuclear Physics B - Proceedings Supplements

Strange Bedfellows: Quantum Mechanics and Data Mining

Marvin Weinstein

Published Feb 1, 2010• 5 citations
arXivHTMLPDF
DOI
10.1016/j.nuclphysbps.2010.02.009

Related papers

Quantum Biology, Elementary Particles and Agriculture: Strange Bedfellows

Monendra

•Mar 12, 2018•0 citations

Data analysis meets quantum physics

S. Schramm

Nature•Oct 1, 2017•3 citations

Consciousness and Quantum Theory: Strange Bedfellows

Barry Loewer

Abstract When I look at the scale of the apparatus I know what it reads. Those absurdly delicate, hopelessly inaccessible, global correlations obviously vanish when they connect up with me. Whether this is because consciousness is beyond the range of phenomena that quantum mechanics is capable of dealing with, or because it has infinitely many degrees of freedom or special super selection rules of its own, I would not presume to guess. But this is a puzzle about consciousness that should not get mixed up with efforts to understand quantum mechanics as a theory of subsystem correlations in the nonconscious world.

Oxford University Press eBooks•Jan 23, 2003•4 citations

Quantum Mechanics and Data-Driven Physics

Claudio Conti

Quantum science and technology•Sep 4, 2023•0 citations

Transforming machine learning: An exploration of quantum algorithms and their applications

Y.V.R. Naga Pawan, Bhanu Prakash Kolla

Advances in computers•Aug 11, 2025•2 citations

Quantum Computing and Data Processing for Frequent Itemset Mining

Yen-Hsin HSU, Ya-Wen Teng, De-Nian Yang +3 more

Frequent Itemset Mining (FIM) is an important task in data analytics, where classical algorithms face scalability bottlenecks from the combinatorial growth of candidates and the memory overhead of their data structures. Inspired by recent developments in quantum computing, in this paper, we propose the Quantum Frequent-itemset Mining (QFM) data-processing framework for FIM. Following the level-wise structure of the itemset lattice, QFM introduces three mechanisms: (1) Bit-Vector Qubit Encoding for quantum data representation, which organizes transaction data into branchless bit-vectors to facilitate systematic uncomputation; (2) Mining-Aware Candidate Superposition, which prepares a quantum superposition over valid candidates at each lattice level rather than the full itemset lattice; and (3) Bit-Parallel Threshold Marking, which constructs a logarithmic-depth threshold-marking oracle for reliable repeated support verification within hardware coherence limits. We provide theoretical time complexity analysis, implement QFM on IBM Qiskit and Amazon Braket, and evaluate it on real-world datasets against representative classical baselines, where QFM achieves 96% improvement on average.

arXiv:2606.09209•Jun 8, 2026•0 citations
Abstract When I look at the scale of the apparatus I know what it reads. Those absurdly delicate, hopelessly inaccessible, global correlations obviously vanish when they connect up with me. Whether this is because consciousness is beyond the range of phenomena that quantum mechanics is capable of dealing with, or because it has infinitely many degrees of freedom or special super selection rules of its own, I would not presume to guess. But this is a puzzle about consciousness that should not get mixed up with efforts to understand quantum mechanics as a theory of subsystem correlations in the nonconscious world.
Frequent Itemset Mining (FIM) is an important task in data analytics, where classical algorithms face scalability bottlenecks from the combinatorial growth of candidates and the memory overhead of their data structures. Inspired by recent developments in quantum computing, in this paper, we propose the Quantum Frequent-itemset Mining (QFM) data-processing framework for FIM. Following the level-wise structure of the itemset lattice, QFM introduces three mechanisms: (1) Bit-Vector Qubit Encoding for quantum data representation, which organizes transaction data into branchless bit-vectors to facilitate systematic uncomputation; (2) Mining-Aware Candidate Superposition, which prepares a quantum superposition over valid candidates at each lattice level rather than the full itemset lattice; and (3) Bit-Parallel Threshold Marking, which constructs a logarithmic-depth threshold-marking oracle for reliable repeated support verification within hardware coherence limits. We provide theoretical time complexity analysis, implement QFM on IBM Qiskit and Amazon Braket, and evaluate it on real-world datasets against representative classical baselines, where QFM achieves 96% improvement on average.