arXiv (All)
open access
Quantum-echo Markov process for combinatorial optimization
We introduce a quantum-echo Markov process for combinatorial optimization. Quantum dynamics based on quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA) is used to engineer the transition kernel. Increasing the annealing time in QA or the number of layers in QAOA enables
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
- Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization#1156210
- Managing Iterative Hybrid Quantum-Classical Optimization as a First-Class Scientific Workflow#1104731
- Hybrid Quantum–Classical Optimization with Applications to Routing Problems / Peter Josef Eder ; Gutachter: Andre Luckow, Christian Mendl ; Betreuer: Christian Mendl#970330
- Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice#139085
- Setting angles in quantum approximate optimization at utility-scale#1076095
Record · ID 1143544
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