Quantum Mechanics Computing for Computer Scientists

We're in the vacuum tube stage of the semiconductor revolution but in quantum

If two probabalistic events such as two coin tosses are independent then the probability of two specific events such as 2 heads is the product of the two seperate events:   If a set of events can not be factored like this then they are not independent events.  In quantum mechanics if this occurs then the events are said to be entangled..

Quantum Mechanics Money from Knots

An attempt at money using quantum mechanics. Saw a note to the effect there is some flaw. IIRC


 

Presented by Edward Farhi. Money, either in the form of bills or information on a computer, should be impossible to copy and also verifiable as good money when tendered to a merchant. Quantum mechanics may make this possible to achieve with far greater security than can be achieved without quantum mechanics. Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the state came from the mint without sending the money back to the mint. I will present a concrete quantum money scheme based on quantum superpositions of diagrams that encode knots. This scheme is hopefully secure against computationally bounded adversaries. This may be the basis of E-commerce on a future quantum internet which would not require communication with a central server such as the credit card company, PayPal or Google Checkout.

Research Links

Quantum Mechanics Logic

Gates.

Quantum logic

In a famous paper of 1936, the first work ever to introduce quantum logics,[28] von Neumann first proved that quantum mechanics requires a propositional calculus substantially different from all classical logics and rigorously isolated a new algebraic structure for quantum logics. The concept of creating a propositional calculus for quantum logic was first outlined in a short section in von Neumann's 1932 work. But in 1936, the need for the new propositional calculus was demonstrated through several proofs. For example, photons cannot pass through two successive filters which are polarized perpendicularly (e.g., one horizontally and the other vertically), and therefore, a fortiori, it cannot pass if a third filter polarized diagonally is added to the other two, either before or after them in the succession. But if the third filter is added in between the other two, the photons will indeed pass through. And this experimental fact is translatable into logic as the non-commutativity of conjunction (A\land B)\ne (B\land A). It was also demonstrated that the laws of distribution of classical logic, P\lor(Q\land R)=(P\lor Q)\land(P\lor R) and P\land (Q\lor R)=(P\land Q)\lor(P\land R), are not valid for quantum theory. The reason for this is that a quantum disjunction, unlike the case for classical disjunction, can be true even when both of the disjuncts are false and this is, in turn, attributable to the fact that it is frequently the case, in quantum mechanics, that a pair of alternatives are semantically determinate, while each of its members are necessarily indeterminate. This latter property can be illustrated by a simple example. Suppose we are dealing with particles (such as electrons) of semi-integral spin (angular momentum) for which there are only two possible values: positive or negative. Then, a principle of indetermination establishes that the spin, relative to two different directions (e.g., x and y) results in a pair of incompatible quantities. Suppose that the state É¸ of a certain electron verifies the proposition "the spin of the electron in the x direction is positive." By the principle of indeterminacy, the value of the spin in the direction y will be completely indeterminate for É¸. Hence, É¸ can verify neither the proposition "the spin in the direction of y is positive" nor the proposition "the spin in the direction of y is negative." Nevertheless, the disjunction of the propositions "the spin in the direction of y is positive or the spin in the direction of y is negative" must be true for É¸. In the case of distribution, it is therefore possible to have a situation in which A \land (B\lor C)= A\land 1 = A, while (A\land B)\lor (A\land C)=0\lor 0=0.

Von Neumann proposes to replace classical logics, with a logic constructed in orthomodular lattices, (isomorphic to the lattice of subspaces of the Hilbert space of a given physical system).[29]

Research Links