[Cryptography] REEQe

[Natanael]

Den fre 10 maj 2024 00:46Peter Fairbrother <peter at tsto.co.uk> skrev:

> Being a cryptologist not a quantum computer development engineer, I look
> at the capability of quantum computers primarily in terms of of how
> useful they might be for someday breaking cryptographic algorithms.
>
> I came up with the idea of REEQe, which stands for Reliable Entangled
> Error-free Qbits equivalent, as a measure of capability.
>
> First reliable - let's say they all work without error for one complete
> day in two. Entangled, well you can do QG without entangled qbits but
> entangled ones are much more useful. Error-free, that's obvious.
> Qualified by equivalent, so you can calculate an equivalent value for
> unreliable, non entangled and/or error-correcting QC's.
>
> Pretty sure it's a logarithmic scale of capability, and perhaps of
> difficulty. I figure we are at about 20 REEQe now, but icbw.
>
> Thoughts?
>
>
> Oh, and why does qubit have a u in it? Does it need one?
>

You also need to account for circuit depth with logic gates built from
qubits. But it's a starting point.

>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://www.metzdowd.com/pipermail/cryptography/attachments/20240510/ee7b0d14/attachment.htm>