arXiv (All)
open access
Certifying bipartite entanglement on a superconducting processor from a corrected QAOA cost layer
The Quantum Approximate Optimisation Algorithm is the canonical near-term heuristic, yet on real superconducting hardware its behaviour is set by device physics, not by the algorithm. Hardware demonstrations rarely prove the intended coupling is realised, that genuine entanglement is prepared, or wh
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
- Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA#1011048
- A hardware-efficient Berkeley gate for superconducting quantum processors.#266958
- Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware#792535
- Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware#788535
- Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits.#244291
Record · ID 987236
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