arXiv:2607. 05307v1 Announce Type: cross Abstract: A core task in quantum anomaly detection is to compute an anomaly score that quantifies how strongly a test quantum state deviates from a given quantum dataset assumed to be normal.
By Yewei Yuan, Michele Minervini, Mark M. Wilde, Nana Liu
The paper introduces a classical algorithm that dequantizes a quantum sampler used for learning with optimized random features. By sampling heavy indices and reducing the transformation to a small principal block, the method produces a sparse classical representation with operator‑norm guarantees. This approach enables a classical sampler with specified accuracy and polynomial runtime, demonstrating that quantum block‑encoding factorizations can provide sufficient classical structure even when direct sampling access to the composite matrix is unavailable.
By Natsuto Isogai, Mio Murao, Hayata Yamasaki
arXiv:2510. 03389v2 Announce Type: replace-cross Abstract: Current quantum computers require algorithms that use limited resources economically.
By Jonas J\"ager, Philipp Els\"asser, Elham Torabian
arXiv:2608.24631v1 Announce Type: cross
Abstract: Similarity in many decision systems is governed not by distance alone but by interactions among variables. In fraud and anomaly detection, small loca...
By Hanqiu Peng, Jianlong Lu, Ying Chen
The paper introduces a quantum tensor network learning framework that employs matrix product states (MPS) as a machine‑learning architecture, adding a global normalization condition to interpret the MPS as a quantum state. It compares two optimization strategies—gradient descent and a DMRG‑adapted method—to identify locally optimal tensors and evaluates their effectiveness.
By Gustav J L J\"ager, Martin B Plenio, Hans-Martin Rieser
arXiv:2606. 26312v1 Announce Type: cross Abstract: Autoencoders transformed classical machine learning by solving the curse of dimensionality, enabling principled weight initialization and learning compact, structured representations.
By Aldo Lamarre, Dominik \v{S}afr\'anek
arXiv:2503.24111v4 Announce Type: replace-cross
Abstract: Graph Neural Networks (QGNNs) offer a promising approach to combining quantum computing with graph-structured data processing. While classica...
By Arthur M. Faria, Ignacio F. Gra\~na, Savvas Varsamopoulos
arXiv:2607. 09704v1 Announce Type: new Abstract: We present an exploratory benchmark and quantum-inspired modeling prototype for fraud screening in dynamic financial transaction graphs.
By Behnam Tonekaboni, Hiroshi Yamauchi
arXiv:2607. 07754v1 Announce Type: new Abstract: Pattern recognition problems arise in a variety of physical image processing situations, and convolutional neural networks are a popular scheme for the required feature extraction and classification tasks.
By Kumari Jyoti, Rohith Babu, Apoorva D. Patel
arXiv:2606. 27411v1 Announce Type: cross Abstract: We study a quantum autoencoder (QAE) for compression-driven anomaly detection in brain MRI data.
By Santanu Ganguly, Xing Liang, Dimitrios Makris
arXiv:2608. 19789v1 Announce Type: new Abstract: Developed as a workhorse for classical simulations of quantum algorithms and quantum many-body systems, Tensor Network methods have entered the scientific mainstream in quantum physics.
By Michal A. Sterzel, Marko J. Ran\v{c}i\'c
Hybrid Variational Quantum-Classical Framework with Adaptive Weighting and Efficiency Assessment introduces Sim‑HVQC, a hybrid deep quantum neural network that integrates an adaptive, parameter‑free SimAM weighting module with classical feature extraction to retain class‑discriminative information before encoding into a Variational Quantum Circuit. Unlike prior work limited to binary classification, this framework is trained and evaluated on multiple multi‑class datasets such as MNIST, KMNIST, Fashion‑MNIST, and EMNIST. The study highlights reproducibility, parameter efficiency, and interpretability through multi‑seed evaluation, parameter analysis, and latent/quantum feature inspection, with source code publicly available on GitHub.
By Dilli Hang Rai