The Call of the Open Sidewalk

From a place slightly to the side of the more popular path

User Tools

Site Tools


em:qanalog

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
em:qanalog [2026/11/18 10:14] – Odds and sods. RSS triggered b.walzerem:qanalog [2026/11/18 15:39] (current) – [Some Arguments Directly Addressed] We should provide all the code. b.walzer
Line 126: Line 126:
 //<sub>Simulated interference induced digital logic failure</sub>// //<sub>Simulated interference induced digital logic failure</sub>//
  
-Note that the interference tried to damage the transistor inputs by forcing the "mid" signal out of the normal range of the circuit but only got up to 4V and down to -0.7V. That is because of an intrinsic side effect ([[wp>Power_MOSFET#Body_diode|(body diode]]) of how this type of transistor is made. This protection wasn't planned, we just got lucky ... and by "we" I mean everyone because this is a feature of contemporary digital logic.+Note that the interference tried to damage the transistor inputs by forcing the "mid" signal out of the normal range of the circuit but only got up to 4V and down to -0.7V. That is because of an intrinsic side effect ([[wp>Power_MOSFET#Body_diode|body diode]]) of how this type of transistor is made. This protection wasn't planned, we just got lucky ... and by "we" I mean everyone because this is a feature of contemporary digital logic.
  
 I then copied the model files that represented the transistors and nerfed the transistors by reducing the gain by a factor of 10. Then I again determined what level of interference was required to cause a failure. The results: I then copied the model files that represented the transistors and nerfed the transistors by reducing the gain by a factor of 10. Then I again determined what level of interference was required to cause a failure. The results:
Line 252: Line 252:
 That was boring old regular error correction. Quantum error correction is a radically different thing... That was boring old regular error correction. Quantum error correction is a radically different thing...
  
-Shor's is inherently analog. So you *do* have to consider the analog processes. Shor's can't do regeneration. So we can't actually "correct" errors in the way that we can with gain based computing. Instead we have to somehow create a complete system with a lower chance of error at the end of processing. Oh, and we have to correct errors in phase as well. There have been many proposals for how to do this. Progress has been very slow. The point here is that applying error correction to a Shor's computer is much harder than to, say, a communications channel. The problem likely gets harder when you attempt to scale the system up.+Shor's is inherently analog. So you //do// have to consider the analog processes. Shor's can't do regeneration. So we can't actually "correct" errors in the way that we can with gain based computing. Instead we have to somehow create a complete system with a lower chance of error at the end of processing. Oh, and we have to correct errors in phase as well. There have been many proposals for how to do this. Progress has been very slow. The point here is that applying error correction to a Shor's computer is much harder than to, say, a communications channel. The problem likely gets harder when you attempt to scale the system up.
  
 Let's say we have manged to completely error correct the Shor's multiply/modulus step. Then we get to the next step of the process... Let's say we have manged to completely error correct the Shor's multiply/modulus step. Then we get to the next step of the process...
Line 373: Line 373:
 ^Wager against Shor's|possible exposure of past secrets|status quo                                  | ^Wager against Shor's|possible exposure of past secrets|status quo                                  |
  
-The cost of the loss of efficiency and security is practically unbounded. The cost due to the risk of exposed secrets is finite and for most people is quite low. If you believe as I do, that the chance of a working Shor's computer is very low, then the decision is simple: you would avoid a transition to PQ cryptography. You would only consider the transition if you thought the chance of a working Shor's computer was significant. +The cost of the loss of efficiency and security is practically unbounded. The cost due to the risk of exposed secrets is finite and for most people is quite low. If you believe as I do, that the chance of a working Shor's computer is very low, then the decision is simple: you would avoid a transition to PQ cryptography. You would only consider the transition if you thought the chance of a working Shor's computer was significant.
  
-"Harvest now, decrypt later" only applies to encryption. It does not apply to authentication. But yet there are PQ authentication methods mandated by the various national regulatory agencies. That would only make sense if there were some definite indication that a Shor's computer could actually be built.+"Harvest now, decrypt later" only applies to encryption. It does not apply to authentication. But yet there are PQ authentication methods mandated by the various national regulatory agencies. That would only make sense if there was some definite indication that a Shor's computer could actually be built. 
 + 
 +//The code for the examples can be found [[em:qanalog_code|here]].// 
 + 
 +[[em:index|Encrypted Messaging index]]\\ 
 +[[:|Home]]
  
em/qanalog.1794996863.txt.gz · Last modified: by b.walzer