Jump to content

Quantum Computing


Recommended Posts

Posted

aren't you into TG and blackfriday madness  :police:

no interest sorry 

Posted

aren't you into TG and blackfriday madness :police:

he is legend :p
Posted

practically possible a quantum computing?

Unlimited data is a myth and a scientifically impossible. even quantum computers are hypothesized in such a way that one can use the electron exit levels of certain atomic conglemorates to represent a quantum bit. Inorder to represent infinite memory using a quibit schema, one needs to slow down the electron cloud to a stand still. i.e in such a way that to fix completely the position of the orbitals which when coupled with heisenberg uncertainity implies that one cant even locate the momentum of the electron cloud, which makes it a quantum impossiblity. 
 
the only direct use of quantum computing is that if one can come up with a quantum search algorithm or equivalently an algorithm that is turing complete, given the addditional dimesions (compute and storage) one can scour the search space in polynomial time making currently a subset of NP complete and NP hard problems, polynomial time bound.
 
Nothing less nothing more it is a mammoth task, if and if there are only few places who are spending energies on building quantum machines, even if built to function efficiently, the physics of the devices is insanely complex to even mend it to even easy problems.
Posted

 

Unlimited data is a myth and a scientifically impossibile. even quantum computers are hypothesized in such a way that one can use the electron exit levels of certain atomic conglemorates to represent a quantum bit. Inorder to represent infinite memory using a quibit schema, one needs to slow down the electron cloud to a stand still. i.e in such a way that to fix completely the position of the orbitals which when coupled with heisenberg uncertainity implies that one cant even locate the momentum of the electron cloud, which makes it a quantum impossiblity. 
 
the only direct use of quantum computing is that if one can come up with a quantum search algorithm or equivalently an algorithm that is turing complete, given the addditional dimesions (compute and storage) one can scour the search space in polynomial time making currently a subset of NP complete and NP hard problems, polynomial time bound.
 
Nothing less nothing more it is a mammoth task, if and if there are only few places who are spending energies on building quantum machines, even if built to function efficiently, the physics of the devices is insanely complex to even mend it to even easy problems.

 

 

tammudakkai neeku nidra raavatleda inka oozybk.gif

Posted

tammudakkai neeku nidra raavatleda inka oozybk.gif

 

looking for iphone 6s deal :)

Posted

looking for iphone 6s deal :)

 

akkai neenu kooda choostunna.. target and sam's lo $250 gift card vundi gaa.. oozybk.gif

Posted

akkai neenu kooda choostunna.. target and sam's lo $250 gift card vundi gaa.. oozybk.gif

 

ya, looking for better deals. 

Posted

ya, looking for better deals. 

 

akka inka phuket ki adigetatlunnav gaa oozybk.gif... naaku kooda msg cheyyu neeku dorkithee oozybk.gif

Posted

akka inka phuket ki adigetatlunnav gaa oozybk.gif... naaku kooda msg cheyyu neeku dorkithee oozybk.gif

 

dint get u. ok sure ga chesta if i find

×
×
  • Create New...