Difference between revisions of "Darwin2049/ChatGPT4/QuantumElements"
Jump to navigation
Jump to search
Darwin2049 (talk | contribs) |
Darwin2049 (talk | contribs) |
||
| Line 1: | Line 1: | ||
'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://arguably.io/Darwin2049/ChatGPT4/PhaseShift Phase Shift]</SPAN>''''' | |||
<!-- Quantum Elements --> | <!-- Quantum Elements --> | ||
<!-- 2023.11.24 --> | <!-- 2023.11.24 --> | ||
Revision as of 22:24, 24 November 2023
- Basics Overview and background historical context.
- IBM Quantum System Two - Osprey - 432 Q-Bit Device.
- Some Overview.
- Hadamard Gates.
- Bloch Sphere.
- Watch
- Bloch Sphere Coordinate Mapping
- Simplified
- {Zero:One} Bounded Solutions.
- Vector Space.Quantum computing uses vector spaces to represent potential computational outcomes; an understanding Qu-bit values requires an understanding of values are represented at a quantum level.
- P/NP Complete Problems.
- Entanglement.
- Coherence.
- Crucial recent improvements (1000 Q-Bits).
- Superposition.
- Quantum Logic: AND OR NOR NAND XOR.
- Error Correcting.
- Quantum Problem Space.
- Lots More
- Algorithms.
- Shor’s Algorithm. Is a powerful tool for factoring extremely large prime numbers. Quantum computers can collapse the time and effort required to factor large prime numbers. With the ability to factor large prime numbers it becomes possible to crack RSA encryption.
- Explained Simply.
- Using simple mathematics.
- Shor’s Algorithm – illustrated.
- Step by step.
- Grover’s Algorithm. This is an algorithm developed in 1996 by Lov Grover. It leverages quantum computing to collapse the amount of time needed to perform a search of N unordered elements. Note that a crucial factor is that in performing the search for a specific element that meets a set of desired criteria, any evaluation of an element in the set yields no information about which other element in the set of N elements might help determine the desired one.
- Somewhat abstruse video of how Grover’s Algorithm reduces search cost from N to N1/2.
- Deutsch’s Algorithm.
- Uses
- Encryption.
- Drug Design. Designing novel molecular substances with extremely specific structures will become possible in unexpectedly short times.
- Process Optimization
The Traveling Salesman problem is one that a quantum system can solve instantly. Extending this approach to optimizing new complex processes means that the most efficient process organizations will become instantly accessible. - AI.Deep Learning systems will be profoundly impacted by quantum computing. Learning times will collapse.
- DevLeliw
- Qiskit (IBM). Basic Idea
- "Sand box:" Quantum Computing practice environments.
- Useful Insights.
- Five very important quantum algorithms