Katana VentraIP

Quantum computing

A quantum computer is a computer that uses quantum mechanical phenomena to operate.

On small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior, specifically quantum superposition and entanglement, using specialized hardware that supports the preparation and manipulation of quantum states.


Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster (with respect to input size scaling)[2] than any modern "classical" computer. In particular, a large-scale quantum computer could break widely used encryption schemes and aid physicists in performing physical simulations; however, the current state of the technology is largely experimental and impractical, with several obstacles to useful applications. Moreover, scalable quantum computers do not hold promise for many practical tasks, and for many important tasks quantum speedups are proven impossible.


The basic unit of information in quantum computing is the qubit, similar to the bit in traditional digital electronics. Unlike a classical bit, a qubit can exist in a superposition of its two "basis" states meaning it can exist in both states at the same time. When measuring a qubit, the result is a probabilistic output of a classical bit, therefore making quantum computers nondeterministic in general. If a quantum computer manipulates the qubit in a particular way, wave interference effects can amplify the desired measurement results. The design of quantum algorithms involves creating procedures that allow a quantum computer to perform calculations efficiently and quickly.


Physically engineering high-quality qubits has proven challenging. If a physical qubit is not sufficiently isolated from its environment, it suffers from quantum decoherence, introducing noise into calculations. Paradoxically, perfectly isolating qubits is also undesirable because quantum computations typically need to initialize qubits, perform controlled qubit interactions, and measure the resulting quantum states. Each of those operations introduces errors and suffers from noise, and such inaccuracies accumulate.


In principle, a non-quantum (classical) computer can solve the same computational problems as a quantum computer, given enough time. Quantum advantage comes in the form of time complexity rather than computability, and quantum complexity theory shows that some quantum algorithms for carefully selected tasks require exponentially fewer computational steps than the best known non-quantum algorithms. Such tasks can in theory be solved on a large-scale quantum computer whereas classical computers would not finish computations in any reasonable amount of time. However, quantum speedup is not universal or even typical across computational tasks, since basic tasks such as sorting are proven to not allow any asymptotic quantum speedup. Claims of quantum supremacy have drawn significant attention to the discipline, but are demonstrated on contrived tasks, while near-term practical use cases remain limited.


The reason why the quantum computer was created was to test theories relating to quantum physics that regular computers could not solve. This relates to solutionism as many physicists and engineers were trying to solve problems that could not be answered with their technology . Additionally, these problems also relate to space exploration and venturing past the “known world”. This is because understanding these complex physics problems related to theories such as the Many Universes Theory allowed scientists to get a better understanding of the universe. Furthermore, quantum computers have allowed for there to be quantum simulations of space which incorporate varying laws of physics. These simulations make it easy for engineers and physicists to test things like spacecraft, satellites, and more[3]. Because of the fact that the quantum computer was made to help humans advance their knowledge of space and the universe, it is part of the larger discourse related to space exploration and understanding what is beyond our “Earth”.

Physically scalable to increase the number of qubits

Qubits that can be initialized to arbitrary values

Quantum gates that are faster than time

decoherence

Universal gate set

Qubits that can be read easily.

(2013). Quantum Computing Since Democritus. Cambridge University Press. doi:10.1017/CBO9780511979309. ISBN 978-0-521-19956-8. OCLC 829706638.

Aaronson, Scott

Grumbling, Emily; Horowitz, Mark, eds. (2019). Quantum Computing: Progress and Prospects. Washington, DC: The National Academies Press. :10.17226/25196. ISBN 978-0-309-47970-7. OCLC 1091904777. S2CID 125635007.

doi

(2007). Quantum Computer Science: An Introduction. doi:10.1017/CBO9780511813870. ISBN 978-0-511-34258-5. OCLC 422727925.

Mermin, N. David

(1994). Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Symposium on Foundations of Computer Science. Santa Fe, New Mexico: IEEE. pp. 124–134. doi:10.1109/SFCS.1994.365700. ISBN 978-0-8186-6580-6.

Shor, Peter W.

Media related to Quantum computer at Wikimedia Commons

Learning materials related to Quantum computing at Wikiversity

: "Quantum Computing" by Amit Hagar and Michael E. Cuffaro.

Stanford Encyclopedia of Philosophy

, Encyclopedia of Mathematics, EMS Press, 2001 [1994]

"Quantum computation, theory of"

by Andy Matuschak and Michael Nielsen

Quantum computing for the very curious