Saturday, February 19, 2011

quantum computer

A quantum computer is a device for computation that makes direct use of quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from traditional computers based on transistors. The basic principle behind quantum computation is that quantum properties can be used to represent data and perform operations on these data.[1] A theoretical model is the quantum Turing machine, also known as the universal quantum computer.

Although quantum computing is still in its infancy, experiments have been carried out in which quantum computational operations were executed on a very small number of qubits (quantum bits). Both practical and theoretical research continues, and many national government and military funding agencies support quantum computing research to develop quantum computers for both civilian and national security purposes, such as cryptanalysis.[2]

If large-scale quantum computers can be built, they will be able to solve certain problems much faster than any current classical computers (for example integer factorization using Shor's algorithm). All problems solvable with a quantum computer can also be solved using a traditional computer given enough time and resources.

 

basis:-

a

classical computer has a memory made up of bits, where each bit represents either a one or a zero. A quantum computer maintains a sequence of qubits. A single qubit can represent a one, a zero, or, crucially, any quantum superposition of these; moreover, a pair of qubits can be in any quantum superposition of 4 states, and three qubits in any superposition of 8. In general a quantum computer with n qubits can be in an arbitrary superposition of up to 2n different states simultaneously (this compares to a normal computer that can only be in one of these 2n states at any one time). A quantum computer operates by manipulating those qubits with a fixed sequence of quantum logic gates. The sequence of gates to be applied is called a quantum algorithm.

An example of an implementation of qubits for a quantum computer could start with the use of particles with two spin states: "down" and "up" (typically written |{\downarrow}\rangle and |{\uparrow}\rangle, or |0{\rangle} and |1{\rangle}). But in fact any system possessing an observable quantity A which is conserved under time evolution and such that A has at least two discrete and sufficiently spaced consecutiveeigenvalues, is a suitable candidate for implementing a qubit. This is true because any such system can be mapped onto an effective spin-1/2 system.

 

 

Bits vs. qubits:-

Consider first a classical computer that operates on a three-bit register. The state of the computer at any time is a probability distribution over the23 = 8 different three-bit strings 000, 001, 010, 011, 100, 101, 110, 111. If it is a deterministic computer, then it is in exactly one of these states with probability 1. However, if it is a probabilistic computer, then there is a possibility of it being in any one of a number of different states. We can describe this probabilistic state by eight nonnegative numbers a,b,c,d,e,f,g,h (where a = probability computer is in state 000, b = probability computer is in state 001, etc.). There is a restriction that these probabilities sum to 1.

The state of a three-qubit quantum computer is similarly described by an eight-dimensional vector (a,b,c,d,e,f,g,h), called a ket. However, instead of adding to one, the sum of the squares of the coefficient magnitudes, | a | 2 + | b | 2 + ... + | h | 2, must equal one. Moreover, the coefficients arecomplex numbers. Since states are represented by complex wavefunctions, two states being added together will undergo interference, which is a key difference between quantum computing and probabilistic classical computing.[5]

If you measure the three qubits, you will observe a three-bit string. The probability of measuring a given string is the squared magnitude of that string's coefficient (i.e., the probability of measuring 000 = | a | 2, the probability of measuring 001 = | b | 2, etc..). Thus, measuring a quantum state described by complex coefficients (a,b,...,h) gives the classical probability distribution ( | a | 2, | b | 2,..., | h | 2) and we say that the quantum state "collapses" to a classical state as a result of making the measurement.

Note that an eight-dimensional vector can be specified in many different ways depending on what basis is chosen for the space. The basis of bit strings (e.g., 000, 001, ..., 111) is known as the computational basis. Other possible bases are unit-length, orthogonal vectors and the eigenvectors of the Pauli-x operator. Ket notation is often used to make the choice of basis explicit. For example, the state (a,b,c,d,e,f,g,h) in the computational basis can be written as:

a\,|000\rangle + b\,|001\rangle + c\,|010\rangle + d\,|011\rangle + e\,|100\rangle + f\,|101\rangle + g\,|110\rangle + h\,|111\rangle
where, e.g., |010\rangle = \left(0,0,1,0,0,0,0,0\right)

The computational basis for a single qubit (two dimensions) is |0\rangle = \left(1,0\right) and |1\rangle = \left(0,1\right).

Using the eigenvectors of the Pauli-x operator, a single qubit is |+\rangle = \tfrac{1}{\sqrt{2}} \left(1,1\right) and |-\rangle = \tfrac{1}{\sqrt{2}} \left(1,-1\right).

A quantum computer with a given number of qubits is exponentially more complex than a classical computer with the same number of bits because describing the state of n qubits requires 2n complex coefficients. Measuring the qubits would produce a classical state of only n bits, but such an action would also destroy the quantum state. We can think of the system as being exactly one of the n-bit strings—we just don't know which one. For example, a 300-qubit quantum computer has a state described by 2300 (approximately 1090) complex numbers, more than the number of atoms in the observable universe.

operation:-

While a classical three-bit state and a quantum three-qubit state are both eight-dimensional vectors, they are manipulated quite differently for classical or quantum computation. For computing in either case, the system must be initialized, for example into the all-zeros string, |000\rangle, corresponding to the vector (1,0,0,0,0,0,0,0). In classical randomized computation, the system evolves according to the application of stochastic matrices, which preserve that the probabilities add up to one (i.e., preserve the L1 norm). In quantum computation, on the other hand, allowed operations are unitary matrices, which are effectively rotations (they preserve that the sum of the squares add up to one, the Euclidean or L2 norm). (Exactly what unitaries can be applied depend on the physics of the quantum device.) Consequently, since rotations can be undone by rotating backward, quantum computations are reversible. (Technically, quantum operations can be probabilistic combinations of unitaries, so quantum computation really does generalize classical computation. See quantum circuit for a more precise formulation.)

Finally, upon termination of the algorithm, the result needs to be read off. In the case of a classical computer, we sample from the probability distribution on the three-bit register to obtain one definite three-bit string, say 000. Quantum mechanically, we measure the three-qubit state, which is equivalent to collapsing the quantum state down to a classical distribution (with the coefficients in the classical state being the squared magnitudes of the coefficients for the quantum state, as described above) followed by sampling from that distribution. Note that this destroys the original quantum state. Many algorithms will only give the correct answer with a certain probability, however by repeatedly initializing, running and measuring the quantum computer, the probability of getting the correct answer can be increased.

For more details on the sequences of operations used for various quantum algorithms, see universal quantum computer, Shor's algorithm, Grover's algorithm, Deutsch-Jozsa algorithm,amplitude amplification, quantum Fourier transform, quantum gate, quantum adiabatic algorithm and quantum error correction.

 

potential:-

 

Integer factorization is believed to be computationally infeasible with an ordinary computer for large integers if they are the product of few prime numbers (e.g., products of two 300-digit primes).[6] By comparison, a quantum computer could efficiently solve this problem using Shor's algorithm to find its factors. This ability would allow a quantum computer to decrypt many of the cryptographic systems in use today, in the sense that there would be a polynomial time (in the number of digits of the integer) algorithm for solving the problem. In particular, most of the popular public key ciphers are based on the difficulty of factoring integers (or the related discrete logarithm problem which can also be solved by Shor's algorithm), including forms of RSA. These are used to protect secure Web pages, encrypted email, and many other types of data. Breaking these would have significant ramifications for electronic privacy and security.

However, other existing cryptographic algorithms don't appear to be broken by these algorithms.[7][8] Some public-key algorithms are based on problems other than the integer factorization and discrete logarithm problems to which Shor's algorithm applies, like the McEliece cryptosystem based on a problem in coding theory.[7][9] Lattice based cryptosystemsare also not known to be broken by quantum computers, and finding a polynomial time algorithm for solving the dihedral hidden subgroup problem, which would break many lattice based cryptosystems, is a well-studied open problem.[10] It has been proven that applying Grover's algorithm to break a symmetric (secret key) algorithm by brute force requires roughly 2n/2invocations of the underlying cryptographic algorithm, compared with roughly 2n in the classical case,[11] meaning that symmetric key lengths are effectively halved: AES-256 would have the same security against an attack using Grover's algorithm that AES-128 has against classical brute-force search (see Key size). Quantum cryptography could potentially fulfill some of the functions of public key cryptography.

Besides factorization and discrete logarithms, quantum algorithms offering a more than polynomial speedup over the best known classical algorithm have been found for several problems,[12] including the simulation of quantum physical processes from chemistry and solid state physics, the approximation of Jones polynomials, and solving Pell's equation. No mathematical proof has been found that shows that an equally fast classical algorithm cannot be discovered, although this is considered unlikely. For some problems, quantum computers offer a polynomial speedup. The most well-known example of this is quantum database search, which can be solved by Grover's algorithm using quadratically fewer queries to the database than are required by classical algorithms. In this case the advantage is provable. Several other examples of provable quantum speedups for query problems have subsequently been discovered, such as for finding collisions in two-to-one functions and evaluating NAND trees.

Consider a problem that has these four properties:

  1. The only way to solve it is to guess answers repeatedly and check them,
  2. The number of possible answers to check is the same as the number of inputs,
  3. Every possible answer takes the same amount of time to check, and
  4. There are no clues about which answers might be better: generating possibilities randomly is just as good as checking them in some special order.

An example of this is a password cracker that attempts to guess the password for an encrypted file (assuming that the password has a maximum possible length).

For problems with all four properties, the time for a quantum computer to solve this will be proportional to the square root of the number of inputs. That can be a very large speedup, reducing some problems from years to seconds. It can be used to attack symmetric ciphers such as Triple DES and AES by attempting to guess the secret key.

Grover's algorithm can also be used to obtain a quadratic speed-up over a brute-force search for a class of problems known as NP-complete.

Since chemistry and nanotechnology rely on understanding quantum systems, and such systems are impossible to simulate in an efficient manner classically, many believe quantum simulation will be one of the most important applications of quantum computing.[13]

There are a number of practical difficulties in building a quantum computer, and thus far quantum computers have only solved trivial problems. David DiVincenzo, of IBM, listed the following requirements for a practical quantum computer:[14]

  • scalable physically to increase the number of qubits;
  • qubits can be initialized to arbitrary values;
  • quantum gates faster than decoherence time;
  • universal gate set;
  • qubits can be read easily.

 

 

Quantum decoherence:-

One of the greatest challenges is controlling or removing quantum decoherence. This usually means isolating the system from its environment as the slightest interaction with the external world would cause the system to decohere. This effect is irreversible, as it is non-unitary, and is usually something that should be highly controlled, if not avoided. Decoherence times for candidate systems, in particular the transverse relaxation time T2 (for NMR and MRI technology, also called the dephasing time), typically range between nanoseconds and seconds at low temperature.[5]

These issues are more difficult for optical approaches as the timescales are orders of magnitude shorter and an often-cited approach to overcoming them is optical pulse shaping. Error rates are typically proportional to the ratio of operating time to decoherence time, hence any operation must be completed much more quickly than the decoherence time.

If the error rate is small enough, it is thought to be possible to use quantum error correction, which corrects errors due to decoherence, thereby allowing the total calculation time to be longer than the decoherence time. An often cited figure for required error rate in each gate is 10−4. This implies that each gate must be able to perform its task in one 10,000th of the decoherence time of the system.

Meeting this scalability condition is possible for a wide range of systems. However, the use of error correction brings with it the cost of a greatly increased number of required qubits. The number required to factor integers using Shor's algorithm is still polynomial, and thought to be between L and L2, where L is the number of bits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of L. For a 1000-bit number, this implies a need for about 104 qubits without error correction.[15] With error correction, the figure would rise to about 107 qubits. Note that computation time is about L2 or about 107 steps and on 1 MHz, about 10 seconds.

A very different approach to the stability-decoherence problem is to create a topological quantum computer with anyons, quasi-particles used as threads and relying on braid theory to form stable logic gates.

Monday, January 24, 2011

10 great places for travel bargains in 2011

Ancient Greek ruins have long lured visitors to the Mediterranean nation. Travelers should find Greece offering bargains this year.


Historic colonial Mexican cities like Guanajuato don't attract a large number of U.S. visitors and offer a real travel bargain.

Tim Leffel
, author of The World's Cheapest Destinations: 21 Countries Where Your Money Is Worth a Fortune ($14.95, Booklocker.com Inc.), says when problems put a nation in the headlines, tourists often shun the whole region — even when it's perfectly safe. "You can get a deal of a lifetime," he says.Even if your budget is stretched, 2011 can still be a year of travel. It's just a matter of choosing the right place.
Far from resenting your presence, local business owners are glad to have you there filling hotels and restaurants. Leffel shares his tips for this year's bargain vacation spots with Larry Bleiberg for USA TODAY.
Mexico
Although drug-related violence has been concentrated near the U.S. border, many travelers have avoided the entire country. That means incredible bargains in CancunCabo San Lucas and other resort areas, Leffel says. "There are so many rooms they are trying to fill, so every week there are unbelievable deals." Bargains are even more eye-opening in interior cities. "You pay what the Mexicans pay," says Leffel, who is spending the year living in the colonial city ofGuanajuato800-446-3942; visitmexico.com
Nepal
You don't have to be a mountain climber to experience the home of Mount Everest. Visitors can take fascinating cultural tours out of Kathmandu, while fully outfitted whitewater rafting trips are available at less than $50 a day, a fraction of the cost in North America. Recent political problems mean that tourists are staying away, and bargains are even greater than usual, Leffel says. welcomenepal.com
Indonesia
The Asian country has been a bargain destination for a decade, and there's no reason that will change in 2011, Leffel says. Resort islands like Bali are easy to reach, and although the country is popular with Australians, most Americans don't realize how much Indonesia has to offer. "It's a whole chain of islands and it's got everything: beaches, diving, mountains and culture," Leffel says. indonesia.travel
Honduras
With first-class diving and Mayan ruins, Honduras has long been a bargain vacation spot. But tourists have stayed away since a political power struggle in 2009. Despite higher prices on Roatan, a popular cruise ship stopover, "they like to bill it as the Caribbean without the Caribbean prices, and it's less than half the price for hotels and diving. You can pay $30 to $40 a dive," Leffel says. 800-410-9608; letsgohonduras.com/
Vietnam
Whether you're a backpacker looking for $5-a-night flophouse, or a high-end visitor seeking a luxury hotel, you'll find bargains here. Vietnam is one of the few Asian countries where the dollar gained value in 2010, up about 5.5% for the year. "It's a wonderful country to visit and it's easy there. You can set up tours at hotels, and the food is great," Leffel says. vietnamtourism.com
Greece
This Mediterranean country has been attracting tourists for millennia, and despite its recent debt crisis, that's not going to change. But the protests and strikes, compounded with the recession that has cut the number of European visitors, means there's excess capacity now. "They're hurting for business and rolling out the discounts," Leffel says. Look for bargain tours, cruises and island vacations. 212-421-5777; visitgreece.gr
Ireland
It's likely the Emerald Isle's financial crisis will bring travel discounts this year, Leffel says. The country added scores of hotels during its recent economic boom, and now hoteliers are reporting trouble filling rooms. "Anytime a place is onCNN— that sticks in peoples' heads longer than it should," Leffel says. 800-742-6762; discoverireland.com
Ethiopia
Not only does this African nation have incredible ruins and scenery, but its currency dropped more than almost any other — nearly 30% against the dollar in 2010. Ethiopia suffers from its location next to troubled Somalia. Leffel suggests traveling with a tour group to reduce the hassle out of exploring the undeveloped country. "There's a lot to see and do here, but it's for the heartier tourist," he says. tourismethiopia.org
Hungary
This Eastern European nation has all the charm of its western neighbors at lower costs. The country hasn't yet adopted the euro, and its currency fell more than 10% against the dollar in 2010, making it a greater bargain. Leffel recommends avoiding pricey Budapest and heading to the wine country. gotohungary.com
The USA
Few people realize what a travel bargain they have at home. Look for deals in places that depend on conventions, such as Las Vegas and Orlando. If you stay away from holiday and peak travel periods, you can find great deals, Leffel says.usa.gov/Citizen/Topics/Travel_Tourism/State_Tourism.shtml

Marriott says no to adult movies in new hotels



Marriott International, one of the nation's leading hotel groups, says it's pulling access to adult movies from new hotel rooms it will open in the next several years.
Marriott says its decision coincides with a pending shift to new in-room entertainment technology for its new hotels. Traditional video systems, which included access to adult content displayed in the menu selection, will be replaced by Internet-based video-on-demand systems.
But the decision also comes after years of discussing whether the availability of lucrative adult films in guest rooms is appropriate and whether safeguards exist to prevent children from seeing it.
Hotels have seen revenue from providing pay-per-view movies in rooms shrink. Business travelers have been increasingly checking into hotels with their own entertainment, whether Netflix DVDs, iPod Touch, laptop or Slingbox.
"Changing technology and how guests access entertainment has reduced the revenue hotels and their owners derive from in-room movies, including adult content," Marriott says.
According to Colliers PKF Hospitality Research, hotels now collect about 39% fewer dollars from all pay-per-view movie rentals than they did a decade ago. The average hotel collects about $175 per available room per year, down from $288 in 2000, says Robert Mandelbaum, the firm's research director. He estimates that industrywide, movie-rental revenue in 2009 was roughly $380 million.
"It's becoming a declining source of revenue," he said of pay-per-view movies.
As movies of all kinds become less of a moneymaker for hotels, more hotels may make similar decisions, says Joe McInerney, CEO of industry group American Hotel and Lodging Association.
"It is a hotel's prerogative, as well as a business decision, regarding what services it provides to its guests, including those striving to enhance their family-friendly image," he says.
Omni, with 50 hotels, is the biggest chain that doesn't offer adult entertainment on TVs. Omni went porn-free in 1999, says spokeswoman Caryn Kboudi. "The ownership decided that it was not a way that we wanted to make money," she says.

Blog links



http://prabhakar-prabhupd.blogspot.com/
http://prabhakarsudhakar.blogspot.com/
http://prabhupd.blog.co.in/
 http://Blogs.FanBox.com/ARomanticLoveStory-
 http://Blogs.FanBox.com/MyphotobyPrabhakarPrasa
 http://Blogs.FanBox.com/RedKaleDal-
http://Blogs.FanBox.com/politicsbyPRABHAKARPRASA
http://Blogs.FanBox.com/computerbyPRABHAKARPRASA
http://Blogs.FanBox.com/iasbyPRABHAKARPRASA
http://Blogs.FanBox.com/mbabyPRABHAKARPRASA
http://Blogs.FanBox.com/hotelbyPRABHAKARPRASA
http://Blogs.FanBox.com/hotelmanagement
http://Blogs.FanBox.com/historybyPRABHAKARPRASA
http://Blogs.FanBox.com/galaxybyPRABHAKARPRASA
http://Blogs.FanBox.com/ResearchbyPRABHAKARPRASA
http://Blogs.FanBox.com/universebyPRABHAKARPRASA
http://Blogs.FanBox.com/sciencebyPRABHAKARPRASA

Monday, January 17, 2011

earn money- paybox.me

earn $25 by just a sign-up on thise paybox link. I just earned 194.22$..

so u click & earned a lot of money…

 

http://www.paybox.me/r/prabhupd

Sunday, January 9, 2011

Sachin Tendulkar

Sachin Ramesh Tendulkar About this sound Sachin Tendulkar.jpg

(Marathi: सचिन रमेश तेंडुलकर; born 24 April 1973) is an Indian cricketer widely regarded as one of the greatest batsmen in the history of cricket. He is the leading run-scorer and century maker in Test and one-day international cricket. He is the only male player to score a double century in the history of ODI cricket. In 2002, just 12 years into his career, Wisden ranked him the second greatest Test batsman of all time, behind Donald Bradman, and the second greatest one-day-international (ODI) batsman of all time, behind Viv Richards. In September 2007, the Australian leg spinner Shane Warne rated Tendulkar as the greatest player he has played with or against. Tendulkar was the only player of the current generation to be included in Bradman's Eleven. He is sometimes referred to as Little Master or Master Blaster. Tendulkar is seen as an inspiration not only by cricketers but also by many other international sportspersons.

Tendulkar is the first player to score fifty Test centuries, and the first to score fifty centuries in all international cricket combined; he now has 97 centuries in international cricket. On 17 October 2008, when he surpassed Brian Lara's record for the most runs scored in Test cricket, he also became the first batsman to score 12,000, 13,000 and 14,000 runs in that form of the game, having also been the third batsman and first Indian to pass 11,000 runs in Test cricket. He was also the first player to score 10,000 runs in one-day internationals, and also the first player to cross every subsequent 1000-run mark that has been crossed in ODI cricket history and 200 runs in a one-day international match. In the fourth Test of the Border-Gavaskar Trophy against Australia, Tendulkar surpassed Australia's Allan Border to become the player to cross the 50-run mark the most number of times in Test cricket history, and also the second ever player to score 11 Test centuries against Australia, tying with Sir Jack Hobbs of England more than 70 years previously. Tendulkar passed 30,000 runs in international cricket on 20 November 2009, and has been honoured with the Padma Vibhushan award, India's second highest civilian award, and the Rajiv Gandhi Khel Ratna award, India's highest sporting honor. Tendulkar became the first sportsperson and the first personality without an aviation background to be awarded the honorary rank of Group Captain by the Indian Air Force. He won the 2010 Sir Garfield Sobers Trophy for cricketer of the year at the ICC awards.

Tendulkar is the only player to hit 50 Test centuries; he scored his 50th against South Africa on 19 December 2010.

 

Tendulkar was born in Bombay (now Mumbai). His father, Ramesh Tendulkar, a Marathi novelist, named Tendulkar after his favourite music director, Sachin Dev Burman. Tendulkar's elder brother Ajit encouraged him to play cricket. Tendulkar has two other siblings: a brother Nitin, and sister Savita.

Tendulkar attended Sharadashram Vidyamandir (High School), where he began his cricketing career under the guidance of his coach and mentor, Ramakant Achrekar. During his school days he attended the MRF Pace Foundation to train as a fast bowler, but Australian fast bowler Dennis Lillee, who took a world record 355 Test wickets, was unimpressed, suggesting that Tendulkar focus on his batting instead.

When he was young, Tendulkar would practice for hours on end in the nets. If he became exhausted, Achrekar would put a one-Rupee-coin on the top of the stumps, and the bowler who dismissed Tendulkar would get the coin. If Tendulkar passed the whole session without getting dismissed, the coach would give him the coin. Tendulkar now considers the 13 coins he won then as some of his most prized possessions.

While at school, he developed a reputation as a child prodigy. He had become a common conversation point in Mumbai circles, where there were suggestions already that he would become one of the greats. His season in 1988 was extraordinary, with Tendulkar scoring a century in every innings he played. He was involved in an unbroken 664-run partnership in a Lord Harris Shield inter-school game in 1988 with friend and team mate Vinod Kambli, who would also go on to represent India. The destructive pair reduced one bowler to tears and made the rest of the opposition unwilling to continue the game. Tendulkar scored 326* in this innings and scored over a thousand runs in the tournament. This was a record partnership in any form of cricket until 2006, when it was broken by two under-13 batsmen in a match held at Hyderabad in India.

When he was 14, Indian batting legend Sunil Gavaskar gave him a pair of his own ultra light pads. "It was the greatest source of encouragement for me," he said nearly 20 years later after surpassing Gavaskar's world record of 34 Test centuries. On 24 May 1995, Sachin Tendulkar married Anjali, a paediatrician and daughter of Gujarati industrialist Anand Mehta. They have two children, Sara (born 12 October 1997), and Arjun (born 24 September 1999).

Annabel Mehta is his Mother-in-law.

 

domestic career:-

On 11 December 1988, aged just 15 years and 232 days, Tendulkar scored 100 not out in his debut first-class match for Bombay against Gujarat, making him the youngest Indian to score a century on first-class debut. He followed this by scoring a century in his first Deodhar and Duleep Trophy. He was picked by the Mumbai captain Dilip Vengsarkar after seeing him negotiate Kapil Dev in the nets, and finished the season as Bombay's highest run-scorer. He also made an unbeaten century in the Irani Trophy final, and was selected for the tour of Pakistan next year, after just one first class season.

His first double century was for Mumbai while playing against the visiting Australian team at the Brabourne Stadium in 1998. He is the only player to score a century in all three of his Ranji Trophy, Duleep Trophy and Irani Trophy debuts.

In 1992, at the age of 19, Tendulkar became the first overseas born player to represent Yorkshire Tendulkar played 16 first-class matches for the county and scored 1070 runs at an average of 46.52.

 

International career:-

Tendulkar played his first Test match against Pakistan in Karachi in 1989 aged just 16. He made just 15 runs, being bowled by Waqar Younis, who also made his debut in that match, but was noted for how he handled numerous blows to his body at the hands of the Pakistani pace attack. In the final test in Sialkot, he was hit on the nose by a bouncer, but he declined medical assistance and continued to bat even as he gushed blood from it. In a 20 over exhibition game in Peshawar, Tendulkar made 53 runs off 18 balls, including an over in which he scored 28 runs off Abdul Qadir. This was later called "one of the best innings I have seen" by the then Indian captain Kris Srikkanth. In all, he scored 215 runs at an average of 35.83 in the Test series, and was dismissed without scoring a run in the only One Day International he played.

The series was followed by a tour of New Zealand in which he scored 117 runs at an average of 29.25 in, Tests including an innings of 88 in the Second Test. He was dismissed without scoring in one the two one-day games he played, and scored 36 in the other. On his next tour, to England in 1990, he became the second youngest cricketer to score a Test century as he made 119* at Old Trafford. Wisden described his innings as "a disciplined display of immense maturity" and also wrote:

"He looked the embodiment of India's famous opener, Gavaskar, and indeed was wearing a pair of his pads. While he displayed a full repertoire of strokes in compiling his maiden Test hundred, most remarkable were his off-side shots from the back foot. Though only 5ft 5in tall, he was still able to control without difficulty short deliveries from the English paceman."

Tendulkar further enhanced his development during the 1991–1992 tour of Australia, that included an unbeaten 148 in Sydney and a century on a fast, bouncing pitch at Perth. Merv Hughes commented to Allan Border at the time that "This little prick's going to get more runs than you, AB."

 

Tendulkar's performance through the years 1994–1999 coincided with his physical peak, in his early twenties. On the day of the Hindu festival Holi, Tendulkar was told to open the batting at Auckland against New Zealand in 1994. He went on to make 82 runs off 49 balls. He scored his first ODI century on 9 September 1994 against Australia in Sri Lanka at Colombo. It had taken him 79 ODIs to score a century.

In 1996 against Pakistan in Sharjah, Indian captain Mohammed Azharuddin was going through a lean patch. Tendulkar and Navjot Singh Sidhu both made centuries to set a record partnership for the second wicket. After getting out, Tendulkar found Azharuddin in two minds about whether he should bat. Tendulkar convinced Azharuddin to bat and Azharuddin subsequently unleashed 29 runs in mere 10 balls. It enabled India post a score in excess of 300 runs for the first time in an ODI. India went on to win that match.

Tendulkar's rise continued when he was the leading run scorer at the 1996 Cricket World Cup, scoring two centuries. He was the only Indian batsman to perform in the infamous semi-final against Sri Lanka. Tendulkar fell amid a batting collapse and the match referee awarded Sri Lanka the match after the crowd began rioting and set fire to parts of the stadium.

This was the beginning of a period at the top of the batting world, culminating in the Australian tour of India in early 1998, with Tendulkar scoring three consecutive centuries. These were characterized by a premeditated plan to target Australian spinners Shane Warne and Gavin Robertson, to whom he regularly charged down the pitch to drive over the infield. This technique worked as India beat Australia. The test match success was followed by two scintillating knocks in Sharjah where he scored two consecutive centuries in a must-win game and then in finals against Australia tormenting Shane Warne once again. Following the series Warne ruefully joked that he was having nightmares about his Indian nemesis. He also had a role with the ball in that series, including a five wicket haul in an ODI. Set 310 runs to win, Australia were cruising comfortably at 3 for 203 in the 31st over when Tendulkar turned the match for India taking wickets of Michael Bevan, Steve Waugh, Darren Lehmann, Tom Moody and Damien Martyn for just 32 runs in 10 overs.

Tendulkar single-handedly won the ICC 1998 quarterfinal at Dhaka to pave way for India's entry into the semifinals, when he took four Australian wickets after scoring 141 runs in just 128 balls.

A chronic back problem flared up when Pakistan toured India in 1999, with India losing the historic Test at Chepauk despite a gritty century from Tendulkar himself. The worst was yet to come as Professor Ramesh Tendulkar, Tendulkar's father, died in the middle of the 1999 Cricket World Cup. Tendulkar flew back to India to attend the final rituals of his father, missing the match against Zimbabwe. However, he returned with a bang to the World cup scoring a century (unbeaten 140 off 101 balls) in his very next match against Kenya in Bristol. He dedicated this century to his father.

 

As a Captain:-

Tendulkar's two tenures as captain of the Indian cricket team were not very successful. When Tendulkar took over as captain in 1996, it was with huge hopes and expectations. However, by 1997 the team was performing poorly. Azharuddin was credited with saying "Nahin jeetega! Chote ki naseeb main jeet nahin hai!", which translates into: "He won't win! It's not in the small one's destiny!".

Tendulkar, succeeding Azharuddin as captain for his second term, then led India on a tour of Australia, where the visitors were comprehensively beaten 3–0 by the newly crowned world champions. Tendulkar, however, was at his usual best and won the player of the tournament award as well as player of the match in one of the games. After another Test series defeat, this time by a 0–2 margin at home against South Africa, Tendulkar resigned, and Sourav Ganguly took over as captain in 2000.

Tendulkar remains an integral part of the Indian team's strategic processes. He is often seen in discussion with the captain, at times actively involved in building strategies. Former captain Rahul Dravid publicly acknowledged that Tendulkar had been suggesting moves such as the promotion of Irfan Pathan up the batting order which, although only temporary, had an immediate effect on the team's fortunes. In 2007, Tendulkar was appointed vice-captain to captain Rahul Dravid. During the Indian team's 2007 tour of England, Dravid's desire to resign from the captaincy became known. The BCCI President Sharad Pawar personally offered the captaincy to Tendulkar. However, Tendulkar asked Pawar not to appoint him captain, instead recommending Mahendra Singh Dhoni to take over the reins. Pawar later revealed this conversation, crediting Tendulkar for first forwarding the name of Dhoni, who since achieved much success as captain.

 

 

Style of play:-


Tendulkar plays a wristy leg-side flick

Tendulkar is cross-dominant: He bats, bowls and throws with his right hand, but writes with his left hand. He also practices left-handed throws at the nets on a regular basis. Cric-info columnist Sambit Bal has described him as the "most wholesome batsman of his time". His batting is based on complete balance and poise while limiting unnecessary movements and flourishes. He appears to show little preference for the slow and low wickets which are typical in India, and has scored many centuries on the hard, bouncy pitches in South Africa and Australia. He is known for his unique punch style of hitting the ball over square. He is also renowned for his picture-perfect straight drive, often completed with no follow-through. Recently, legendary Indian batsman Sunil Gavaskar, in an article he wrote in the AFP, remarked that "it is hard to imagine any player in the history of the game who combines classical technique with raw aggression like the little champion does".

Sir Donald Bradman, considered by many as the greatest batsman of all time, considered Tendulkar to have a batting style similar to his. In his biography, it is stated that "Bradman was most taken by Tendulkar's technique, compactness and shot production, and had asked his wife to have a look at Tendulkar, having felt that Tendulkar played like him. Bradman's wife, Jessie, agreed that they did appear similar."

Tendulkar at the crease, getting ready to face a delivery

Former Australian cricket team coach John Buchanan voiced his opinion that Tendulkar had become susceptible to the short ball early in his innings because of a lack of footwork. Buchanan also believes Tendulkar has a weakness while playing left-arm pace. He was affected by a series of injuries since 2004. Since then Tendulkar's batting has tended to be less attacking. Explaining this change in his batting style, he has acknowledged that he is batting differently due to that fact that, firstly, no batsman can bat the same way for the entire length of a long career and, secondly, he is a senior member of the team now and thus has more responsibility. During the early part of his career he was a more attacking batsman and frequently scored centuries at close to a run a ball. Ian Chappell, former Australian player, recently remarked that "Tendulkar now, is nothing like the player he was when he was a young bloke".

Tendulkar has incorporated several modern and unorthodox strokes into his repertoire in recent times, including the paddle sweep, the scoop over short fine leg and the slash to third man over the slips' heads, over the last seven or eight years. This has enabled him to remain scoring consistently in spite of the physical toll of injuries and a lean period in the mid-2000s. By his own admission, he does not bat as aggressively as he did in the 90s and early 2000s, because his body has undergone changes and cannot sustain aggressive shot-making over a long period. He is often praised for his ability to adapt to the needs of his body and yet keep scoring consistently.

While Tendulkar is not a regular bowler, he is adept at bowling medium pace, leg spin, and off spin with equal ease. He often bowls when two batsmen of the opposite team have been batting together for a long period, as he can often be a useful partnership breaker. With his bowling, he has helped secure an Indian victory on more than one occasion. He has taken 44 test match wickets and is the ninth highest wicket taker for India in ODIs.

 

Business:-

Tendulkar's immense popularity has led him to numerous profitable business dealings in the past. Sachin Tendulkar was an early pioneer in India on cricket business dealings when he signed a then record sports management deal with World tel in 1995, the value of the deal being 30 crore rupees over five years. His next contract with World Tel in 2001 was valued at 80 crores over five years. In 2006, he signed a contract with Saatchi and Saatchi's ICONIX values at 180 crores over three years.

Making use of his popularity, Tendulkar has opened two restaurants: 'Tendulkar's' (Colaba, Mumbai) and 'Sachin's' (Mulund, Mumbai). Sachin owns these restaurants in partnership with Sanjay Narang of Mars Restaurants. He has also got a new restaurant in Bangalore called Sachin's.

In 2007, Tendulkar also announced a JV with the Future Group and Manipal Group to launch healthcare and sports fitness products under the brand name 'S Drive and Sach'. A series of comic books by Virgin Comics is also due to be published featuring him as a superhero.

 

Product and brand endorsements:-

 

  • Pepsi: 1992–Present
  • Canon: 2006–2009
  • Airtel: 2004–2006
  • Nazara Technologies: 2005–2008. License for Mobile Content development based on Sachin.
    • Reliance Communications sub-licensed brand 'Sachin Tendulkar' to update the user of the latest 2007 Cricket World Cup scores and news in Sachin's voice. Hutch – ICC's prime communication sponsor protested calling Reliance's plan as 'ambush marketing', a charge that Reliance Communication denies.
  • Britannia: 2001–2007
  • HomeTrade: 2001–2002
  • Sunfeast: 2007–2013/14
  • National Egg Coordination Committee (NECC): 2003–2005
  • Boost: 1990–Present
  • Action Shoes: 1995–2000
  • Adidas: 2000–2010
  • Fiat Palio: 2001 to 2003
  • Reynolds: 2007–Present
  • TVS: 2002–2005
  • ESPN Star Sports: 2002–Present
  • G-Hanz: 2005–2007
  • Sanyo BPL: 2007–Present
  • AIDS Awareness Campaign: 2005
  • Colgate-Palmolive
  • Philips
  • MRF
  • VISA
  • Aviva
  • Royal Bank of Scotland Group
  • Toshiba

 

Biographies:-


  • Sachin: The Story of the World's Greatest Batsman
    by Gulu Ezekiel. Publisher: Penguin Global. ISBN 978-0-14-302854-3
  • The A to Z of Sachin Tendulkar by Gulu Ezekiel. Publisher: Penguin Global. ISBN 978-81-7476-530-7
  • Sachin Tendulkar-a definitive biography by Vaibhav Purandare. Publisher: Roli Books. ISBN 81-7436-360-2
  • Sachin Tendulkar – Masterful by Peter Murray, Ashish Shukla. Publisher: Rupa. ISBN 81-7167-806-8
  • If Cricket is a Religion, Sachin is God by Vijay Santhanam, Shyam Balasubramanian Publisher: HarperCollins India ISBN 978-81-7223-821-6
  •  

    Career achievements:-

    Sachin Tendulkar is the most prolific run scorer in one-day internationals with 17,598 runs. With a current aggregate of 14240 Test runs, he surpassed Brian Lara's previous record tally of 11,953 runs as the highest run scorer in test matches in the second Test of Australia's 2008 tour of India in Mohali. Tendulkar described "It is definitely the biggest achievement in 19 years of my career" on the day he achieved the record. He also holds the record of highest number of centuries in both Test (50) and ODI cricket (46). Throughout his career, he has made a strong impact on Indian cricket and was, at one time, the foundation of most of the team's victories. In recognition with his impact on sport in a cricket-loving country like India, Tendulkar has been granted the Rajiv Gandhi Khel Ratna, Arjuna Award,Padma Shri and Padma Vibhushan by the Government of India. He was also chosen as one of the five Wisden Cricketers of the Year in 1997 and is ranked by the Wisden 100 as the second best test batsman and best ODI batsman of all time.

    Tendulkar has also consistently done well in Cricket World Cups. Tendulkar was the highest run scorer of the 2003 Cricket World Cup and 1996 Cricket World Cup. Tendulkar has scored over 1000 runs in a calendar year in ODIs 7 times, and in 1998 he scored 1894 runs, easily the record for the highest number of runs scored by any player in a single calendar year for one day internationals. Tendulkar is also one of the very few players who are still playing in international cricket from the 1980s. On 24 February 2010, Tendulkar broke the previous world record for highest individual run scorer in an ODI and became the first male cricketer to score double century in ODI. He scored 200 runs and broke the previous record of 194 runs jointly held by Pakistan opener Saeed Anwar and Zimbabwe's Charles Coventry.

    He has been Man of the Match 13 times in Test matches and Man of the Series four times, out of them twice in the Border-Gavaskar Trophy against Australia. The performances earned him respect from Australian cricket fans and players. Similarly he has been Man of the Match 60 times in One day International matches and Man of the Series 14 times.

     

    Individual honours and appreciations:-

  • ICC Award-Sir Garfield Sobers trophy for cricketer of the year 2010
  • Padma Vibhushan, India's second highest civilian award, 2008.
  • ICC World ODI XI: 2004, 2007
  • Rajiv Gandhi Awards – Sports: 2005
  • Player of the tournament in 2003 Cricket World Cup
  • Maharashtra Bhushan Award, Maharashtra State's highest Civilian Award in 2001
  • Padma Shri, India's fourth highest civilian award, 1999
  • Rajiv Gandhi Khel Ratna, India's highest honour given for achievement in sports, 1997–98.
  • Wisden Cricketer of the Year: 1997
  • Arjuna Award, by the Government of India in recognition of his outstanding achievement in Cricket, 1994.
  • In October 2010 he was awarded for Outstanding Achievement in Sport and the Peoples Choice Award at The Asian Awards in London.