quantum algorithms:
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
An early example of an algorithm for which quantum computers are expected to drastically outperform classical computers.
Due to:
Review:
See also:
Last revised on September 27, 2022 at 04:41:34. See the history of this page for a list of all contributions to it.