Difference between revisions of "Darwin2049/ChatGPT4/QuantumElements"
Jump to navigation
Jump to search
Darwin2049 (talk | contribs) |
Darwin2049 (talk | contribs) |
||
| (5 intermediate revisions by the same user not shown) | |||
| Line 15: | Line 15: | ||
**'''''Superposition.''''' | **'''''Superposition.''''' | ||
**'''''Quantum Problem Space.''''' | **'''''Quantum Problem Space.''''' | ||
*'''''[https://www.wikiwand.com/en/Quantum_algorithm Algorithms.]''''' (List of quantum algorithms); | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.wikiwand.com/en/Quantum_algorithm Algorithms.]''''' (List of quantum algorithms); | ||
--> | --> | ||
<!-- 2023.11.17: now... merge the above list with the one below and finish filling in the references, images and links; then push the reference stuff --> | <!-- 2023.11.17: now... merge the above list with the one below and finish filling in the references, images and links; then push the reference stuff --> | ||
| Line 35: | Line 22: | ||
<!-- 2023.11.21: a lot of redundancy here - collapse out the redundant labels and entries --> | <!-- 2023.11.21: a lot of redundancy here - collapse out the redundant labels and entries --> | ||
<!-- 2023.11.21: make each salient entry structurally consistent: text, image, video; next topic; --> | <!-- 2023.11.21: make each salient entry structurally consistent: text, image, video; next topic; --> | ||
*'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=CytwIKt1P_0&ab_channel=devdeliw Basics ]''''' Overview and background historical context. | |||
*'''''[https://www.youtube.com/watch?v=CytwIKt1P_0&ab_channel=devdeliw Basics ]''''' Overview and background historical context. | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://newsroom.ibm.com/2022-11-09-IBM-Unveils-400-Qubit-Plus-Quantum-Processor-and-Next-Generation-IBM-Quantum-System-Two IBM Quantum System Two] - Osprey - 432 Q-Bit Device.''''' | ||
*'''''[https://newsroom.ibm.com/2022-11-09-IBM-Unveils-400-Qubit-Plus-Quantum-Processor-and-Next-Generation-IBM-Quantum-System-Two IBM Quantum System Two] - Osprey - 432 Q-Bit Device.''''' | |||
<!-- *'''''"[https://quantumzeitgeist.com/top-10-free-resources-for-quantum-computing/ Sand box:" Quantum Computing practice environments.]''''' --> | <!-- *'''''"[https://quantumzeitgeist.com/top-10-free-resources-for-quantum-computing/ Sand box:" Quantum Computing practice environments.]''''' --> | ||
*'''''[https://www.youtube.com/watch?v=-UlxHPIEVqA&ab_channel=DomainofScience Some Overview.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=-UlxHPIEVqA&ab_channel=DomainofScience Some Overview.]</SPAN>''''' | ||
*'''''[https://physics.stackexchange.com/questions/313959/visual-interpretation-on-the-bloch-sphere-when-hadamard-gate-is-applied-twice Hadamard Gates.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://physics.stackexchange.com/questions/313959/visual-interpretation-on-the-bloch-sphere-when-hadamard-gate-is-applied-twice Hadamard Gates.]</SPAN>''''' | ||
*'''''[https://www.wikiwand.com/en/Bloch_sphere Bloch Sphere.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.wikiwand.com/en/Bloch_sphere Bloch Sphere.]</SPAN>''''' | ||
*'''''[https://www.youtube.com/watch?v=AYGHS9hXgyw&ab_channel=PrettyMuchPhysics Watch]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=AYGHS9hXgyw&ab_channel=PrettyMuchPhysics Watch]</SPAN>''''' | ||
*'''''[https://www.youtube.com/watch?v=lqWSziZJsLs&ab_channel=ProfessorNanoScience Bloch Sphere Coordinate Mapping]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=lqWSziZJsLs&ab_channel=ProfessorNanoScience Bloch Sphere Coordinate Mapping]</SPAN>''''' | ||
*'''''[https://www.youtube.com/watch?v=a-dIl1Y1aTs&ab_channel=mu-hoch-3 Simplified]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=a-dIl1Y1aTs&ab_channel=mu-hoch-3 Simplified]</SPAN>''''' | ||
*'''''{Zero:One} Bounded Solutions.''''' | *'''''{Zero:One} Bounded Solutions.''''' | ||
*'''''Vector Space. | *'''''Vector Space.<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=ozwodzD5bJM&ab_channel=Socratica Quantum computing uses vector spaces]</SPAN>''''' 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.''''' | *'''''P/NP Complete Problems.''''' | ||
*'''''[https://www.youtube.com/watch?v=nxIGNbcVKtA&ab_channel=Josh%27sChannel Entanglement.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=nxIGNbcVKtA&ab_channel=Josh%27sChannel Entanglement.]</SPAN>''''' | ||
*'''''[https://phys.org/news/2023-11-quantum-error-mitigation-prototype-coherent.html Coherence.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://phys.org/news/2023-11-quantum-error-mitigation-prototype-coherent.html Coherence.]</SPAN>''''' | ||
*'''''[https://atom-computing.com/quantum-startup-atom-computing-first-to-exceed-1000-qubits/ Crucial recent improvements (1000 Q-Bits).]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://atom-computing.com/quantum-startup-atom-computing-first-to-exceed-1000-qubits/ Crucial recent improvements (1000 Q-Bits).]</SPAN>''''' | ||
*'''''[https://www.youtube.com/watch?v=SGNAEpVSp9M&ab_channel=BRIGHTSIDE Superposition.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=SGNAEpVSp9M&ab_channel=BRIGHTSIDE Superposition.]</SPAN>''''' | ||
*'''''Quantum Logic: AND OR NOR NAND XOR.'''''<BR /> | *'''''Quantum Logic: AND OR NOR NAND XOR.'''''<BR /> | ||
*'''''Error Correcting.'''''<BR /> | *'''''Error Correcting.'''''<BR /> | ||
*'''''Quantum Problem Space.'''''<BR /> | *'''''Quantum Problem Space.'''''<BR /> | ||
*'''''[https://www.youtube.com/@quantumcomputing2985/videos Lots More]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/@quantumcomputing2985/videos Lots More]</SPAN>''''' | ||
*'''''[https://www.youtube.com/@quantum-soar/videos Algorithms.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/@quantum-soar/videos Algorithms.]</SPAN>''''' | ||
*'''''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. <BR /> | *'''''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. <BR /> | ||
*'''''[https://kaustubhrakhade.medium.com/shors-factoring-algorithm-94a0796a13b1 Explained Simply.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://kaustubhrakhade.medium.com/shors-factoring-algorithm-94a0796a13b1 Explained Simply.]</SPAN>''''' | ||
*'''''[https://scottaaronson.blog/?p=208 Using simple mathematics.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://scottaaronson.blog/?p=208 Using simple mathematics.]</SPAN>''''' | ||
*'''''[https://www.youtube.com/watch?v=zoKIWrpan6M&ab_channel=QuTechAcademy Shor’s Algorithm – illustrated.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=zoKIWrpan6M&ab_channel=QuTechAcademy Shor’s Algorithm – illustrated.]</SPAN>''''' | ||
*'''''[https://www.youtube.com/watch?v=zoKIWrpan6M&ab_channel=QuTechAcademy Step by step.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=zoKIWrpan6M&ab_channel=QuTechAcademy Step by step.]</SPAN>''''' | ||
*'''''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. | *'''''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. | ||
*'''''[https://www.youtube.com/watch?v=YEI5vYdcoQ4&ab_channel=QuantumComputing Somewhat abstruse video]''''' of how Grover’s Algorithm reduces search cost from N to N1/2. | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=YEI5vYdcoQ4&ab_channel=QuantumComputing Somewhat abstruse video]</SPAN>''''' of how Grover’s Algorithm reduces search cost from N to N1/2. | ||
*'''''[https://www.youtube.com/watch?v=7MdEHsRZxvo&ab_channel=QuantumSoar Deutsch’s Algorithm.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=7MdEHsRZxvo&ab_channel=QuantumSoar Deutsch’s Algorithm.]</SPAN>''''' | ||
<!-- **'''''Deutsch.''''' | <!-- **'''''Deutsch.''''' | ||
*'''''[https://www.youtube.com/watch?v=7MdEHsRZxvo&t=7s&ab_channel=QuantumSoar Deutsch's Algorithm]''''' --> | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=7MdEHsRZxvo&t=7s&ab_channel=QuantumSoar Deutsch's Algorithm]''''' --> | ||
*'''''[https://www.youtube.com/watch?v=TYNAPof0OqE&ab_channel=DrWaku Uses]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=TYNAPof0OqE&ab_channel=DrWaku Uses]</SPAN>''''' | ||
*'''''Encryption.'''''<BR /> | *'''''Encryption.'''''<BR /> | ||
*'''''Drug Design.''''' Designing novel molecular substances with extremely specific structures will become possible in unexpectedly short times.<BR /> | *'''''Drug Design.''''' Designing novel molecular substances with extremely specific structures will become possible in unexpectedly short times.<BR /> | ||
*'''''Process Optimization'''''<BR />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. | *'''''Process Optimization'''''<BR />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. <BR /> | *'''''AI.''''' Deep Learning systems will be profoundly impacted by quantum computing. Learning times will collapse. <BR /> | ||
*'''''[https://www.youtube.com/watch?v=CytwIKt1P_0&ab_channel=devdeliw DevLeliw]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=CytwIKt1P_0&ab_channel=devdeliw DevLeliw]</SPAN>''''' | ||
*'''''[https://www.youtube.com/watch?v=uI02dn7PsHI&ab_channel=Qiskit Qiskit (IBM). Basic Idea]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/watch?v=uI02dn7PsHI&ab_channel=Qiskit Qiskit (IBM). Basic Idea]</SPAN>''''' | ||
*'''''"[https://quantumzeitgeist.com/top-10-free-resources-for-quantum-computing/ Sand box:" Quantum Computing practice environments.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">"[https://quantumzeitgeist.com/top-10-free-resources-for-quantum-computing/ Sand box:" Quantum Computing practice environments.]</SPAN>''''' | ||
*'''''[https://www.youtube.com/@JoshsHandle/videos Useful Insights.]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.youtube.com/@JoshsHandle/videos Useful Insights.]''''' | ||
*'''''[https://www.amarchenkova.com/posts/5-quantum-algorithms-that-could-change-the-world Five very important quantum algorithms]''''' | *'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.amarchenkova.com/posts/5-quantum-algorithms-that-could-change-the-world Five very important quantum algorithms]</SPAN>''''' | ||
<!-- **'''''Shor's Algorithm.''''' --> | |||
<!-- | |||
*'''''AI.''''' | |||
**'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.wikiwand.com/en/Quantum_neural_network#Training Quantum Neural Network Training.]</SPAN>''''' | |||
**'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.wikiwand.com/en/Quantum_machine_learning Machine Learning.]</SPAN>''''' | |||
**'''''<Span Style="COLOR:BLUE; BACKGROUND:YELLOW">[https://www.wikiwand.com/en/Quantum_neural_network#Quantum_associative_memory Quantum Associative Memory]</SPAN>''''' | |||
* '''''<SPAN STYLE="COLOR:BLUE">Uses<SPAN>''''' | |||
*'''''<SPAN STYLE="COLOR:BLUE">Encryption.</SPAN> ''''' | |||
*'''''<SPAN STYLE="COLOR:BLUE">Drug Design.</SPAN> ''''' | |||
*'''''<SPAN STYLE="COLOR:BLUE">Process Optimization.</SPAN> ''''' | |||
*'''''<SPAN STYLE="COLOR:BLUE">Artificial Intelligence.</SPAN>''''' | |||
* '''''<SPAN STYLE="COLOR:BLUE">Shor's Algorithm - Some sources.</SPAN>''''' | |||
--> | |||
Latest revision as of 02:24, 20 December 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