"A  computer without an algorithm is just a  dumb computer"

##### Additional Resources on Algorithms: 
- quantum algorithms are those that offer an advantage over any classical alternatives. The full timelines and description of those algorithms are [found here on Devopedia](https://devopedia.org/quantum-algorithm). 
- Apparently there is a quantum algoirthm [generator](https://quantastica.com/#generator)!! The pypi package is [here](https://pypi.org/project/quantastica-qps-api/)

---

-  [**Shor’s Algorithm](obsidian://open?vault=Obsidian&file=Quantum%20Vault%2FQuantum%20Realm%2FAlgorithms%2FShor's%20Algorithm):** 
	- Shor's algorithm is a quantum computer algorithm for integer factorization. Informally, it solves the following problem: Given an integer, find its prime factors. It was invented in 1994 by the American mathematician Peter Shor. On a quantum computer, to factor an integer, Shor's algorithm runs in polynomial time.  -search unordered list in square root n time rather than searching every element which leads to O(n)
	- The algorithm that quantum computers can effectively use to solve various problems that we have set up in society today. Essentially, our entire system is set up on mathematics; therefore, with this algorithm, a quantum computer can solve issues of factorization, discrete log, elliptical curve and more which means all RSA encrypted cryptosystems could easily be broken.
- [**Grover Search Algorithm](obsidian://open?vault=Obsidian&file=Quantum%20Vault%2FQuantum%20Realm%2FAlgorithms%2FGrover's%20Search%20Algorithm):** 
	- Search algorithm that can produce amazing results for the unstructured search problem found in computer science. The classical 3-SAT NP problem can be solved with quantum computers with a significant speedup time. 
-  **Selby’s algorithm** → better than a d-wave quantum 
	-   There are currently approximately 50 quantum algorithms in place to create a more quantum efficient system 
-   T**he Random Walk of the Markov Chain** is used to find vertices on a graph 
	-   However a quantum walk is able to improve their version of this 
	- The random walk/markov chain is used sampling/search problems in classical computing, whereas a quantum walk, where a simulated coherent quantum evolution of a particle moving on a graph is computed, would provide an alternate method to search that would outperform a markov chain, with both faster hitting and faster mixing 

---

-   Quantum languages that you can learn to get started developing on the quantum cloud 
	-   Python 
	-   Cirq is google’s software library for writing, manipulating, and optimizing quantum circuits 

---


-   How to incorporate blockchain in the quantum realm? 
-   Break RSA with shor’s algorithm 
	-   Instead of breaking RSA with bruteforce  which classical computing assumes, quantum computer finds the period of a function which contain the RSA key and classically computes the greatest common divisor 
	-   Find the period of a function with a hadamard gate
	-   To create quantum superposition
	-   Implement function into quantum transform 
	-   Perform the quantum fourier transform 
	-   The RSA 2048 Challenge problem would take 1 billion years with a classical computer but a quantum computer could do it in 100 seconds
	-   Quantum computer may never likely be a standalone system but together with a supercomputer that time to break an RSA key will be very reasonable. 
	-   A Lattice based cryptography can offer resistance to quantum computers 
    
-   D-Wave has release a 2048 qubit system   - This is a quantum **annealer** 
	-   This runs algorithms that are great for optimization problems by quickly searching over a space to find a minimum solution
	-  ex.  The ice cream sales rep problem 
		-   You have invested in the business of selling ice cream and bought ice cream truck 
		-   Optimal route to pass through all neighborhoods of the city. 

-   Climate impacts of quantum engineering: 
	-   Rather than use more electricity, quantum computers will reduce power consumption anywhere from 100 - 1000x because quantum computers use quantum tunneling 
	-   Quantum computers are very fragile 
	-   Any vibrations impacts atoms and causes decoherence
    
-   In the early 2000s, the ARPA advanced research and development activity established a road map for quantum computing