arXiv (All)
open access
Quantum matrix arithmetics with Hamiltonian evolution
The efficient implementation of matrix arithmetic operations underpins the speedups of many quantum algorithms. We develop a suite of methods to perform matrix arithmetics -- with the result encoded in the off-diagonal blocks of a Hamiltonian -- using Hamiltonian evolutions of input operators. We sh
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
- Diagonal-Budgeted Trotterization for Efficient Quantum Hamiltonian Simulation#280156
- Accelerating Locality-Driven Integration in Quantum Chemistry with Block-Structured Matrix Multiplication#175202
- Hybrid quantum-classical algorithms for high performance computing#357463
- Sign Embedding Quantum Algorithms for Matrix Equations and Matrix Functions#1049817
- Block Encoding of Sparse Matrices via Coherent Permutation#987467
Record · ID 821411
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