arXiv (All)
open access
Encoding universal quantum computation into quantized Berry phases: Hardness results and classical algorithms
The Berry phase is a fundamental geometric quantity for characterizing the geometry and topology of quantum many-body systems. Previous work established a super-polynomial quantum advantage in Berry phase estimation at inverse-polynomial precision, given an ansatz state approximating the initial gro
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
- Remote state preparation of a single-spin state via hybrid spin-photon entanglement#1155767
- Exact Quantum Maxima of the $n$-Cycle Overlap Inequalities#1144799
- Simultaneously Query-Optimal Quantum Linear-System Algorithm#1118759
- Approximate Quantum State Preparation Through Proximal Policy Optimization#394428
- Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints#799830
Record · ID 1132400
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