Topics Top articles New articles Updated articles Top users New users New discussions Top discussions New comments+ New article
The CNOT gate is a controlled quantum gate that operates on two qubits, flipping the second (operand) qubit if the first (control) qubit is set.
This gate is the first example of a controlled quantum gate that you should study.
To understand why the gate is called a CNOT gate, you should think as follows.
First let's produce a generic quantum state vector where the control qubit is certain to be 0.
On the standard basis:we see that this means that only and should be possible. Therefore, the state must be of the form:where and are two complex numbers such that
If we operate the CNOT gate on that state, we obtain:and so the input is unchanged as desired, because the control qubit is 0.
If however we take only states where the control qubit is for sure 1:
Therefore, in that case, what happened is that the probabilities of and were swapped from and to and respectively, which is exactly what the quantum NOT gate does.
So from this we understand more concretely what "the gate only operates if the first qubit is set to one" means.
Now go and study the Bell state and understand intuitively how this gate is used to produce it.
Exception to the Madelung energy ordering rule by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
Hartree-Fock method for the helium atom by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
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.
Not the same as Hermite polynomials.
Show up in the solution of the quantum harmonic oscillator after separation of variables leading into the time-independent Schrödinger equation, much like solving partial differential equations with the Fourier series.
I.e.: they are both:
- solutions to the time-independent Schrödinger equation for the quantum harmonic oscillator
- a complete basis of that space
Time-independent Schrödinger equation for a free one dimensional particle by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
so the solution is:We notice that the solution has continuous spectrum, since any value of can provide a solution.
Time-independent Schrödinger equation by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
So we see that for any Schrödinger equation, which is fully defined by the Hamiltonian , there is a corresponding time-independent Schrödinger equation, which is also uniquely defined by the same Hamiltonian.
The cool thing about the Time-independent Schrödinger equation is that we can always reduce solving the full Schrödinger equation to solving this slightly simpler time-independent version, as described at: Section "Solving the Schrodinger equation with the time-independent Schrödinger equation".
Because this method is fully general, and it simplifies the initial time-dependent problem to a time independent one, it is the approach that we will always take when solving the Schrodinger equation, see e.g. quantum harmonic oscillator.
As of 2022, this tends to be the more "default" when you talk about a quantum computer.
But there are some serious analog quantum computer contestants in the field as well.
One single universal wavefunction, and every possible outcomes happens in some alternate universe. Does feel a bit sad and superfluous, but also does give some sense to perceived "wave function collapse".
Pinned article: ourbigbook/introduction-to-the-ourbigbook-project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
- Internal cross file references done right:
- Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact