arXiv (All)
open access
Trapdoored Clifford Operators and Applications
Random Clifford operators have numerous applications in quantum computing, including randomized benchmarking, classical shadows, and quantum authentication. However, sampling and implementing uniformly random $n$-qubit Clifford incur near-quadratic complexity due to the size of Clifford group. We
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
- Trapdoored Clifford Operators and Applications#1160926
- On Some Cognitive Features of Clifford Algebraic Quantum Mechanics and the Origin of Indeterminism in this Theory: A Derivation of Heisenberg Uncertainty Principle by Using the Clifford Algebra#711836
- Faster Quantum Monte Carlo Simulation by Random Compilation#997362
- Spectral boundaries of deterministic matrices deformed by rotationally invariant random non-Hermitian ensembles#925932
- Extracting high fidelity quantum computer hardware from random systems#420804
Record · ID 1157119
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