Difference between revisions of "Quantum Computing"

Revision as of 03:48, 10 April 2021

Quantum computers are a developing technology that today, has ramifications in any sector that is reliant on processing power or cryptographic security. It has been creating its own sectors along with new jobs, which indicates that in the future it will contribute to the growth of all sectors.^[1] Quantum computers possess exponentially stronger computational power due to the use of quantum bits, or qubits, which doubles the processing power of every bit used by exploiting the natural phenomenon known as superposition. This method of processing can lead to faults in computer security that are currently indefensible. There are ethical concerns with the capacity for such large breaches in data security to occur when quantum processing power is only accessible to the select few entities or individuals that have the means of developing and utilizing quantum computing.

History

Image of IBM's quantum computer Q

Quantum computing was first conceived by American physicist Paul Benioff in his paper^[2] published in the Journal of Statistical Physics in 1980 describing a quantum mechanical model of a Turing machine. It was in the 1980s that American theoretical physicist Richard Feynman^[3] and later Russian mathematician Yuri Manin suggested that quantum computers could go about completing tasks that regular computers would not be able to^[4]. A turning point in the relevance of quantum computing was when Peter Shor conceived of a quantum algorithm with the theoretical capacity to decrypt RSA encrypted communications^[5]. Experimental progress in the later 1990s led tech corporations and governments, often working hand in hand, to invest more time and effort into the development of quantum computing, ramping up investment from then to the present day. Along the way, multiple kinds of quantum computers have been considered, the most popular being the quantum circuit, utilizing qubits in interaction with various quantum logic gates. These quantum logic gates are only one of the multiple computing models being developed as means to the ultimate goal of quantum supremacy, others include techniques such as quantum annealing and adiabatic quantum computation.

Quantum Supremacy

Moore's Law and the Quantum Fix

Classical computing power has been on an exponential increase over the past 50 years. Evidence of this can be seen using Moore’s Law ^[6], which states that “the number of transistors in an integrated circuit doubles about every two years.” This decrease in transistor size forces quantum mechanical action to be accounted for. Eventually, these transistors will become too small, meaning quantum tunneling^[7] could limit the ability for Moore’s Law to continue. To overcome this, quantum computers instead manipulate qubits, rather than their classical counterparts’ use of transistors. Qubits^[8] is the quantum equivalent of classical computer’s bits, where everything is represented in two states: ‘1’ and ‘0’, or ‘true’ and ‘false’. Unlike their bit counterparts, qubits are capable of being three states: ‘1’, ‘0’, and ‘both’ (or equivalently, ‘true’, ‘false’, and ‘both’). The resulting difference in computational power can be seen in any tree branching structure, like maze solving. Where a classical computer would have to check a path, return when its algorithm hit a dead end, and repeat until the correct end is reached, a quantum computer can instead check both routes concurrently until the end is reached ^[9]. Google’s quantum processor, Sycamore, “completed a task in 200 seconds that Google claimed would take state-of-the-art supercomputers 10,000 years to finish” ^[10]. This computational power has large implications in data security, as many cryptographically secure algorithms are based on the fact that their inherent mathematical assumptions are computationally taxing.

Quantum Solvable Cryptography

Simple version of how RSA works ^[11]

RSA^[12] is a widely-used public-key cryptosystem which relies on the “factoring problem^[13]” RSA allows for cryptographically secure communication because, on state-of-the-art classical supercomputers, the work it takes to generate a key from two prime numbers (what the users would do) is exponentially easier than the work it takes to factor the resulting number into its two primes (what an attacker would have to do to break RSA).

Step by Step RSA^[14]:

1. Select two large prime numbers: P and Q

2. Calculate N and O where N = P * Q and O is (P - 1)(Q - 1)

3. Select an E where E is relatively prime to O

4. Find D where (E * D) mod O ≡ 1

5. Public Key: (E, N)

    Private Key: (D, N)

6. To encrypt message x: x^E mod N

    To decrypt message x: x^D mod N

With sufficiently high prime numbers, classical computers are currently incapable of breaking RSA encryption in polynomial time, but this is not the case for quantum computers. As a result of quantum computer’s computational power, the factoring problem is no longer sufficiently hard to be cryptographically secure. This lack of security will have large-scale implications as RSA encryption is a cryptographic primitive utilized in a large amount of HTTPS websites^[15].

Ethical Concerns

International abuse of power

RSA is currently being utilized world-wide under the belief that it is cryptographically secure. There are cryptographers currently working to build post-quantum secure cryptography, but there is no countermeasure to quantum computing as of yet^[16]. If one country has access to quantum computing before other countries have it, and there is no countermeasure in place, the post-quantum country has uninhibited access to a majority of the world’s internet traffic. Data kept secure by companies and governments utilizing currently cryptographically-secure algorithms like RSA are no longer viable, and without ethical guidelines in place to prevent abuse, the country with access to quantum factorization will be able to view large amounts of private information. Sensitive government information being transmitted between officials can be seen without their knowledge.

Government on citizen

Citizen data is protected from the government as channels of communication utilize commercial companies, so businesses like VPNs, Apple, Android, or any third party provider, are not required by law to give up incriminating data, or anything that citizens do not want the government to have. If the government were to have quantum computing capable of decrypting RSA computations, the citizens’ online traffic would no longer have to be requested from these companies, and instead could be immediately taken and viewed by the government. Without proper ethical guidelines to the use of quantum computing, internet use and the people’s compartmentalized data identities are at stake. Use of the internet is implicitly anonymous to an extent, so the deanonymization of it via quantum factorization would result in the people’s data identities being able to be pieced together. Quantum computers will withdraw the need for citizens or companies to consent to the government viewing online transmissions.

The Future

The creation of a broad use-case usable quantum computer would be an exponential step in computational power that the world does not have the proper infrastructure to account for. This comes with ethical concerns as there are currently little or no legislative defenses or guidelines to restrict the use of a power like this. The future of data security is reliant on whether or not quantum-secure cryptography is widely established before the creation of quantum computers.

Though, even with security-related concerns, the capacity for quantum computing to change the world when properly harnessed is nearly unlimited, especially considering breakthroughs will continue being made. Uses in AI development, medical exploration, and financial optimization will inevitably be super-charged by quantum computing advances, it becomes a matter of how we go about using these technologies, not if we do. The current model of centralized control is bleak, it appears that the power of quantum computation will be in the hands of a technological elite, potentially creating a divide impossible to bridge. However, distributed systems of computing are beginning to arise, and the future for use of quantum computing may well be distributed, drawing on the will and desires of the masses for interests other than the accumulation of wealth and power. Quantum computing will slingshot us into the future. The question is: how do we align our incentives so that we are shot in the best direction?

References

1. ↑ Qiskit, "Expert Advice for getting a job in Quantum Computing" (2020) https://medium.com/qiskit/we-asked-experts-their-advice-for-getting-a-job-in-quantum-computing-2f55e9785a6b
2. ↑ Benioff, Paul. (1980). [1]. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. Retrieved Mar 30, 2021.
3. ↑ Feynman, Richard P. (1982). [2]. Simulating physics with computers. Retrieved Mar 30, 2021.
4. ↑ Manin, Yuri. (1980). [3]. Computable and Noncomputable. Retrieved Mar 30, 2021.
5. ↑ Jurvetson, Steve. (2019). [4]. How a quantum computer could break 2048-bit RSA encryption in 8 hours. Retrieved Mar 30, 2021.
6. ↑ Britannica, The Editors of Encyclopaedia. "Moore's law". Encyclopedia Britannica, 26 Dec. 2019, https://www.britannica.com/technology/Moores-law. Accessed 26 March 2021.
7. ↑ Britannica, The Editors of Encyclopaedia. "Tunneling". Encyclopedia Britannica, 24 Oct. 2016, https://www.britannica.com/science/tunneling. Accessed 26 March 2021.
8. ↑ Holton, William Coffeen. "Quantum computer". Encyclopedia Britannica, 16 Aug. 2020, https://www.britannica.com/technology/quantum-computer. Accessed 26 March 2021.
9. ↑ Bashuk, Mark. “Solving a Maze with a Quantum Computer.” ResearchGate, 2003, www.researchgate.net/publication/2190201_Solving_a_Maze_With_a_Quantum_Computer.
10. ↑ “Quantum Supremacy Using a Programmable Superconducting Processor.” Google AI Blog, 23 Oct. 2019, ai.googleblog.com/2019/10/quantum-supremacy-using-programmable.html.
11. ↑ Uk, Garciaj. “Simple Version of How RSA Works.” Hackernoon, 23 June 2017, hackernoon.com/how-does-rsa-work-f44918df914b.
12. ↑ Simmons, Gustavus J.. "RSA encryption". Encyclopedia Britannica, 3 Aug. 2012, https://www.britannica.com/topic/RSA-encryption. Accessed 26 March 2021.
13. ↑ Rembert, Ludovic. “Prime Factorization.” Privacy Canada, 25 Nov. 2020, privacycanada.net/mathematics/prime-factorization/.
14. ↑ Honeyman, Alexander. "Public Key Cryptography." 19 Sept. 2019, University of Michigan, Michigan. Class lecture.
15. ↑ B, Bobby. “How Does HTTPS Work? RSA Encryption Explained.” TipTopSecurity, 10 Sept. 2017, tiptopsecurity.com/how-does-https-work-rsa-encryption-explained/.
16. ↑ Castellanos, Sara. “Quantum Computing Scientists Call for Ethical Guidelines.” The Wall Street Journal, Dow Jones & Company, 1 Feb. 2021, www.wsj.com/articles/quantum-computing-scientists-call-for-ethical-guidelines-11612155660.