constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
algebraic quantum field theory (perturbative, on curved spacetimes, homotopical)
quantum mechanical system, quantum probability
interacting field quantization
A search algorithm for quantum computers (cf. quantum algorithm) which is expected to produce quadratic speedup (from $O(N)$ to $O(\sqrt{N})$) compared to classical computers.
Due to:
Survey:
Lecture notes:
Realization in experiment with error detecting codes realizing quantum advantage:
Implementation in Quipper:
See also
Discussion in terms of quantum information theory via dagger-compact categories:
Review in:
Ali Nabi Duman, The Topology of Grover Algorithm (arXiv:1405.4425)
Kamil Khadiev, §§5-9 in: Lecture Notes on Quantum Algorithms [arXiv:2212.14205]
Last revised on February 26, 2024 at 12:28:18. See the history of this page for a list of all contributions to it.