arXiv (All)
open access
A Catalytic Algorithm for Transposing Unknown Qutrit Unitaries with Tight Query Bounds
We construct exact deterministic circuits for transposing and inverting an unknown qutrit unitary $U\in\mathrm{SU}(3)$ using only forward queries. Three queries prepare a catalyst independently of the input state. Four further queries implement transposition while returning the catalyst unchanged an
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
- Tight bounds for hybrid quantum-classical query algorithms#1215887
- Black Hole Radiation Decoding in the Haar Random Oracle Model#1216499
- Metrological Benchmarking of Random Quantum Circuits#1144193
- Quantum Query Complexity and Span Programs from Pre-Geometry#1199188
- Quantum Lazy Sampling and Path Recording for Any Group#1142732
Record · ID 1296671
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