While I think of the fundamental (im)possibilities and the larger picture

Practice problems on Mapping Reducibility

amehta — Sat, 13 Nov 2010 18:12:57 +0000

Let alphabet set be . Given two languages . is said to be mapping reducible to if there exists a Turing computable function s.t. . When is mapping reducible to , we denote it as , otherwise.
In this post I mention a few practice problems on mapping reducibility, a subset of which were posed to the students of ics211 in 2009, Monsoon and cs3105 in 2010, Spring.

Consider the following languages :-

| M' title='L_1 = \{ < M,w > | M' class='latex' /> accepts w
| L(M) \neq \phi \}' title='L_2 = \{ < M > | L(M) \neq \phi \}' class='latex' />
| L(M_1) \cap L(M_2) \neq \phi \}' title='L_3 = \{ < M_1,M_2 > | L(M_1) \cap L(M_2) \neq \phi \}' class='latex' />
| L(M) = \Sigma^{*} \}' title='L_4 = \{ < M > | L(M) = \Sigma^{*} \}' class='latex' />
| L(M) = \{0^{n}1^{n}|n > 0\}\}' title='L_5 = \{ < M > | L(M) = \{0^{n}1^{n}|n > 0\}\}' class='latex' />
| L(M_1)=L(M_2)\}' title='L_6 = \{ < M_1,M_2 > | L(M_1)=L(M_2)\}' class='latex' />
| L(M_1)=\overline{L(M_2)}\}' title='L_7 = \{ < M_1,M_2 > | L(M_1)=\overline{L(M_2)}\}' class='latex' />

In the languages mentioned above donote a Turing Machine.
Prove the following :-

Quantum Teleportation

amehta — Wed, 27 Oct 2010 13:53:28 +0000

The process of making a physical object disappear at one place and making an exact replica of it appear at another place is known as Quantum Teleportation ( QT ). It was mere a science fiction until in 1993 when it was experimentally validated by C. H. Bennett , G. Brassard, C. Crépeau, R. Jozsa, A. Peres, W. K. Wootters. The Original paper is available here. In this post I present a QT algorithm without assuming any background in physics.
Let us first learn some basics of Quantum Mechanics necessary to understand the QT algorithm.
Any closed quantum mechanical system has an associated complex vector space ( CVS ). Such a CVS possesses a special property which we need not get into right now. At a given time instant, state of a system is described by a unit vector in the associated CVS. Evolution of a system is described by a unitary matrix ( one for which ).
Let vector denote the state of a quantum mechanical system and be any unitary matrix. When is operated on , system is in state ( which is a unit vector again ).
Let’s consider a single qubit ( analogous of bit in quantum world ) system. Associated CVS is a complex plane . In general, we denote the state of a single qubit system by + \beta |1>' title='\alpha |0> + \beta |1>' class='latex' /> or interchangeably, where .
Consider the following matrices :
, , , , .
One may verify that all the above mentioned matrices are unitary, and hence valid operators on all single qubit system.
We will be using these matrices pretty soon.
Let us now move on to 2-qubit systems. Associated CVS is . In general, we denote state of a 2-qubit system by + \alpha_2 |01> + \alpha_3 |10> + \alpha_3 |10> + \alpha_4 |11>' title='\alpha_1 |00> + \alpha_2 |01> + \alpha_3 |10> + \alpha_3 |10> + \alpha_4 |11>' class='latex' /> or interchangeably, where . Consider the following matrix: . is a unitary matrix and hence a valid operator on any 2-qubit system. Let us operate on :-
+ \alpha_2 |01> + \alpha_3 |10> + \alpha_4 |11>' title='\alpha_1 |00> + \alpha_2 |01> + \alpha_3 |10> + \alpha_4 |11>' class='latex' /> + \alpha_2 |01> + \alpha_4 |11> + \alpha_3 |10>' title='\alpha_1 |00> + \alpha_2 |01> + \alpha_4 |11> + \alpha_3 |10>' class='latex' />.
Notice that, in ' title='|i,j>' class='latex' />, if , is flipped. Hence, operator is popularly known as controlled-not ( C-NOT) gate ( is called the control bit. If , is flipped).
Let us now consider a special state on a 2-qubit system, = \frac{1}{\sqrt{2}}|00>+\frac{1}{\sqrt{2}}|11>' title='| \psi> = \frac{1}{\sqrt{2}}|00>+\frac{1}{\sqrt{2}}|11>' class='latex' />, popularly known as Bell state.
In a 2-qubits closed systems, it is possible to put the two qubits far apart maintaining the state of the system.
Ok. We are done with the preliminaries . Let us move on to give the problem statement.

Formal problem statement for Quantum Teleportation :-
Alice and Bob live far apart. They share a qubit each of a 2-qubit system in Bell state. Alice has a telephone facility with which she can send 2 bits of information to Bob. Alice has a 1-qubit system which she wishes to send to Bob. In this entire process, Alice doesn’t care if she is not left with a copy of qubit she intended to send to Bob.

Algorithm:-
Let = \alpha |0> + \beta |1>' title='|\psi> = \alpha |0> + \beta |1>' class='latex' /> be the state Alice intends to send to Bob. Consider the system,
\otimes \frac{|00>+|11>}{\sqrt{2}}' title='|\psi> \otimes \frac{|00>+|11>}{\sqrt{2}}' class='latex' /> + \beta |1> \otimes \frac{|00> + |11>}{\sqrt{2}} \equiv \alpha |0> \otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta |1> \otimes \frac{|00>+|11>}{\sqrt{2}}' title='\alpha |0> + \beta |1> \otimes \frac{|00> + |11>}{\sqrt{2}} \equiv \alpha |0> \otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta |1> \otimes \frac{|00>+|11>}{\sqrt{2}}' class='latex' />.

Alice operates C-NOT on the two qubits in her possession :-
\otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta |1> \otimes \frac{|00>+|11>}{\sqrt{2}}' title='\alpha |0>\otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta |1> \otimes \frac{|00>+|11>}{\sqrt{2}}' class='latex' /> \otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta |1> \otimes \frac{|10>+|01>}{\sqrt{2}}' title='\alpha |0> \otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta |1> \otimes \frac{|10>+|01>}{\sqrt{2}}' class='latex' />.

Alice then operates on the first of the two qubits in her possession :-
\otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta |1> \otimes \frac{|00>+|11>}{\sqrt{2}}' title='\alpha |0>\otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta |1> \otimes \frac{|00>+|11>}{\sqrt{2}}' class='latex' /> + |1>}{\sqrt{2}} \otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta \frac{|0> - |1>}{\sqrt{2}} \otimes \frac{|10>+|01>}{\sqrt{2}}' title='\alpha \frac{|0> + |1>}{\sqrt{2}} \otimes \frac{|00>+ |11>}{\sqrt{2}} + \beta \frac{|0> - |1>}{\sqrt{2}} \otimes \frac{|10>+|01>}{\sqrt{2}}' class='latex' />.

Re-arranging terms, we can equivalently represent the state of the system as :-
}{2} \otimes ( \alpha |0> + \beta |1> ) + \frac{|01>}{2} \otimes ( \alpha |1> + \beta |0> ) +' title='\frac{|00>}{2} \otimes ( \alpha |0> + \beta |1> ) + \frac{|01>}{2} \otimes ( \alpha |1> + \beta |0> ) +' class='latex' />
}{2} \otimes ( \alpha |0> - \beta |1> ) + \frac{|11>}{2} \otimes ( \alpha |1> + \beta |0> )' title='\frac{|10>}{2} \otimes ( \alpha |0> - \beta |1> ) + \frac{|11>}{2} \otimes ( \alpha |1> + \beta |0> )' class='latex' />.

Alice now measures the qubits in her possession :-
Outcome of the measurement & the corresponding new state of the system respectively are as shown in the table below :-
+ \beta |1> \\ 01 & \alpha |1> + \beta |0> \\ 10 & \alpha |0> - \beta |1> \\ 11 & \alpha |1> - \beta |0> \end{array}' title='\begin{array}{c | c } 00 & \alpha |0> + \beta |1> \\ 01 & \alpha |1> + \beta |0> \\ 10 & \alpha |0> - \beta |1> \\ 11 & \alpha |1> - \beta |0> \end{array}' class='latex' />.

Alice communicates the outcome of the measurements to Bob, which is 2 bit of information.
Notice that the qubit in Bob’s possession is in one of the four states mentioned in the table, depending on the outcome of the Alice’s measurement.

Bob on receiving 2 bits from Alice does the following operation on the single qubit in his possession.
1. If Bob receives 00, he does nothing.
2. If Bob receives 01, he operates .
3. If Bob receives 10, he operates .
4. If Bob receives 11, he operates .

Related homework problems,
1. Show that, when a unit vector is multiplied with a unitary matrix, the resulting vector is also a unit vector.
2. How to teleport a 2-qubit system? In general, how to teleport a n-qubit system ?
3. It is obvious that teleporting a n-qubit (n > 1) system cannot be done with just a pre-shared EPR pair between Alice and Bob. What is the minimum entanglement necessary to achieve the teleportation ?

Any progress w.r.t 2nd question, enlighten me too . I’ve been struggling with it since quite some time now.

Godel’s Second Incompleteness Theorem

amehta — Thu, 29 Jul 2010 17:04:10 +0000

A formal system is characterized by its axiom set. In this post, I talk about systems with only finitely many axioms. A system is said to be consistent if its axioms do not contradict any of its axioms. In a system, a statement is said to be independent of the system if it is not derivable from its axioms logically.

Godel’s Second Incompleteness Theorem states: If a system is consistent, then the consistency of the system is not provable within the system.
More formally one may state the theorem as: If a system is consistent, then the proof of the statement “ is consistent” is independent of .

It follows that, if there is a proof of consistency of a system within the system then it is necessarily inconsistent ( contra positive of the theorem statement ). The surprise element related to this theorem is, say some postulates such as Euclid’s postulates to do 2-d geometry are consistent, then this very fact forbids us from giving a proof of postulates being consistent. One may think of proving consistency of a system by moving to a higher system , but then the consistency of relies on the consistency of , and the problem of proving consistency of remains as such.

A related puzzle problem,
Consider a system with just one axiom, : 0 is a number.
Consistency proof:-
Since nothing is derivable with just one axiom, hence the only axiom does not contradict itself. Hence, is a consistent system.

is consistent and we have a consistency proof for . too.
Isn’t this a counter example to Second Incompleteness Theorem? Why not ?

A Buggy Argument to #real numbers = #natural numbers

amehta — Wed, 21 Jul 2010 22:58:44 +0000

A real line is a line whose points correspond to real numbers.
1. Let be the number of points on a real line
2. Let be the number of points in [-1,1] interval over a real line.
3. Let be the number of points in (-1,1) interval over a real line.
4. Let be the number of points in a unit square.

seem to be infinitely greater than and seem to be some twoish greater than . seem to be quite a lot bigger than . Georg Cantor created a paradise, a theory of sets which suggests . Now this is something hard to digest at the first sight, but that’s the way it is.

Later on, Russell proved that the Cantor’s theory of sets is inconsistent i.e. it’s axioms are self-contradictory. This doesn’t mean that the above mentioned equalities do not hold, one may use ZFC theory of sets ( which is immune to various paradoxes which Cantor’s theory faced ) to arrive at the same result. Though ZFC hasn’t witnessed a paradox yet and is widely believed to be consistent, we still do not know whether it is a consistent theory of sets or not since Godel‘s second incompleteness theorem states that the consistency of a formal system S can be proved within the system only if it is inconsistent ( or equivalently we can say that if a system is consistency then it’s consistency can not be proved within the system) and hence forbids us from proving the consistency of ZFC within ZFC.

Let be the set of natural numbers and be the set of all the subsets . Cantor proved that . With this proof he also contributed a technique known as Diagonalization, very useful tool in theoretical computer science.
Other day I was playing with the sets, and arrived at a mapping as described below. One may trivially show that exists and hence is a bijection between and ( i.e. )!!

Description of :
i=1;n=1;
while(1) {

be the set of all those set with ;
for each {
- map to n;
- n++;
}
i++;

}

Few example mapping by the function :-
{1}->1,
{2}->2,
{1,2}->3, {3}->4,
{1,3}->5, {4}->6,
{2,3}->7, {1,4}->8, {5}->9,
{1,5}->10, {2,4}->11, {1,2,3}->12, {6}->13,
{1,6}->14,

Now given that Cantor gave a clean proof for , something has to be wrong with argument given above which claims . What is it?
Note that I have detailed as an infinite loop mapping. One may instead detail as a function which takes a set as input and outputs , a natural number.

PS: You can post your doubts/comments/solutions in the comments section or mail them to me.

A Special Case of Hilbert’s Tenth Problem

amehta — Mon, 19 Jul 2010 11:56:33 +0000

In 1900, David Hilbert posed a list of 23 quality problems in mathematics, many of them remain unsolved till date. These problems have caused a significant progress in various disciplines of mathematics. Briefings and current status of the problems can be found here. In this post, I am going to brief Hilbert’s Tenth Problem and pose a related puzzle problem.

A root of a multivariate polynomial are values of variables at which vanishes to 0. Hilbert in his 10th problem asked for an algorithm for the following decision problem: Given a multivariate polynomial with integral coefficients as input, if there are any integral roots to it. (For example, has integral roots and has no integral roots.)

In 1970, Yuri Matijasevic proved that there can not exist an algorithm for the problem. But what about the special case when the input polynomials are univariate only i.e. Does there exist an algorithm which when given a univariate polynomial with integral coefficients as input tells if at all there are any integral root to it? If yes, then what would be the best possible algorithm for this with respect to time complexity ( i.e. the number of steps it takes to arrive at the answer (yes/no) on the worst case input to your algorithm).

PS: People can post their (full/partial) solutions in the comments section.

Protected: मैंने सात लोगों का खून किया है

amehta — Tue, 06 May 2008 14:05:33 +0000