arXiv (All)
open access
Prototype-Guided Optimization of Quantum Data Embeddings with Linear Cost
In supervised quantum machine learning with classical data, classification performance critically depends on the geometry induced by quantum data embedding. Existing data-adaptive approaches rely on pairwise fidelity evaluations between samples, which scale as $O(B^2)$ for $B$ samples and create a c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Supervised Learning with Quantum Hamiltonian Embeddings#1381225
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- Training Variational Quantum Algorithms Is NP-Hard, Even Locally#1201141
- Quantum Hamiltonian Evolution for Coherent Quantum Learning#926539
- When Quantum Meets AI: Quantum Methods for Machine Learning and Machine Learning Methods for Quantum Systems#1061278
Record · ID 1388969
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive