Or asked differently.

What speed-up could a N-qubit quantum computer give
to this problem, find a positive integer tripple (x,y,z) such that:

x^3 + y^3 + 42 = z^3

Mild Shock schrieb:

Moron, you didn't answer my question:

https://en.wikipedia.org/wiki/Lattice-based_cryptography
What non-classical complexity reductions do they have?

classical = non-quantum
non-classical = quantum

You can also go here:

https://www.bsi.bund.de/EN/Themen/Unternehmen-und-Organisationen/Informationen-und-Empfehlungen/Quantentechnologien-und-Post-Quanten-Kryptografie/Post-Quanten-Kryptografie/post-quanten-kryptografie_node.html

And here:

https://www.bsi.bund.de/EN/Themen/Unternehmen-und-Organisationen/Informationen-und-Empfehlungen/Quantentechnologien-und-Post-Quanten-Kryptografie/Post-Quanten-Kryptografie/Gitterbasierte-Kryptografie/gitterbasierte_kryptografie_node.html

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

Lets say you don't trust what a quantum computer
finds as a tripple for (x,y,z) to satisfy:

x^3 + y^3 + 42 = z^3

You could then view it as a candidate triple
only, and still feed it into a normal computer

and see whether it is a solution. Kind of combining
approximate search with exact verification.

Mild Shock schrieb:

You can also use oversampling:

the Noisy Intermediate Scale Quantum (NISQ) era,
where the same program is run thousands of times to
generate a probability distribution to reveal the most likely result

Mild Shock schrieb am Samstag, 6. Januar 2024 um 10:38:15 UTC+1:

And? Who cares? As long as the wave function collapse is
inside a certain error range, you can read off your qubit.

Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures >> Reading a qubit is a fundamental operation in quantum computing.
It translates quantum information into classical information
enabling subsequent classification to assign the qubit states ‘0’ or
‘1’. Unfortunately, qubit readout is one of the most error-prone
and slowest operations on a superconducting quantum processor.
On state-of-the-art superconducting quantum processors, readout
errors can range from 1-10%. These errors occur for various reasons
– crosstalk, spontaneous state transitions, and excitation caused by
the readout pulse. The error-prone nature of readout has resulted
in significant research to design better discriminators to achieve
higher qubit-readout accuracies. High readout accuracy is essential
for enabling high fidelity for near-term noisy quantum computers
and error-corrected quantum computers of the future
https://arxiv.org/pdf/2212.03895.pdf
Ross Finlayson schrieb am Samstag, 6. Januar 2024 um 00:04:19 UTC+1:

Besides, don't you know that in Bohmian mechanics there are hidden variables
what result the non-standard probabilities of quantum amplitudes result back
a sort of, ...., continuum mechanics?

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

Ernst Specker was very creative. Did he create
the word “Infuturabilien”? It seems so:

“In a certain sense the scholastic speculations
about the “Infuturabilien” [this term invented by
Specker is to be translated as something like
‘future contingencies’] also belong here, that is,
the question whether the omniscience of God
also extends to events that would have occurred
in case something would have happened that
did not happen. (cf. e.g. [3], Vol. 3, p. 363.)” https://ar5iv.labs.arxiv.org/html/1712.06448

I guess he was just once again fooling around.
But the above arxiv link is interesting,
since one finds his famous riddle, that he

used in class to motivate young students,
not behind a paywall, but as a HTML:

The “Assyrian prophet” parable
https://ar5iv.labs.arxiv.org/html/1712.06448

Mild Shock schrieb:

Rossy Boy halucinated:

I suppose you can rank old Mostowski Collapse

I don't use this nick name anymore, after somebody
asked me whether this refers to wave function collapse .

https://en.wikipedia.org/wiki/Wave_function_collapse

But my intention was rather:

https://en.wikipedia.org/wiki/Mostowski_collapse_lemma

P.S.: But later I was reading a little bit about
wave function collapse and at the same time generative
AI, such as scribble diffusion started to blossom:

https://scribblediffusion.com/

Guess whats behind it? But recently wave function collapse
is hunting me again. What is behind all this quantum crypto-
graphy? How about lattice based cryptography?

https://en.wikipedia.org/wiki/Lattice-based_cryptography

What non-classical complexity reductions do they have?

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)