Derivation of the Schrodinger equation by Ciro Santilli 35 Updated 2024-12-23 +Created 1970-01-01
Where derivation == "intuitive routes", since a "law of physics" cannot be derived, only observed right or wrong.
TODO also comment on why are complex numbers used in the Schrodinger equation?.
Some approaches:
- en.wikipedia.org/w/index.php?title=Schr%C3%B6dinger_equation&oldid=964460597#Derivation: holy crap, this just goes all in into a Lie group approach, nice
- Richard Feynman's derivation of the Schrodinger equation:
- physics.stackexchange.com/questions/263990/feynmans-derivation-of-the-schrödinger-equation
- www.youtube.com/watch?v=xQ1d0M19LsM "Class Y. Feynman's Derivation of the Schrödinger Equation" by doctorphys (2020)
- www.youtube.com/watch?v=zC_gYfAqjZY&list=PL54DF0652B30D99A4&index=53 "I5. Derivation of the Schrödinger Equation" by doctorphys
Converts RNA to DNA, i.e. the inverse of transcription. Found in viruses such as Retrovirus, which includes e.g. HIV.
Relational database management system by Ciro Santilli 35 Updated 2024-12-23 +Created 1970-01-01
Same as recursive language but in the context of the integers.
As well put by Wikipedia, a radio receiver has to perform three functions on the signal from the antenna:
- filtering, so you can tune the station you care about. This filters based on the frequency of the carrier wave you want. I.e. you use a bandpass filter.
- amplification: otherwise you won't be able to hear anything if the emitter is too far away
- demodulation: this means decoding the signal based on whatever way it was encoded, notably e.g. AM/FM
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.
Requires entangled particles, unlike BB84 which does not.
Mathematical formulation of quantum field theory by Ciro Santilli 35 Updated 2024-12-23 +Created 1970-01-01
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.
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).
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.
TODO concrete example, please...
- physics.stackexchange.com/questions/310496/what-is-the-infinity-that-strikes-quantum-field-theory
- QED and the men who made it: Dyson, Feynman, Schwinger, and Tomonaga by Silvan Schweber (1994) chapter 2.5 "The Divergences" contains a specific example by Pascual Jordan
Step of operation of a quantum computer by Ciro Santilli 35 Updated 2024-12-23 +Created 1970-01-01
It 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 2024-12-23 +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
Unlisted articles are being shown, click here to show only listed articles.