Data & Analytics

Coherence law for trainability in noisy equivariant quantum neural networks. U(1)-equivariant QNNs with light-cone gradient confinement, sector coherence rate as Rayleigh quotient, and open-system training law. Use when designing symmetric QNNs for noisy hardware, analyzing gradient survival under decoherence, or building noise-resilient quantum neural architectures.

Closed-loop decomposition of quantum probabilities from unitarity — Bargmann invariants as phase-invariant loop quantities, Born rule as quadratic structure from forward/reverse amplitude products. Connects quantum probability to number theory (loop invariants, cyclic groups) and statistics (phase-invariant estimation). Trigger words: closed-loop quantum probability, Bargmann invariant, unitarity, Born rule derivation, quantum interference, phase-invariant, cyclic loop.

CIM-BDD methodology — hybrid Bounded-Distance-Decoding solver that reduces LWE to QUBO via penalty-free mapping, using algebraic elimination and adaptive mixed-radix encoding for NISQ devices.

Methodology for canonical quantization of classical computational primitives (neurons, activation functions, energy-based models) into quantum ML models. Use when designing quantum neural architectures, constructing quantum Hamiltonians from classical energy functions, or developing hybrid quantum-classical training algorithms. Trigger words: canonical quantization, quantum neurons, quantum activation, quantum Hamiltonian, quantum machine learning primitives.

Generalized Bell-like inequality methodology for multiparticle entangled Schrodinger-cat-states. Quantum probability statistics unified formulation. Violation patterns for half-integer vs integer spins. Parity-dependent maximum violation bounds.

Analytical error bounds for truncated Baker-Campbell-Hausdorff and Zassenhaus formulas in unitary quantum problems.

**arXiv ID:** 2608.19043v1 **Authors:** Natacha Kuete Meli, Tolga Birdal, Prayag Tiwari, Vladislav Golyanik, Michael Moeller **URL:** http://arxiv.org/abs/2608.19043v1 **Utility Score:** 1.00

Quantum Viterbi decoding methodology for hidden quantum Markov models (HQMMs). Extends classical Viterbi algorithm to quantum sequential decision-making with proven advantage over classical diagonal strategies.

Quantum-inspired evolutionary optimization for non-convex ML landscapes using superposition-inspired probabilistic encoding and simulated tunneling to escape local optima. Use when classical optimizers (ADAM, GA, DE) get stuck in local minima on sparse signal recovery, robust regression, or any non-convex objective. Triggers: non-convex optimization, local optima escape, quantum tunneling optimizer, sparse signal recovery, robust regression, quantum evolutionary algorithm, superposition-inspi...

Quantum algorithms for graph triangle cut sparsification methodology. Uses quantum walks and Grover search to list triangles faster than classical bounds, enabling efficient construction of ε-sparsifiers for large-scale network analysis.

Qlustering: Unsupervised clustering via steady-state quantum transport in GKSL-governed quantum networks. Data encoded as input states, cluster assignments inferred from terminal output currents. Use when: quantum machine learning, unsupervised quantum clustering, GKSL master equation applications, open quantum network learning, quantum data clustering, or algorithm-hardware co-design for quantum ML.

Quantum and classical algorithms for topological data analysis (TDA) including persistent Betti numbers computation, simplicial complex construction, and persistence diagram interpretation. Use when analyzing topological features of data, persistent homology, Betti numbers, simplicial complexes, or topological data analysis. Triggers: TDA, 拓扑数据分析, Betti numbers, Betti数, persistent homology, 持久同调, simplicial complex, 单纯复形, quantum TDA, quantum topology.

Quantum Time Lower Bounds by Permutation Invariance. Use when analyzing quantum algorithms, complexity bounds, quantum ML architectures, or quantum error correction involving mathematical analysis and statistical methods.

Local tensor-train surrogates methodology for quantum machine learning models. Constructs fast, cheap, provably accurate classical surrogates of fully trained QML models within local patches of input data space. Combines Taylor polynomial approximation with tensor-train representation via empirical risk minimization. Use when implementing efficient quantum ML inference acceleration, tensor-train approximation of quantum circuits, or local surrogate modeling for QML.

Quantum tensor network methods for many-body quantum systems analysis. Combines belief propagation algorithms, tensor network expansions, and machine learning for efficient quantum state representation and computation. Use when: (1) analyzing many-body quantum systems, (2) designing tensor network architectures, (3) implementing belief propagation for quantum states, (4) compressing quantum state representations, (5) studying quantum entanglement patterns.

Quantum-like structure in AI language: Bell inequality violation and Bose-Einstein statistics in LLMs. Use when analyzing non-classical probability in language models, quantum cognition applied to AI, conceptual combinations in LLMs, evolutionary convergence of human and artificial cognition, or quantum statistical patterns in text generation.

Quantum statistical metrology methodology for multi-parameter quantum estimation using purification-based strategies. Covers quantum Cramér-Rao bounds, Holevo bounds, and sequential hypothesis testing for quantum state discrimination.

Neural network-based quantum state preparation methodology from arXiv:2605.31006. Trains classical neural networks to map input data directly to quantum circuit parameters, avoiding per-instance variational optimization. Achieves 0.992 fidelity on unseen images with 5000x runtime reduction.

Implement Quantum Signal Processing (QSP) using orthogonal polynomial theory. Derive QSP angles analytically for Hermite, Jacobi, and Rogers-Szego polynomial families. Achieve O(log(1/ε)) gate complexity for ε-approximation of smooth functions via Hermite series expansion. Use when implementing QSP circuits, finding QSP angles, approximating functions via quantum signal processing, or connecting orthogonal polynomials to quantum algorithms. arXiv: 2605.05321

Quantum Signal Processing (QSP) via orthogonal polynomial theory methodology. Provides analytical angle-finding for QSP protocols using Hermite, Jacobi, and Rogers-Szego polynomial expansions. Enables block-encoding of smooth functions with O(log(1/epsilon)) gate complexity. Use when: implementing quantum signal processing, quantum algorithm design with orthogonal polynomials, quantum function approximation, Hamiltonian simulation, quantum eigenvalue transformation, or designing efficient qua...

Quantum Reservoir Computing (QRC) methodology for financial time-series forecasting using small-scale quantum systems. Use when: building quantum-enhanced stock prediction models, applying reservoir computing to finance, designing near-term quantum ML for temporal data, or forecasting trading volumes/stock trends. Activation: quantum reservoir computing, QRC stock prediction, quantum time-series forecasting, quantum stock movement, reservoir computing finance.

Controllable quantum memory capacity methodology for quantum reservoir computing using tunable partial-SWAP gates. Unifies feedback-based and recurrent QRC architectures through partial-SWAP interpolation parameter, enabling controllable trade-off between memory capacity and processing speed. Use when: (1) designing quantum reservoir computing systems, (2) tuning quantum memory capacity, (3) choosing between feedback and recurrent QRC architectures, (4) implementing temporal quantum machine l...

Quantum Reservoir Computing (QRC) methodology for financial time-series forecasting. Uses small-scale quantum systems (≤6 qubits) as nonlinear reservoirs for stock trend classification with >86% accuracy. Platform-agnostic across superconducting circuits and trapped ions. Use when: (1) stock movement prediction, (2) financial time-series forecasting with quantum computing, (3) small-scale quantum advantage demonstration, (4) quantum reservoir computing, (5) quantum-invested market analysis.

Quantum Reservoir Computing (QRC) methodology for financial time series forecasting. Uses transverse-field Ising Hamiltonian as reservoir with distinct input and memory qubits to capture temporal dependencies. Benchmarked against econometric models and ML algorithms, consistently outperforms benchmarks. Use wrapper-based forward selection for feature selection and Shapley values for interpretability. Applicable to volatility forecasting, stock prediction, and quantitative finance. Also useful...