Quantum Computing
Quantum computing keeps coming up as a topic I hear name-dropped without ever really being explained - treated like a faster laptop rather than a genuinely different way of computing. This note is my own attempt to pin the core ideas down without the maths, working from what I’ve read on how qubits work and why their different position takes computing beyond the binary.
What are Qubits
Bits vs qubits - a classical bit is a light switch: off (0) or on (1), one state at a time. A qubit is closer to a coin spinning in the air — while it’s spinning it isn’t heads or tails, it’s in the process of being both, only committing to a definite value once it’s measured (it “lands”). Two classical bits can be one of four values (00, 01, 10, 11) at a time; two qubits can hold a blend of all four simultaneously, and that blend grows exponentially with each added qubit.
How Many Positions?
Superposition - the property that lets a qubit hold a combination of 0 and 1 at once rather than a single fixed value, giving a quantum computer a huge space of possibilities to work with rather than one answer at a time.
Entanglement - a link between two or more qubits such that measuring one instantly determines something about the other, no matter the distance between them, without either having “decided” the outcome in advance. Einstein called this correlation “spooky action at a distance.” Entangled qubits behave as a single coordinated system rather than independent switches.
Interference - the mechanism that actually makes the result useful. Quantum algorithms are built so that, like ripples from two stones dropped in a pond, the “ripples” belonging to wrong answers cancel out while the ripples belonging to the right answer reinforce each other — so that when the qubits are finally measured, the correct answer is the one most likely to be read out.
Potential Uses
It is not a general speed upgrade over classical computers, which remain faster and more practical for almost everything. Quantum computing is special specifically where the space of possibilities is the difficulty; too many possible calculation to run in sequence but the massively parallel nature of quantum computers means highly complex problems, such as cryptography can be run simultaneously. This has huge potential in Cybersecurity in creating ultra secure systems or testing secutity at a next level. It could also be applied to ultra-complex problems like global shipping or transport efficiencies, share market/ trading, perhaps even climate change.
Position in this vault
This sits as a general tech-curiosity note rather than anything tied to my work at Canberra Institute of Technology, but it is technology and science at its most raw. I wanted a place to consolidate the concept once it clicked, mostly so I stop nodding along vaguely the next time it comes up. Worth revisiting once I’ve read more on error correction and realistic near-term applications, both of which I’ve left as open questions rather than settled understanding.