Semantic embedding for quantum algorithms
From MaRDI portal
Publication:6142803
DOI10.1063/5.0160910arXiv2304.14392OpenAlexW4390245860MaRDI QIDQ6142803
Publication date: 4 January 2024
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.14392
Quantum computation (81P68) Semantics in the theory of computing (68Q55) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum Arthur-Merlin games
- Verification of sequential and concurrent programs
- Schrödinger's pirate: how to trace a quantum decoder
- Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations
- A category-theoretic account of program modules
- Towards a quantum programming language
- Fixed-Point Quantum Search
- Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum programming languages: survey and bibliography
- An axiomatic basis for computer programming
- Computationally Binding Quantum Commitments
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Semantic embedding for quantum algorithms