arXiv (All)
open access
Quantisation of Abstract Data Types
In this paper, we introduce a notion of abstract quantum data type within the framework of universal algebra. This notion provides an algebraic foundation for describing data abstraction in quantum programming. We formally define a quantisation of classical data types and show that their equational
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
- Modal J-T* Algebra (Jónsson–Tarski): Weak Bisimulation invariants over Dual-Vector's and Quantale-Valued Modules for Concurrent AI and Quantum Programming#728635
- Quantum algorithms for equational reasoning.#193672
- Re-uploading quantum data: a universal function approximator for quantum inputs#635644
- Re-uploading quantum data: a universal function approximator for quantum inputs#633295
- Indistinguishability Right from the Start in Standard Quantum Mechanics#91393
Record · ID 926664
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