quantum algorithms:
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
An early example of a algorithm for which quantum computers are expected to drastically outperform classical computers (cf. quantum algorithm).
Due to:
Review:
Implementation in Quipper:
See also:
Last revised on February 26, 2024 at 12:27:12. See the history of this page for a list of all contributions to it.