Computers can become zillions of times faster
By
IANS
New York:The fastest quantum computer bit or the qubit has been shown to be zillions of times faster than the conventional bit, potentially making computers that much faster.
Scientists used lasers to create an initialised quantum state of this solid-state qubit at rates of about a gigahertz, or a billion times per second.
A conventional bit can be a 0 or a 1 but a qubit can be both at the same time. Until now, scientists couldn't stabilise that duality.
Because of their ability to represent multiple states simultaneously, quantum computers could theoretically make calculations dramatically faster and with much smaller computers. Consequently, they could vastly improve computer security.
Duncan Steel, a physics professor, doctoral student Xiaodong Xu and their colleagues used lasers to trap the spin of one electron confined in a single semiconductor quantum dot. A quantum dot is like a transistor in a conventional computer.
"We are the first to show that you can do this to a single electron in a self-assembled quantum dot," Steel said. "If you're going to do quantum computing, you have to be able to work with one electron at a time."
The scientists trapped the spin in a dark state where they can arbitrarily adjust the amount of 0 and 1 the qubit represents. They call this state "dark" because it does not absorb light. In other words, the light does not destabilise the qubit.
Spin is an intrinsic property of the electron which Steel compares with magnetic poles. Electrons are said to have spin up or down. In quantum computing, the up and down directions represent the 0s and 1s of conventional computing.
Steel's approach to developing a quantum computer is to use ultrafast lasers to manipulate arrays of semiconductor quantum dots, each containing one electron. Quantum logic gates are formed by quantum mechanical interactions between the dots.
Previously in Steel's lab, researchers have used a laser to produce an electron in a state representative of a 1 or a 0 and a small amount of the other state. Now, using two laser frequencies, they have trapped it as a 0 and a 1 at the same time, and they can adjust the amount of each.
"The National Security Agency has said that based on our present technology, we have about a 20-year window of security," Steel said.
"That means if we sent up a satellite today, it would take somebody about 20 years to crack the code. Quantum computers will let you develop a code that would be impossible to crack with a conventional computer."
These findings are scheduled for publication in Nature Physics and are available in the online edition.
Scientists used lasers to create an initialised quantum state of this solid-state qubit at rates of about a gigahertz, or a billion times per second.
A conventional bit can be a 0 or a 1 but a qubit can be both at the same time. Until now, scientists couldn't stabilise that duality.
Because of their ability to represent multiple states simultaneously, quantum computers could theoretically make calculations dramatically faster and with much smaller computers. Consequently, they could vastly improve computer security.
Duncan Steel, a physics professor, doctoral student Xiaodong Xu and their colleagues used lasers to trap the spin of one electron confined in a single semiconductor quantum dot. A quantum dot is like a transistor in a conventional computer.
"We are the first to show that you can do this to a single electron in a self-assembled quantum dot," Steel said. "If you're going to do quantum computing, you have to be able to work with one electron at a time."
The scientists trapped the spin in a dark state where they can arbitrarily adjust the amount of 0 and 1 the qubit represents. They call this state "dark" because it does not absorb light. In other words, the light does not destabilise the qubit.
Spin is an intrinsic property of the electron which Steel compares with magnetic poles. Electrons are said to have spin up or down. In quantum computing, the up and down directions represent the 0s and 1s of conventional computing.
Steel's approach to developing a quantum computer is to use ultrafast lasers to manipulate arrays of semiconductor quantum dots, each containing one electron. Quantum logic gates are formed by quantum mechanical interactions between the dots.
Previously in Steel's lab, researchers have used a laser to produce an electron in a state representative of a 1 or a 0 and a small amount of the other state. Now, using two laser frequencies, they have trapped it as a 0 and a 1 at the same time, and they can adjust the amount of each.
"The National Security Agency has said that based on our present technology, we have about a 20-year window of security," Steel said.
"That means if we sent up a satellite today, it would take somebody about 20 years to crack the code. Quantum computers will let you develop a code that would be impossible to crack with a conventional computer."
These findings are scheduled for publication in Nature Physics and are available in the online edition.
Reader's comments(3)
1
Dear sir, Raipur (c.g)
India
Now I have retired from Govt. service and free to use computer at home with
internet facility.I have 3 sons all are using computer .My youngest son is doing
B.C. A.
Why" Super -sized Quantum Zeno effect" capable of beating the "random guessing
limit" in counterfactual
quantum computing (via" optical" implementation of "Grover search
algorithm")?.Because
Quantum computer (due to Tuple prime numbers properties via MY intervals(
A,A+1000)
numbers ) can ALWAYS perform better than classical computer in searching an
unsorted
database .Proof is my letter of Prof.Odlyzko 1990-1992 which he sent to me.Why
there are
2 groups(1) "small gaps "between primes,which obey above super-sized Quantum
Zeno effect"
Properties i.e.super division via Ramanujan Identities (2)"small gaps" between
ALMOST primes
,which obey Rogers Identities via ordinary divisions .
Now I have made my website which contains my
astrophysics papers published by me and my "new
number theory concept "relating the above astrophysics
paper's. Also two letters of(1)Prof.H.J. Godwin (2) prof.Odlyzko.
I am also ,at present, connecting (1)Analytic Number theory(via partial
randomness or
pseudorandom number's properties) (2) Natural Halting Probabilities (via MY new
Godel
logic) (3) Zeros of Riemann Zeta function's properties-see paper" Logic ,
Language ,Information
,Computability "by C.S.Calude and M.A.Stay of California ,U.S.A.2006.
and(4) Quantum Cryptography theory (via MY Q.F.T. C.concept) ,but I am using MY
intervals(A,A+1000)
number's properties ONLY-due to" Indian Place Value Principle". This is NEW
theory technique
for you which is used as Cryptographic tools (via (1)heat and (2) light signals
).Why in D.N.A
self- assembly- ubiquitous process- is often equipped with explicit mechanism
for both
(1)error prevention (2)error correction used in 1-neno -computation 2-
neno-technology.
Old"Euclid algorithm"or "Chinese's Remainders" must be replaced by present
"divide and conquer"
method (via Sierpinski's tiles).Classical "binary splitting"is deeply related to
my "twin primes
breaking time concept" due to Deutsch-Jozsa algorithm which uses 2 kinds of a
function 1-f(x) is "constant "for all values of x (like light signals for global
world), 2-or f(x) is "balanced" i.e.equal to 1
for EXACTLY half of all values of x( via G(k)) ,and 0 for the other half (via
g(k)).How FAST we
(via any algorithm i.e."P Vs NP problem" of computer scientists) can choose one
of the
above two,- i.e.computable via formal Godel logic using for EVERY language
accepted by
SOME."nondeterministic algorithm"in polynomial time is ALSO accepted by some
"deterministic algorithm "in polynomial (TIME)- function .Forming my intervals
(A.A+1000)
numbers I ONLY do
" elementary mathematical operations" which is connected with properties
of collection of "real numbers" which has a "multiplicative"structure (i.e.
directly connection)but not
necessarily an "additive" (i.e. indirectly ). I use "quantum parallelism
concept" in which interferes
STATES in the" superposition" using a" Hadmard transformation".Recently 10days
ago
Prof.Duncan G. Steel have found a method of Quantum computing by "TRAPPING the
spin
of one eletron in critical dark state-at rate of about 1 Ghz"Thus my numbers
in my intervals obey Q.F.T. C.-Quantum Fault Tolerance Computation, which obey
ONLY Ramanujan identities .In" sieve methods ",we can use to find prime factors
of integers which depend on techniques of approximating( i. e. self-delimiting
Turing
machine which strictly obey" Chaitin's halting probabilities"concept) the
number of integers
,which are FREE of small prime factors i.e. large factors only .
In my all above Astrophysics papers I used "Malmquist bias"which depend on
above
Deutsch -Jozsa algorithm.
please see my website......Read completely and then send e-mail to me.
http://vdmishraindia.googlepages.com/home
your sincerely
V.D..Mishra
M.sc.(physics,1966)
M.Sc
.(Math.1969)
Dear sir, Raipur (c.g)
India
Now I have retired from Govt. service and free to use computer at home with
internet facility.I have 3 sons all are using computer .My youngest son is doing
B.C. A.
Why" Super -sized Quantum Zeno effect" capable of beating the "random guessing
limit" in counterfactual
quantum computing (via" optical" implementation of "Grover search
algorithm")?.Because
Quantum computer (due to Tuple prime numbers properties via MY intervals(
A,A+1000)
numbers ) can ALWAYS perform better than classical computer in searching an
unsorted
database .Proof is my letter of Prof.Odlyzko 1990-1992 which he sent to me.Why
there are
2 groups(1) "small gaps "between primes,which obey above super-sized Quantum
Zeno effect"
Properties i.e.super division via Ramanujan Identities (2)"small gaps" between
ALMOST primes
,which obey Rogers Identities via ordinary divisions .
Now I have made my website which contains my
astrophysics papers published by me and my "new
number theory concept "relating the above astrophysics
paper's. Also two letters of(1)Prof.H.J. Godwin (2) prof.Odlyzko.
I am also ,at present, connecting (1)Analytic Number theory(via partial
randomness or
pseudorandom number's properties) (2) Natural Halting Probabilities (via MY new
Godel
logic) (3) Zeros of Riemann Zeta function's properties-see paper" Logic ,
Language ,Information
,Computability "by C.S.Calude and M.A.Stay of California ,U.S.A.2006.
and(4) Quantum Cryptography theory (via MY Q.F.T. C.concept) ,but I am using MY
intervals(A,A+1000)
number's properties ONLY-due to" Indian Place Value Principle". This is NEW
theory technique
for you which is used as Cryptographic tools (via (1)heat and (2) light signals
).Why in D.N.A
self- assembly- ubiquitous process- is often equipped with explicit mechanism
for both
(1)error prevention (2)error correction used in 1-neno -computation 2-
neno-technology.
Old"Euclid algorithm"or "Chinese's Remainders" must be replaced by present
"divide and conquer"
method (via Sierpinski's tiles).Classical "binary splitting"is deeply related to
my "twin primes
breaking time concept" due to Deutsch-Jozsa algorithm which uses 2 kinds of a
function 1-f(x) is "constant "for all values of x (like light signals for global
world), 2-or f(x) is "balanced" i.e.equal to 1
for EXACTLY half of all values of x( via G(k)) ,and 0 for the other half (via
g(k)).How FAST we
(via any algorithm i.e."P Vs NP problem" of computer scientists) can choose one
of the
above two,- i.e.computable via formal Godel logic using for EVERY language
accepted by
SOME."nondeterministic algorithm"in polynomial time is ALSO accepted by some
"deterministic algorithm "in polynomial (TIME)- function .Forming my intervals
(A.A+1000)
numbers I ONLY do
" elementary mathematical operations" which is connected with properties
of collection of "real numbers" which has a "multiplicative"structure (i.e.
directly connection)but not
necessarily an "additive" (i.e. indirectly ). I use "quantum parallelism
concept" in which interferes
STATES in the" superposition" using a" Hadmard transformation".Recently 10days
ago
Prof.Duncan G. Steel have found a method of Quantum computing by "TRAPPING the
spin
of one eletron in critical dark state-at rate of about 1 Ghz"Thus my numbers
in my intervals obey Q.F.T. C.-Quantum Fault Tolerance Computation, which obey
ONLY Ramanujan identities .In" sieve methods ",we can use to find prime factors
of integers which depend on techniques of approximating( i. e. self-delimiting
Turing
machine which strictly obey" Chaitin's halting probabilities"concept) the
number of integers
,which are FREE of small prime factors i.e. large factors only .
In my all above Astrophysics papers I used "Malmquist bias"which depend on
above
Deutsch -Jozsa algorithm.
please see my website......Read completely and then send e-mail to me.
http://vdmishraindia.googlepages.com/home
your sincerely
V.D..Mishra
M.sc.(physics,1966)
M.Sc
.(Math.1969)
Posted by:
V.D. mishra
2
Although its a great achievement in the field of computing . But the need of
time is to use the resources available onboard to its maximum(i.e need for
optimization of the available hardware) , which unfortunately on one is thinking
about . The need of time is to build faster desktop PC ... or a system that is
affordable to a person in need as it is not possible even for multibillion
organisation to possess such a mass computing asset...
time is to use the resources available onboard to its maximum(i.e need for
optimization of the available hardware) , which unfortunately on one is thinking
about . The need of time is to build faster desktop PC ... or a system that is
affordable to a person in need as it is not possible even for multibillion
organisation to possess such a mass computing asset...
Posted by:
Amol Jain
3
It's a breakthrough. And we need to explore all the possibilities of a faster
computer. However how long we will have to wait such a computer to be available
in the market is a concern.
computer. However how long we will have to wait such a computer to be available
in the market is a concern.
Posted by:
Jagathish
- Terror puts India among 20 most dangerous places
- Expatriate CEOs still feel safe in Mumbai
- Deccan Mujahideen email threatens Delhi
- UK's work-permit norms to affect Indian IT staff
- Expatriate CEOs still feel safe in Mumbai
- Inflation will moderate: Chidambaram
- Karnataka firms seek licence for modern weapons
- Taj hotel premises handed back to Tata group
- Air India cuts fares on all domestic routes
- Inflation will moderate: Chidambaram
- Terror puts India among 20 most dangerous places
- Mumbai terror: IT clients cancel Bangalore visits
- 'Terrorists have no religion; politicians, act responsibly'
- 'Mumbai terror strikes meant to hit Indian economy'
- Online social media comes alive during Mumbai attacks
- MNCs pay more to Indian staff
- Future CEOs may emerge from HR departments
- 'IT industry raised India's international image'
- Former PM V.P. Singh, the Mandal messiah, dies
- Bad bosses can give heart attacks to men




