SearcharxivSearch

arXiv · 2609.00475

Fractal dimension predicts quantum kernel collapse in angle-encoded data

Abstract

Angle-encoded quantum kernels on tabular data collapse when the feature map is wider than the intrinsic dimension of the data. We propose the correlation fractal dimension D2 as an a priori qubit budget: encode D2 coordinates chosen by FD-ASE instead of the PCA-95% width or all E attributes. On nine data sets and a statevector simulator (n= 32), a one-layer ZZ fidelity kernel at q=D2 stays geometrically alive while the same kernel at the PCA-95% width has already collapsed. The budget is map-dependent: product-state and IQP maps overshoot it; a second ZZ layer undershoots it. Packed dense-angle and re-uploading encodings still live at the fractal q, but not when PCA-95% features are stacked onto those qubits. Shrinking the angle bandwidth moves the ZZ knee later; stretching it kills the kernel earlier. On IBM Quantum (ibm_fez, 256 shots, n=8) the one-layer ZZ kernel at the fractal width matches the exact kernel (MAE 0.021); past that width both hardware and simulator have collapsed. The ceiling is a property of the map-data pair at a stated bandwidth, not of the classical table alone.

Explore related subjects

Keep this discovery

BibTeXRIS

Ana Paula Appel. 2026-08-31. Fractal dimension predicts quantum kernel collapse in angle-encoded data. https://arxiv.org/abs/2609.00475

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Quantum Machine Learning for Finance

Quantum computers are expected to surpass the computational capabilities of classical computers during this decade, and achieve disruptive impact on numerous industry sectors, particularly finance. In fact, finance is estimated to be the first industry sector to benefit from Quantum Computing not only in the medium and long terms, but even in the short term. This review paper presents the state of the art of quantum algorithms for financial applications, with particular focus to those use cases that can be solved via Machine Learning.

quant-ph

Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction

Quantum error correction is crucial for protecting quantum information against decoherence. Traditional codes like the surface code require substantial overhead, making them impractical for near-term, early fault-tolerant devices. We propose a novel objective function for tailoring error correction codes to specific noise structures by maximizing the distinguishability between quantum states after a noise channel, ensuring efficient recovery operations. We formalize this concept with the distinguishability loss function, serving as a machine learning objective to discover resource-efficient encoding circuits optimized for given noise characteristics. We implement this methodology using variational techniques, termed variational quantum error correction (VarQEC). Our approach yields codes with desirable theoretical and practical properties and outperforms standard codes in various scenarios. We also provide proof-of-concept demonstrations on IBM and IQM hardware devices, highlighting the practical relevance of our procedure.

quant-ph

Simulation-Based Evaluation of Energy-Constrained Quantum-Classical Competition

This paper develops a simulation-based framework for evaluating the energy implications of quantum and classical computing firms competing in a market with limited energy resources. We model providers as differentiated Cournot competitors whose feasible service capacity is induced by technology-specific energy scaling laws: polylogarithmic for quantum algorithms that achieve an equivalent computational target and polynomial for classical emulation. For symmetric groups of quantum and classical firms, the equilibrium reduces to a tractable two-equation system that supports large scenario sweeps over market size, technology mix, and hardware coefficients. We characterize the capacity-constrained Nash equilibrium, prove the existence of a demand scale beyond which quantum service becomes more energy efficient, and report numerical experiments calibrated to trapped-ion and Rydberg platforms. The results identify when quantum energy advantage is only asymptotic and when it becomes operationally relevant.

quant-ph