A first approach to programming with quantum effects is the quantum λ-calculus [SV09].
Nevertheless, that language does not handle quantum programming as an algebraic effect, since
it requires measurement into classical data to control the flow of execution.
pp23 1st para has more of the same
In the quantum
λ-calculus, a qubit has to be measured before influencing the control of a program. These
models are not of interest to this thesis, because the use of measurement breaks superposition,
therefore it does not preserve the aforementioned quantum effect.
[SV09] Peter Selinger and Benoit Valiron. Quantum lambda calculus. Semantic techniques in quantum computation, pages 135–172, 2009.
Keye Martin: be right back (I didn't see much there either.)
in my own heap: one might be able to use Scott continuity to replace lemma 7?
Pay attention to how the "control gates" (as in SV09) are invoked
pp7:
The crucial step in Shor’s algorithm, after the quantum Fourier transform, is to take a quantum measurement, with the property that the probability of observing a state that is close to an integral multiple of 2^n/ω
is high.
pp12 has this speculation
>At its most fundamental
level, it is not permitted to ask the computing machine to scan a continuously deformed symbol
from ξ to ζ, while a mathematical homotopy can easily be envisioned.
gsf_emergency_2|7 months ago
pp22
A first approach to programming with quantum effects is the quantum λ-calculus [SV09]. Nevertheless, that language does not handle quantum programming as an algebraic effect, since it requires measurement into classical data to control the flow of execution.
pp23 1st para has more of the same
In the quantum λ-calculus, a qubit has to be measured before influencing the control of a program. These models are not of interest to this thesis, because the use of measurement breaks superposition, therefore it does not preserve the aforementioned quantum effect.
[SV09] Peter Selinger and Benoit Valiron. Quantum lambda calculus. Semantic techniques in quantum computation, pages 135–172, 2009.
Keye Martin: be right back (I didn't see much there either.)
in my own heap: one might be able to use Scott continuity to replace lemma 7?
https://arxiv.org/abs/2306.10072
pp6-10 "Corrupted geometric sum"
Pay attention to how the "control gates" (as in SV09) are invoked
pp7: The crucial step in Shor’s algorithm, after the quantum Fourier transform, is to take a quantum measurement, with the property that the probability of observing a state that is close to an integral multiple of 2^n/ω is high.
pp12 has this speculation
>At its most fundamental level, it is not permitted to ask the computing machine to scan a continuously deformed symbol from ξ to ζ, while a mathematical homotopy can easily be envisioned.
gsf_emergency_2|7 months ago
https://www.researchgate.net/publication/2843975_A_Partial_O...
pp80-82 Section 10.5.1 noise
Martin has an autobiographical chapter in the full book