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.
But what the heck is the mathematical model for a quantum field theory? TODO someone was saying it is equivalent to an infinite set of PDEs somehow. Investigate. Related:
The path integral formulation might actually be the most understandable formulation, as shown at Richard Feynman Quantum Electrodynamics Lecture at University of Auckland (1979).
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.
Each elliptic space can be modelled with a real projective space. The best thing is to just start thinking about the real projective plane.
The definition is to take the vector space, remove the zero element, and identify all elements that lie on the same line, i.e.
The most important initial example to study is the real projective plane.
Mathematical Sciences masters course of the University of Oxford Updated 2025-07-14 +Created 1970-01-01
Poet, scientists and warriors all in one? Conquerors of the useless.
A wise teacher from University of São Paulo once told the class Ciro Santilli attended an anecdote about his life:It turned out that, about 10 years later, Ciro ended up following this advice, unwittingly.
I used to want to learn Mathematics.But it was very hard.So in the end, I became an engineer, and found an engineering solution to the problem, and married a Mathematician instead.
Mathematics and Computer science course of the University of Oxford Updated 2025-07-14 +Created 1970-01-01
Public landing page: www.ox.ac.uk/admissions/undergraduate/courses/course-listing/mathematics-and-computer-science
A mixed cross department course with the Mathematical Institute of the University of Oxford.. Its corresponding masters is known as Oxford MMathCompSci. The handbook is together with the computer science one: Section "Computer science course of the University of Oxford".
Mathematics and Statistics course of the University of Oxford Updated 2025-07-14 +Created 1970-01-01
Tends to be Ciro's pick if gnuplot can't handle the use case, or if the project is really really serious.
Couldn't handle exploration of large datasets though: Survey of open source interactive plotting software with a 10 million point scatter plot benchmark by Ciro Santilli
Examples:
- matplotlib/hello.py
- matplotlib/educational2d.py
- matplotlib/axis.py
- matplotlib/label.py
- Line style
- Subplots
- matplotlib/two_lines.py
- Data from files
- Specialized
Published by Werner Heisenberg in 1925-07-25 as quantum mechanical re-interpretation of kinematic and mechanical relations by Heisenberg (1925), it offered the first general formulation of quantum mechanics.
It is apparently more closely related to the ladder operator method, which is a more algebraic than the more analytical Schrödinger equation.
It appears that this formulation makes the importance of the Poisson bracket clear, and explains why physicists are so obsessed with talking about position and momentum space. This point of view also apparently makes it clearer that quantum mechanics can be seen as a generalization of classical mechanics through the Hamiltonian.
QED and the men who made it: Dyson, Feynman, Schwinger, and Tomonaga by Silvan Schweber (1994) mentions however that relativistic quantum mechanics broke that analogy, because some 2x2 matrix had a different form, TODO find that again.
Inward Bound by Abraham Pais (1988) chapter 12 "Quantum mechanics, an essay" part (c) "A chronology" has some ultra brief, but worthwhile mentions of matrix mechanics and the commutator.
As usual, it is useful to think about how a bilinear form looks like in terms of vectors and matrices.
Unlike a linear form, which was a vector, because it has two inputs, the bilinear form is represented by a matrix which encodes the value for each possible pair of basis vectors.
The matrix ring of degree n is the set of all n-by-n square matrices together with the usual vector space and matrix multiplication operations.
Given a function :we want to find the points of the domain of where the value of is smaller (for minima, or larger for maxima) than all other points in some neighbourhood of .
- from some space. For beginners the real numbers but more generally topological spaces should work in general
- to the real numbers
In the case of Functionals, this problem is treated under the theory of the calculus of variations.
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.
The main difference to keep in mind is that quantum computers cannot save and observe intermediate quantum state, so programming a quantum computer is basically like programming a combinatorial-like circuit with gates that operate on (qu)bits:
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,
Quantum Computation and Quantum Information by Nielsen and Chuang Updated 2025-07-14 +Created 1970-01-01
Lists of the most promising implementations:
As of 2020, the hottest by far are:
Super quick overview of the main types of quantum computer physical implementations, so doesn't any much to a quick Google.
He says he's going to make a series about it, so then something useful might actually come out. The first one was: Video "How to Turn Superconductors Into A Quantum Computer by Lukas's Lab (2023)", but it is still too basic.
The author's full name is Lukas Baker, www.linkedin.com/in/lukasbaker1331/, found with Google reverse image search, even though the LinkedIn image is very slightly different from the YouTube one.
Quantum computers are not expected to solve NP-complete problems Updated 2025-07-14 +Created 1970-01-01
Only NP-intermediate, which includes notably integer factorization:
- quantumcomputing.stackexchange.com/questions/16506/can-quantum-computer-solve-np-complete-problems
- www.cs.virginia.edu/~robins/The_Limits_of_Quantum_Computers.pdf by Scott Aaronson
- cs.stackexchange.com/questions/130470/can-quantum-computing-help-solve-np-complete-problems
- www.quora.com/How-can-quantum-computing-help-to-solve-NP-hard-problems
TODO WTF is this? How is it built? What is special about it?
Mentioned a lot in the context of superconducting quantum computers, e.g. youtu.be/t5nxusm_Umk?t=268 from Video "Quantum Computing with Superconducting Qubits by Alexandre Blais (2012)",
Unlisted articles are being shown, click here to show only listed articles.