Disclaimer: The latter half of the article gets pretty technical. For casual readers, I suggest looking into the first and second sections for a brief overview of what quantum computers are and some pretty neat quantum mechanics that they manipulate.
As a kid, or even as an adult, it’s always fun to grab a maze and try to figure out the correct path between the entry and exit points.
Github repo with my code
This article gets a bit technical. Some background in linear algebra or quantum mechanics may be helpful for better understanding. If you don’t have that, no worries. Don’t be scared of the math, as most of it I tried explaining simply. For some basics of quantum mechanics and quantum computing, read this article.
My project is based on this paper
“Nature isn’t classical, dammit, and if you want to make a simulation of nature, you’d better make it quantum mechanical, and by golly it’s a wonderful problem, because it doesn’t look so easy.”-Richard Feynman
In 2019, the global production of plastics reached an annual 368 million metric tons. PET plastic is one of the most widely used, present in your single-use water bottles, clothing, and containers. It is currently being produced at a rate of 73.39 million metric tons per year, and by 2026, that number will be 130 million.
We wondered why this was, considering by 2026, there will be at least 230.02 million tons of PET plastic in our oceans. That’s the same weight as 260 golden gate bridges stacked on top of each other.
Currently, we have almost 2 times the…
In October, I had the privilege of attending the Tough Tech Summit, hosted by MIT’s The Engine. The summit consisted of talks by some of the biggest industry leaders, including the co-founder of Nest Labs, on building technology for real, long-term change.
One talk in the conference that really stumped me was a fireside chat between Mariana Mazzucato and Tom Kalil, where they discussed the role of government in building an innovation economy beneficial to all. As a high-schooler who spends his time both nerding out over quantum computing and competing in policy debate, it amazed me that I never…
In my previous article, I talked about Shor’s Algorithm- a quantum algorithm that can be applied to break current RSA encryption. Luckily for us, current quantum computers have been using Shor’s to factor numbers such as 21, not 512 bit RSA keys. However, this has just been due to the limitations of quantum hardware. As technological advancements occur, we need a way of combatting quantum decryption to properly secure our data.
One way we can do this is by fighting quantum with quantum, using Quantum Key Distribution (QKD).
According to the BB84 protocol, QKD would work as follows:
You’re watching a spy movie. The secret agent has 1 minute to decrypt the message to save the country from an incoming attack. He whips out his computer and smashes the keys on his keyboard. He exclaims, “Dammmit I can’t get past this firewall!” More key smashing. And just when his time is almost up, he hits enter. Boom. He has now saved the entire country.
Well, in reality, breaking current encryption messages isn’t that easy. But could it be?
Currently, RSA protocol is the standard encryption method given by the National Institute of Standards and Technology. At its heart…