Bell state Updated 2025-07-16
One of the four following states:
When unqualified as in "the Bell state", it generally just means .
The Bell states are entangled and non-separable. Intuitively, we can see that when we measure that state, the values of the first and second bit are strictly correlated. This is the hallmark of quantum computation: making up states where qubits are highly correlated to match a specific algorithmic answer, and opposed to uniformly random noise. For example, the Bell state circuit is a common hello world, e.g. it is used in the official Qiskit hello world.
Qiskit Updated 2025-07-16
Python library, claims multiple backends, including simulation and real IBM quantum computer.
Quantum control system Updated 2025-07-16
Some people call it "operating System".
The main parts of those systems are:
One key insight, is that the matrix of a non-trivial quantum circuit is going to be huge, and won't fit into any amount classical memory that can be present in this universe.
This is because the matrix is exponential in the number qubits, and is more than the number of atoms in the universe!
Therefore, off the bat we know that we cannot possibly describe those matrices in an explicit form, but rather must use some kind of shorthand.
But it gets worse.
Even if we had enough memory, the act of explicitly computing the matrix is not generally possible.
This is because knowing the matrix, basically means knowing the probability result for all possible outputs for each of the possible inputs.
But if we had those probabilities, our algorithmic problem would already be solved in the first place! We would "just" go over each of those output probabilities (OK, there are of those, which is also an insurmountable problem in itself), and the largest probability would be the answer.
So if we could calculate those probabilities on a classical machine, we would also be able to simulate the quantum computer on the classical machine, and quantum computing would not be able to give exponential speedups, which we know it does.
To see this, consider that for a given input, say 000 on a 3 qubit machine, the corresponding 8-sized quantum state looks like:
000 -> 1000 0000 == (1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0)
and therefore when you multiply it by the unitary matrix of the quantum circuit, what you get is the first column of the unitary matrix of the quantum circuit. And 001, gives the second column and so on.
As a result, to prove that a quantum algorithm is correct, we need to be a bit smarter than "just calculate the full matrix".
Which is why you should now go and read: Section "Quantum algorithm".
This type of thinking links back to how physical experiments relate to quantum computing: a quantum computer realizes a physical experiment to which we cannot calculate the probabilities of outcomes without exponential time.
So for example in the case of a photonic quantum computer, you are not able to calculate from theory the probability that photons will show up on certain wires or not.
One direct practical reason is that we need to map the matrix to real quantum hardware somehow, and all quantum hardware designs so far and likely in the future are gate-based: you manipulate a small number of qubits at a time (2) and add more and more of such operations.
While there are "quantum compilers" to increase the portability of quantum programs, it is to be expected that programs manually crafted for a specific hardware will be more efficient just like in classic computers.
TODO: is there any clear reason why computers can't beat humans in approximating any unitary matrix with a gate set?
This is analogous to what classic circuit programmers will do, by using smaller logic gates to create complex circuits, rather than directly creating one huge truth table.
The most commonly considered quantum gates take 1, 2, or 3 qubits as input.
The gates themselves are just unitary matrices that operate on the input qubits and produce the same number of output qubits.
For example, the matrix for the CNOT gate, which takes 2 qubits as input is:
1 0 0 0
0 1 0 0
0 0 0 1
0 0 1 0
The final question is then: if I have a 2 qubit gate but an input with more qubits, say 3 qubits, then what does the 2 qubit gate (4x4 matrix) do for the final big 3 qubit matrix (8x8)? In order words, how do we scale quantum gates up to match the total number of qubits?
The intuitive answer is simple: we "just" extend the small matrix with a larger identity matrix so that the sum of the probabilities third bit is unaffected.
More precisely, we likely have to extend the matrix in a way such that the partial measurement of the original small gate qubits leaves all other qubits unaffected.
For example, if the circuit were made up of a CNOT gate operating on the first and second qubits as in:
0 ----+----- 0
      |
1 ---CNOT--- 1

2 ---------- 2
then we would just extend the 2x2 CNOT gate to:
TODO lazy to properly learn right now. Apparently you have to use the Kronecker product by the identity matrix. Also, zX-calculus appears to provide a powerful alternative method in some/all cases.
Just like a classic programmer does not need to understand the intricacies of how transistors are implemented and CMOS semiconductors, the quantum programmer does not understand physical intricacies of the underlying physical implementation.
For this reason programming a quantum computer is much like programming a classical combinatorial circuit as you would do with SPICE, verilog-or-vhdl, in which you are basically describing a graph of gates that goes from the input to the output
For this reason, we can use the words "program" and "circuit" interchangeably to refer to a quantum program
Also remember that and there is no no clocks in combinatorial circuits because there are no registers to drive; and so there is no analogue of clock in the quantum system either,
Another consequence of this is that programming quantum computers does not look like programming the more "common" procedural programming languages such as C or Python, since those fundamentally rely on processor register / memory state all the time.
Quantum programmers can however use classic languages to help describe their quantum programs more easily, for example this is what happens in Qiskit, where you write a Python program that makes Qiskit library calls that describe the quantum program.
Universal quantum gates Updated 2025-07-16
Just like as for classic gates, we would like to be able to select quantum computer physical implementations that can represent one or a few gates that can be used to create any quantum circuit.
Unfortunately, in the case of quantum circuits this is obviously impossible, since the space of N x N unitary matrices is infinite and continuous.
Therefore, when we say that certain gates form a "set of universal quantum gates", we actually mean that "any unitary matrix can be approximated to arbitrary precision with enough of these gates".
Or if you like fancy Mathy words, you can say that the subgroup of the unitary group generated by our basic gate set is a dense subset of the unitary group.
Clifford gates Updated 2025-07-16
This gate set alone is not a set of universal quantum gates.
Notably, circuits containing those gates alone can be fully simulated by classical computers according to the Gottesman-Knill theorem, so there's no way they could be universal.
This means that if we add any number of Clifford gates to a quantum circuit, we haven't really increased the complexity of the algorithm, which can be useful as a transformational device.
Toffoli gate Updated 2025-07-16
BB84 Updated 2025-07-16
Does not require entangled particles, unlike E91 which does.
en.wikipedia.org/w/index.php?title=Quantum_key_distribution&oldid=1079513227#BB84_protocol:_Charles_H._Bennett_and_Gilles_Brassard_(1984) explains it well. Basically:
  • Alice and Bob randomly select a measurement basis of either 90 degrees and 45 degrees for each photon
  • Alice measures each photon. There are two possible results to either measurement basis: parallel or perpendicular, representing values 0 or 1. TODO understand better: weren't the possible results supposed to be pass or non-pass? She writes down the results, and sends the (now collapsed) photons forward to Bob.
  • Bob measures the photons and writes down the results
  • Alice and Bob communicate to one another their randomly chosen measurement bases over the unencrypted classic channel.
    This channel must be authenticated to prevent man-in-the-middle. The only way to do this authentication that makes sense is to use a pre-shared key to create message authentication codes. Using public-key cryptography for a digital signature would be pointless, since the only advantage of QKD is to avoid using public-key cryptography in the first place.
  • they drop all photons for which they picked different basis. The measurements of those which were in the same basis are the key. Because they are in the same basis, their results must always be the same in an ideal system.
  • if there is an eavesdropper on the line, the results of measurements on the same basis can differ.
    Unfortunately, this can also happen due to imperfections in the system.
    Alice and Bob must decide what level of error is above the system's imperfections and implies that an attacker is listening.
E91 Updated 2025-07-16
Requires entangled particles, unlike BB84 which does not.
Fractional quantum Hall effect Updated 2025-07-16
TODO original experiment?
Laughlin paper: 1981 Quantized Hall conductivity in two dimensions.
Shows a cool new type of matter: Abelian anyons.
TODO holy crap, even this is hard to understand/find a clear definition of.
The Dirac equation, OK, is a partial differential equation, so we can easily understand its definition with basic calculus. We may not be able to solve it efficiently, but at least we understand it.
The formulation of QFT also appears to be a form of infinite-dimentional calculus.
Quantum electrodynamics by Lifshitz et al. 2nd edition (1982) chapter 1. "The uncertainty principle in the relativistic case" contains an interesting idea:
The foregoing discussion suggests that the theory will not consider the time dependence of particle interaction processes. It will show that in these processes there are no characteristics precisely definable (even within the usual limitations of quantum mechanics); the description of such a process as occurring in the course of time is therefore just as unreal as the classical paths are in non-relativistic quantum mechanics. The only observable quantities are the properties (momenta,
polarizations) of free particles: the initial particles which come into interaction, and the final particles which result from the process.
Quantum electrodynamics Updated 2025-07-16
Theory that describes electrons and photons really well, and as Feynman puts it "accounts very precisely for all physical phenomena we have ever observed, except for gravity and nuclear physics" ("including the laughter of the crowd" ;-)).
Learning it is one of Ciro Santilli's main intellectual fetishes.
While Ciro acknowledges that QED is intrinsically challenging due to the wide range or requirements (quantum mechanics, special relativity and electromagnetism), Ciro feels that there is a glaring gap in this moneyless market for a learning material that follows the Middle Way as mentioned at: the missing link between basic and advanced. Richard Feynman Quantum Electrodynamics Lecture at University of Auckland (1979) is one of the best attempts so far, but it falls a bit too close to the superficial side of things, if only Feynman hadn't assumed that the audience doesn't know any mathematics...
The funny thing is that when Ciro Santilli's mother retired, learning it (or as she put it: "how photons and electrons interact") was also one of her retirement plans. She is a pharmacist by training, and doesn't know much mathematics, and her English was somewhat limited. Oh, she also wanted to learn how photosynthesis works (possibly not fully understood by science as that time, 2020). Ambitious old lady!!!
Combines special relativity with more classical quantum mechanics, but further generalizing the Dirac equation, which also does that: Dirac equation vs quantum electrodynamics. The name "relativistic" likely doesn't need to appear on the title of QED because Maxwell's equations require special relativity, so just having "electro-" in the title is enough.
Before QED, the most advanced theory was that of the Dirac equation, which was already relativistic but TODO what was missing there exactly?
As summarized at: youtube.com/watch?v=_AZdvtf6hPU?t=305 Quantum Field Theory lecture at the African Summer Theory Institute 1 of 4 by Anthony Zee (2004):
That video also mentions the interesting idea that:Therefore, for small timescales, energy can vary a lot. But mass is equivalent to energy. Therefore, for small time scale, particles can appear and disappear wildly.
QED is the first quantum field theory fully developed. That framework was later extended to also include the weak interaction and strong interaction. As a result, it is perhaps easier to just Google for "Quantum Field Theory" if you want to learn QED, since QFT is more general and has more resources available generally.
Like in more general quantum field theory, there is on field for each particle type. In quantum field theory, there are only two fields to worry about:
Video 1.
Lecture 01 | Overview of Quantum Field Theory by Markus Luty (2013)
Source. This takes quite a direct approach, one cool thing he says is how we have to be careful with adding special relativity to the Schrödinger equation to avoid faster-than-light information.
Weak interaction Updated 2025-10-14
Explains beta decay. TODO why/how.
Maybe a good view of why this force was needed given beta decay experiments is: in beta decay, a neutron is getting split up into an electron and a proton. Therefore, those charges must be contained inside the neutron somehow to start with. But then what could possibly make a positive and a negative particle separate?
www.thestargarden.co.uk/Weak-nuclear-force.html gives a quick and dirty:
Beta decay could not be explained by the strong nuclear force, the force that's responsible for holding the atomic nucleus together, because this force doesn't affect electrons. It couldn't be explained by the electromagnetic force, because this does not affect neutrons, and the force of gravity is far too weak to be responsible. Since this new atomic force was not as strong as the strong nuclear force, it was dubbed the weak nuclear force.
Also interesting:
While the photon 'carries' charge, and therefore mediates the electromagnetic force, the Z and W bosons are said to carry a property known as 'weak isospin'. W bosons mediate the weak force when particles with charge are involved, and Z bosons mediate the weak force when neutral particles are involved.
Video 1. Source. Some decent visualizations of the field lines.

There are unlisted articles, also show them or only show them.