Semantic embedding for quantum algorithms
The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need h...
| मुख्य लेखकों: | , |
|---|---|
| अन्य लेखक: | |
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
AIP Publishing
2024
|
| ऑनलाइन पहुंच: | https://hdl.handle.net/1721.1/156910 |