arXiv (All)
open access
Sign Embedding Quantum Algorithms for Matrix Equations and Matrix Functions
We develop operator-output quantum algorithms for matrix equations and matrix functions using matrix-sign embeddings. For each problem, an augmented matrix $M$ is chosen so that the target operator is a block of $\text{sign}(M)$ or is recovered from blocks of $(I-\text{sign}(M))/2$. We approximate t
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
- Quantum matrix arithmetics with Hamiltonian evolution#821411
- Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms#670276
- Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms#668211
- Hybrid quantum-classical algorithms for high performance computing#357463
- Factorized Boolean representations for efficient quantum synthesis#819473
Record · ID 1049817
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