Mathematical formulation of quantum field theory by 
Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01The 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.
TODO concrete example, please...
Step of operation of a quantum computer by Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01It takes time for the quantum state to evolve. So in order to have a deep quantum circuit, we need longer coherence times.
Quantum computers are not expected to solve NP-complete problems by Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01Only 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
Finite projective special linear group by Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01 Matrix representation of a positive definite symmetric bilinear form by Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-04-24 +Created 1970-01-01Note that odd permutations don't form a subgroup of the symmetric group like the even permutations do, because the composition of two odd permutations is an even permutation.
One major advantage: eukaryotes can do phagocytosis due to their cytoskeleton.
There are unlisted articles, also show them or only show them.