arXiv (All)
open access
Quantum-Assisted Unambiguous Discrimination of Pure States with Robustness Bounds
We propose a hybrid quantum-classical framework for the unambiguous discrimination of pure states by combining the noisy intermediate-scale quantum semidefinite program solver (NSS) with the reciprocal-state representation. In NSS, a given semidefinite program (SDP) is represented within a subspace
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
- Accessible Quantum Correlations Under Complexity Constraints#1144784
- Training Variational Quantum Algorithms Is NP-Hard, Even Locally#1201141
- Ancilla-assisted nondestructive discrimination of distributed GHZ-class states#975148
- Constrained minimax approximation for quantum signal processing#818979
- Constrained minimax approximation for quantum signal processing#808987
Record · ID 1387243
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