Table of Contents
Quantum Computing in Action
Return to Quantum computers don’t exist yet!, Quantum, Quantum Computing, Quantum Computer, Quantum Mechanics
See Practical Quantum computer and Mikhail Dyakonov
Repeat after me:
Quantum Computing in Action from Manning - Quantum Computers Don't Exist!!! yet – Thus, they can't be “In Action”.
This book is just FUD.
Johan Vos (a Technocracy Big Tech Propagandist) has written about:
“Quantum computing is on the horizon and you can get started today! This practical, clear-spoken guide shows you don’t need a physics degree to write your first quantum software. In Quantum Computing in Action you will learn: An introduction to the core concepts of quantum computing Qubits and quantum gates, Superposition, entanglement, and hybrid computing, Quantum algorithms including Shor’s, Deutsch-jozsa, and Grover’s search, Quantum Computing in Action shows you how to leverage your existing Java skills into writing your first quantum software (also called Vaporware!!!!), so you’re ready for the fake quantum revolution. This book is focused on practical (fake) implementations of quantum computing algorithms — there’s no deep math or confusing theory ([fake theory]]). Using Strange, a Java-based quantum computer simulator (because THERE ARE NO ACTUAL QUANTUM COMPUTERS!!!!!), you’ll go fake hands-on with quantum computing’s fake core components including fake qubits and fake quantum gates.”
BUT…. They are just a theory and FUD and propaganda.
QC is just a theory. It really should be also called: Quantum computer theory because of the unsolvable problem of Quantum decoherence (do not omit the key word: Theory).
From Wikipedia: “Decoherence represents a challenge for the practical realization of quantum computers, since such quantum machines are expected to rely heavily on the undisturbed evolution of quantum coherences. Simply put, they require that the coherence of quantum states be preserved and that decoherence is 'managed', in order to actually perform quantum computation. The preservation of coherence, and mitigation of decoherence effects, are thus related to the theoretical concept of quantum error correction.”
In other words, REAL “Quantum computers don’t exist yet!” (See Practical Quantum computer and Mikhail Dyakonov) They are just FUD and Silicon Valley propaganda.
Do I need to Quantum Panic?
“Don't Panic!” - Don't worry.
“To summarize, quantum computers are a huge deal” ( IF THEY WERE REAL!) “for cryptography if they are realized. What’s the take away here? Do you need to throw everything you’re doing and transition to post-quantum algorithms? Well, it’s not that simple.” (RWEncrpt 2021)
“Ask any expert and you’ll receive different kinds of answers. For some, it’s 5 to 50 years away; for others, it’ll NEVER happen. Michele Mosca, the director of the Institute for Quantum Computing, estimated “a 1/7 chance of code breaking RSA-2048 by 2026 and a 1/2 chance by 2031.”” (RWEncrpt 2021)
“Mikhail Dyakonov, a researcher at the CNRS in France, stated publicly “Could we ever learn to control the more than 10300 continuously variable parameters defining the quantum state of such a system? My answer is simple. No, never.”” (RWEncrpt 2021)
“While physicists, not cryptographers, know better, they can still be incentivized to hype” (see FUD and propaganda) “their own research in order to get funding. As I am no physicist, I will simply say that we should remain skeptical of extraordinary claims, while preparing for the worst. The question is not “Will it work?”; rather, it’s “Will it scale?”” (RWEncrpt 2021)
“There exist many challenges for scalable quantum computers (which can destroy cryptography) to become a reality; the biggest ones seem to be about the amount of quantum noise and quantum errors that is difficult to reduce or correct. Scott Aaronson, a computer scientist at the University of Texas, puts it as “You’re trying to build a ship that remains the same ship, even as every plank in it rots and has to be replaced.”” (RWEncrpt 2021)
Excerpted from: Real-World Cryptography (RWEncrpt 2021)
- Snippet from Wikipedia: Quantum computing
A quantum computer is a computer that takes advantage of quantum mechanical phenomena.
On small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior, specifically quantum superposition and entanglement, using specialized hardware that supports the preparation and manipulation of quantum states.
Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster (with respect to input size scaling) than any modern "classical" computer. In particular, a large-scale quantum computer could break widely used encryption schemes and aid physicists in performing physical simulations; however, the current state of the technology is largely experimental and impractical, with several obstacles to useful applications. Moreover, scalable quantum computers do not hold promise for many practical tasks, and for many important tasks quantum speedups are proven impossible.
The basic unit of information in quantum computing is the qubit, similar to the bit in traditional digital electronics. Unlike a classical bit, a qubit can exist in a superposition of its two "basis" states. When measuring a qubit, the result is a probabilistic output of a classical bit, therefore making quantum computers nondeterministic in general. If a quantum computer manipulates the qubit in a particular way, wave interference effects can amplify the desired measurement results. The design of quantum algorithms involves creating procedures that allow a quantum computer to perform calculations efficiently and quickly.
Physically engineering high-quality qubits has proven challenging. If a physical qubit is not sufficiently isolated from its environment, it suffers from quantum decoherence, introducing noise into calculations. Paradoxically, perfectly isolating qubits is also undesirable because quantum computations typically need to initialize qubits, perform controlled qubit interactions, and measure the resulting quantum states. Each of those operations introduces errors and suffers from noise, and such inaccuracies accumulate.
In principle, a non-quantum (classical) computer can solve the same computational problems as a quantum computer, given enough time. Quantum advantage comes in the form of time complexity rather than computability, and quantum complexity theory shows that some quantum algorithms for carefully selected tasks require exponentially fewer computational steps than the best known non-quantum algorithms. Such tasks can in theory be solved on a large-scale quantum computer whereas classical computers would not finish computations in any reasonable amount of time. However, quantum speedup is not universal or even typical across computational tasks, since basic tasks such as sorting are proven to not allow any asymptotic quantum speedup. Claims of quantum supremacy have drawn significant attention to the discipline, but are demonstrated on contrived tasks, while near-term practical use cases remain limited.
Research It More
Fair Use Sources
© 1994 - 2024 Cloud Monk Losang Jinpa or Fair Use. Disclaimers
SYI LU SENG E MU CHYWE YE. NAN. WEI LA YE. WEI LA YE. SA WA HE.
Manning Publications: Manning Books Purchased by Cloud Monk, Manning Books Series, Manning Bibliography, In a Month of Lunches, In Action, Manning API Series, Manning "Functional Programming in" Series, Manning Concurrency Async Multithreaded Parallel Programming Series, Manning Grokking Series, Manning Java-JVM Languages Series (Manning Java Series, Manning Kotlin Series), Manning JavaScript Series, Manning TypeScript Series, Manning Microservices Series, Manning Python Series, Manning Security Series, Manning Spring Series, Manning SQL Series, Manning Database Series, Manning Data Science Series, Manning Mistakes and How to Avoid Them Series, Manning Books that were Cancelled, MEAP, Cloud Monk's Book Purchases, Cloud Monk Library. (navbar_manning)