Showing changes from revision #11 to #12:
Added | Removed | Changed
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
\linebreak
\linebreak
quantum probability theory – observables and states
\linebreak
\linebreak
quantum algorithms:
\linebreak
\linebreak
In quantum information theory and quantum computing, by a q-bit (or qubit) one means a quantum state in a 2-dimensional complex Hilbert space of states.
Hence the quantum data type is the 2-dimensional complex vector space equipped with its canonical quantum measurement-basis
Analogous higher- but still finite- -dimensional quantum data (types) are called qdits (“qtrits” for ).
In geometric quantization qbits are naturally understood as the states given by the geometric quantization of the 2-sphere for prequantum line bundle (plus metaplectic correction) being of unit first Chern class. See at geometric quantization of the 2-sphere – The space of quantum states.
The term q-bit goes back to
and was popularized by early adoption such as in
See also:
Laboratoy-realizations of qbits for use in quantum computers:
Revision on November 20, 2022 at 13:07:21 by Urs Schreiber See the history of this page for a list of all contributions to it.