arXiv (All)
open access
Discovery of connectivity-trainability trade-off of IQP Circuits for Hamiltonian Optimization
data-analysisnumerical-analysisquantum-physicssocial-and-information-networksstatistics-and-probability
Instantaneous Quantum Polynomial-time (IQP) circuits are promising candidates for near-term quantum advantage due to the conjectured classical hardness of their sampling task. However, their capabilities for optimization remain largely unexplored. We present a systematic investigation of the perform
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
- AlchemQ: Proof-Carrying Quantum Circuit Optimization with Per-Result Equivalence Certificates#1013761
- Learning parameter curves in feedback-based quantum optimization algorithms#1144750
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory.#136047
- Quantum Feature Engineering for Credit Default Prediction: When and Why IQP Circuits Help Linear Classifiers#997377
Record · ID 1414560
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