Cover Image

Toward Quantum Utility in Finance: A Robust Data-Driven Algorithm for Asset Clustering

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sharma, Shivam, Venkatesh, Supreeth Mysore, Kachroo, Pushkin
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Machine Learning 05-08 F.4.1; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

i-QLS: Quantum-supported Algorithm for Least Squares Optimization in Non-Linear Regression
by: Venkatesh, Supreeth Mysore, et al.
Published: (2025)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
by: Bodirsky, Manuel, et al.
Published: (2024)

Incremental Selection of Most-Filtering Conjectures and Proofs of the Selected Conjectures
by: Ngouonou, Jovial Cheukam, et al.
Published: (2025)

Complexity Classification Transfer for CSPs via Algebraic Products
by: Bodirsky, Manuel, et al.
Published: (2022)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

Robustness of Approval-Based Multiwinner Voting Rules
by: Faliszewski, Piotr, et al.
Published: (2026)

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

MathPartner: An Artificial Intelligence Cloud Service
by: Malaschonok, Gennadi, et al.
Published: (2024)

Approximating the operator norm of local Hamiltonians via few quantum states
by: Becker, Lars, et al.
Published: (2025)

Extension property for partial automorphisms of the $n$-partite and semigeneric tournaments
by: Hubička, Jan, et al.
Published: (2024)

Introducing The Maximum Common Bigraph Problem
by: Burns, Kyle, et al.
Published: (2026)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
by: Sau, Ignasi, et al.
Published: (2026)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
by: Conneryd, Jonas, et al.
Published: (2025)

On bounded depth proofs for Tseitin formulas on the grid; revisited
by: Håstad, Johan, et al.
Published: (2022)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
by: de Rezende, Susanna F., et al.
Published: (2026)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
by: de Rezende, Susanna F., et al.
Published: (2024)

Supercritical Tradeoffs for Monotone Circuits
by: Göös, Mika, et al.
Published: (2024)

Notes on CSPs and Polymorphisms
by: Brady, Zarathustra
Published: (2022)

The Fluted Fragment with Transitive Relations
by: Pratt-Hartmann, Ian, et al.
Published: (2020)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
by: Bodirsky, Manuel, et al.
Published: (2023)

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol
by: Praveen, M., et al.
Published: (2024)

Forbidden cycles in metrically homogeneous graphs
by: Hubička, Jan, et al.
Published: (2018)

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
by: Kazakov, Yevgeny, et al.
Published: (2009)

Computing Non-Repetitive Sequences with a Computable Lefthanded Local Lemma
by: Mourad, Daniel
Published: (2024)

A combinatorial proof of the extension property for partial isometries
by: Hubička, Jan, et al.
Published: (2018)

Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms
by: Macaskill-Smith, Zachary, et al.
Published: (2026)

$γ(3,4)$ `Attention' in Cognitive Agents: Ontology-Free Knowledge Representations With Promise Theoretic Semantics
by: Burgess, Mark
Published: (2025)

CLS-CAD: Synthesizing CAD Assemblies in Fusion 360
by: Chaumet, Constantin, et al.
Published: (2023)

A knowledge-driven framework for synthesizing designs from modular components
by: Chaumet, Constantin, et al.
Published: (2023)

When do homomorphism counts help in query algorithms?
by: Cate, Balder ten, et al.
Published: (2023)

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
by: Grotenhuis, Lide, et al.
Published: (2026)

Computing the second and third systoles of a combinatorial surface
by: Ebbens, Matthijs, et al.
Published: (2024)

Improved Parallel Algorithms for Baumslag Groups
by: Mattes, Caroline, et al.
Published: (2022)

Directional Non-Commutative Monoidal Embeddings for MNIST
by: Godavarti, Mahesh
Published: (2025)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
by: Grabmayer, Clemens
Published: (2024)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)