Slashdot Mirror
Purdue Builds Quantum-Computing Semiconductor
Bfaber writes: "According to EET, Purdue has created the first examples of quantum computing in a semiconductor. The story can be read here. Read the article for further links that include an audio interview."
Try this one (http://www.eet.com/story/OEG20010924S0101)
Blah, blah. Lameness filter doesn't like short posts so I'll put a little padding here. Sorry to ramble, but you know how it is...
Be careful. People in masks cannot be trusted.
http://www.eet.com/story/technology/OEG20010924S01 01
www.eet.com/story/technology/OEG20010924S0101
http://www.eet.com/story/OEG20010924S0101
- Kaos games and encryption systems developer
The link reports error 500 continuously.
http://news.uns.purdue.edu/UNS/html4ever/010917.Ch ang.quantum.html
Tom.
Oh arse
If you havn't you should read a book by Simon Singh called the "Code Book" it essentially is a history of cryptography from beginning to end (e.g. quantum cryptogrophy)....
The effects of quantum cryptography is huge... Using a quantum computer would allow you to crack huge keys (everything from PGP, RSA, DES, TwoFISH, BlowFISH, etc.... anything you can think of) because of the essential basis of quantum physics...
Simply in laymen terms you can check muliple cases of a key (i.e. check 111111 and 111112) at the same time... Not just 2 keys but, how about 2 billion keys per second... This makes any key no matter how long easily crackable...
I promise you the NSA is up early this morning banging on doors at Purdue (hey the probably funded it anyway)....
Now don't fear... Even though it makes any code breakable it also inheriently creates an unbreakable code using the same theories...
So start writing all you stuff down and locking in a safe instead of encrypting it on your hard drive.... You data really isn't safe anymore...
seems to me its the Magnetic Resonance ( as used in MRI) !! In classical physics its the spins, in quantum its the states.
Experts confirm, correct, negate?!?!?
Voltaire: God is dead.
God: Voltaire is dead!
Its about time they finally pulled it off
Well I suppose now somebody is going to have to update the Quantum modules so they use this stuff :)
if (any(@value) is very useful, but the inclusion into Perl 6 is (AFAIK) currently under RFC . The thought of quantum Perl on a quantum computer makes me feel all tingley...
-- Dooferlad
If they manage to get quantum computing working soon, and working well, we can forget these planned anti-crypto laws. Most crypto algorithms would go useless.
With quantum computers, the only way to do crypto would be transferring huge XOR mask keys physically (or possibly with quantum encryption channels). Pretty hard.
It's easy to get confused about quantum computers, because the media hype doesn't take into account the fact that you need at least two degrees (comp sci and physics) to understand it properly... guess what, I don't have these! But I do have the first, and my girlfriend has the second. :-)
/ vo l4/spb3/
Quantum cryptography itself is not an algorithm as such, but a way of using the inherent uncertainty in the polarisation of photons to ensure completely private communication. There are some labs which claim to have such a scheme working, but it's a long way from becoming feasible on a large scale.
Basically, it works on the principle that observation changes the observed event. You can ensure a secure (non-eavesdropped) channel by makeing sure that every photon has arrived correctly. If an intruder has observed your message, then the message itself has changed (at the quantum level)! I'm really not sure how it all works either, but there is plenty of published work.
The other crypto-related quantum computing thing is Shor's algorithm. For a reasonably good explanation:
http://www.doc.ic.ac.uk/~nd/surprise_97/journal
In essence, factorisation of large numbers (which is an NP complete problem on conventional hardware) can be done really quickly. This threatens RSA, Diffie-Hellman etc (anything which relies on the non-factorability of products of large primes).
I expect there's a similar "quantum" attack on symmetric encryption schemes like IDEA and DES, which would just do very fast brute force searches on the key space.
Hope this clears up some misconceptions!
These sigs are more interesting tha
At http://www.eet.com/printableArticle?doc_id=OEG2001 0924S0101
but who will be able to have a computer that will be able to crack some of the hardest encoding algorithms known to man in a matter of hours?
--donabal
Safety First Day?
Maybe the Purdue group will be able to shield their quantum dots from decoherence better than previous research on such objects has done so far. But as far as I know there is no getting around this; the best anyone can do is compute everything and read out your results before decoherence sets in.
This is not such a big breakthrough, folks. Hold onto your hats. If they can show that they can do operations much more quickly than old methods of dealing with quantum dots, or they can keep decoherence at bay longer than anyone expected, that would be the big breakthrough.
Qu'on me donne six lignes écrites de la main du plus honnête homme, j'y trouverai de quoi le faire pendre.
Isn't a cup of really hot tea also a semiconductor?
It takes a tough man to make a tender Semiconductor.
The same page also lists a style of computer that uses off-the-shelf optical components and light interference. A database running on such a device is essentially an acoustic wave. What if an AI was written, that took advantage of the ambiguity a quantum computer provides, and that stored it's output in the optical interference computer, modulating that wave over time as new data was considered. Data from input devices would be understood within the context of its remembered experience. Might we have a computer that thinks and remembers like we do? A computer that thinks? A computer that dreams?
Somebody please correct the problems here. I don't really know what I am saying and am bound to be wrong in places.
-j
What would a mass production chicken farm need with a quantum computing semiconductor?
Outdoor digital photography, mostly in New Engl
All connections are point to point, we just use routers, switches, hubs and bridges to manage the traffic.
Moving away from the cryptographic arguments for just a moment, you could share a quantum entangled pair with your ISP. They could use pairs to replace current links, so you end up with a system which is only slowed down by switching latency. Just imagine a cross world (or even from here to Mars) link with zero latency... Martian Quake!
-- Dooferlad
Researchers are indeed working on long distance quantum cryptography. See this economist article from June this year.
Basically, a team at Los Alamos in New Mexicio are hoping to send quantum photons accross 10 Km of dessert. If that works, it shouldn't be much more difficult to send secure data to and from a satellite in orbit (since most of the 'thick air' is below 10Km, if you can get it that far, the rest of the way is fairly easy)
All this was discussed in an old slashdot thread
-- We don't understand software, and sometimes we don't understand hardware, but we can *see* the blinking lights
This runs the risk of drifting even more offtopic, but what the hell.
Some researchers have found that a neural net can indeed, in some circumstances dream.
Basically, you train it up to recognise faces or tin cans on a production line or whatever, and then you disconnect its inputs. This is equivilent to a human going to sleep. Then the middle layers of the network will drift from state to state, lingering for a time on the various memories it has stored as well as random stuff. This can be read out and displayed by the controling computer or program.
See this link for some more info.
-- We don't understand software, and sometimes we don't understand hardware, but we can *see* the blinking lights
ResearchIndex should be in everybody's bookmarks.
h tml
In the previous post, I wasn't quite clear (shoot me, it's 5am and I've been up all night): there are a couple of different methods that I was pulling information from. In the penultimate paragraph, the final sentence was an aside referring to a method of using entanglement to transfer the keys. The rest of the post was referring to a method using polarisations and Heisenburg. Here are the two links to the papers.
First, for the transfer by polarisations. If you are at Cal, then go ask Vazirani, it looks like he has coauthored with them: http://citeseer.nj.nec.com/bennett92experimental.
Then on the use of entanglement (they do not have the actual paper, bastards): http://citeseer.nj.nec.com/context/18763/0
-j
Wow! ..., Can you imagine a Beowulf cluster of these?
If we are exchanging one-time pads then this appears to me to shift the weakness to how random your random-number generator really is (find a pattern allowing you to recreate the random number stream then the quantum crypto is useless). The other thing that springs to mind is that for a one-time pad to be totally secure it needs to be as long as the data itself and cannot be reused. This means extra latency as you set up a pad the same size as the data transfer for stateless communication (though for persistant connections I assume there will be a constant out-of-band stream topping up a large buffer to be used between end points).
Phillip.
Property for sale in Nice, France
QC may break all your key codes, but one thing it can't do, invade your snail-mailbox. start using zip disks and jaz disks for file swaping, or CD-Rs, then use the snail mail system to get them to their destination. what is more private than that?
and please tell me what Congress person whould have the balls to suggest infringing on an old-school right to privacy? people would look at censoring snail-mail like breaking down thier door at their home.
I am the Alpha and the Omega-3
Being able to understand the technicals of quantum computing, at best, only moderately well, and being remarkably bad at recalling them as anything more than vague and nebulous concepts, I am in no position to even attempt to compare the alternate approaches I have read about over the past several months, but I am wondering if anyone can either answer my questions here, or point me to an article that does. I'm not looking for immense detail; I'd rather just have an answer with basic supporting facts.
What I'm wondering:
One thing that caught my attention is that the quantum dots they used were 180 nm across. That's 0.18 microns, which is larger than current silicon chip lithography processes, which can etch at 0.13 microns, or 130 nm. I realise we're comparing apples and oranges, and that it is superposition (and entanglement, I think) that yields the real power of quantum processors, but I always imagined that a true quantum processor would have much smaller transistor and subsequently die sizes. I know they talk about going as small as 50 nm (0.05 micron), but iirc, IBM is researching (with some success, can someone pull the article?) similarly small lithography techniques for silicon chips too.
Any informed people in the slashdot community who can address these questions? Since I am writing a science fiction novel that integrates quantum computing, and I'd like it to be as realistic as I can potentially make it with educated guessing (hahaha, I hear you smirking already), I'd appreciate any help.
A word can paint a thousand pictures
And the worst is that there were not cat at all...
Yeah, that hacker Shaft is one bad mutha...
>>Shut yo mouf!
I'm just posting about Shaft!
>>...we can dig it!
blah, they were able to put dots on a wafer. the problem is that they ar NOT USABLE FOR ANYTHING. the problem with quantum computation comes when you interact with the quantum system. even operations like getting the state of the system alter it, and thus make it unusable. even with quantum correcting codes (QCC), a traditional silicon environment was long ago ruled out as being viable. nice to see researchers are still interested in the implementation though.
Website Hosting
there is No Such Agency that would be able to do that!
Yes, it does sound uninformed, and the fact that you're asking it probably means you really know rather little about what quantum computers are really about. The paradox about quantum computers is that they don't need to be faster than their classical counterparts, and in fact, the most of the really promising methods, like the NMR bulk-spin resonance techniques for instance, are far, far slower. These methods based on nuclear spins have clock rates that are measured in kilohertz. Yes, mere thousands of cycles per second. If you use a quantum computer to do the same things a classical computer does, in the same way, you can expect no real improvement. The real advantage in using these computers, which is what makes such a computer "faster" than its classical counterparts is the new paradigm of computing the quantum models of computation allow: that of performing computations on superposed states.
For instance, if you had a register that contained 256 qubits, placed them in an equal superposition of 1 and 0, and performed some calculation on that register, you will have potentially produced 2^256 results, 10^77 or a hundred million million billion billion billion billion billion billion billion results, which is more results than the number of sub-atomic particles in the visible universe! Of course, once you measure your qubits you only get one of these innumerable results, but there are more subtle ways of measuring the qubits that will give you information common to all of the results. That's what all of these algorithms for quantum computers are about.
Essentially, if you had 256 qubits each running at 1 kHz, you would have 10^77 processors running at 1 kHz! Now wouldn't that be faster than any computer in the world if you could use it properly? It's like having a slow computer for every sub-atomic particle in the universe! What's needed now are algorithms that try to find structure in various problems that can exploit this sort of parallelism.
Shor's algorithm, for instance, is able to factor integers and compute discrete logarithms in arbitrary finite fields in O(n^2) time, by using a special technique (the quantum Fourier transform) to cause the results we aren't interested in to interfere destructively and so won't be measured when our superposition collapses. Grover's algorithm, which does unordered searches in O(sqrt(n)) time, leverages quantum parallelism in a similar way.
The real upshot, and a likely SF novel plot that involves quantum computers, comes from the fact that all public-key cryptography in widespread use today depends on the factoring (RSA) and discrete log (El Gamal and elliptic curve techniques) problems. These problems are thought to be intractable using a classical computer, but with Shor's algorithm and a large enough quantum computer, perfectly feasible. Obviously, no one has yet made a quantum computer with more than a handful of qubits (I believe seven qubits is the world record, meaning they could theoretically factor the number 126!), so these schemes are still quite secure. Other practical problems plague implementors. But if someone, somewhere, dreamed up a way to make quantum computing practical (i.e. making a quantum computer with thousands of qubits that could perform calculations stably), all public-key cryptography would fall apart. Whoever invented such a device could potentially break the root certificates of Verisign and other CA's, compute private keys, impersonate every e-commerce site in the world, read all PGP or S/MIME-encrypted email, forge all kinds of digital signatures, create bogus international banking transactions, and so on and so forth. Grover's algorithm would also increase the range of keys that can be feasibly brute forced for symmetric crypto (how much exactly depends on how fast your quantum computer is). Naturally, it would be a device intelligence agencies all over the world would kill to obtain. Ever see Sneakers?
If you're looking for more in-depth information that you can understand without a graduate degree in both physics and computer science (the way most of the preprints on lanl.gov tend to be), you can start by looking here.
Qu'on me donne six lignes écrites de la main du plus honnête homme, j'y trouverai de quoi le faire pendre.
I think it's worth pointing out that the linked article reads:
...a discovery that might lead to semiconductor-based quantum computers.
Emphasis mine.
Good reference - Brassard's Bibliography
Bill Stewart
New Fast-Compression-only CPR http://preview.tinyurl.com/dy575ks
A quatum computer can solve NP-complete problems in polynomial time, someone takes another step to building one of those and all you can think is DIGITAL PRIVACY? Either I don't know what an np-complete problem is and how solving one relates to solving other np-compelete problems or you are complete nuts.
Gentlemen, you can't fight in here, this is the War Room!
or sparkle or whatever the fuck that paper was.
:)
if I recall correctly, that was shown to in fact not be a true quantum process but instead massively parallel.... but since I haven't read the perdue link yet, hard to say
There are some odd things afoot now, in the Villa Straylight.
My understanding is that the main high point of quantum computers is the ability to use quantum entanglement to do an exponential amount of computation. My understanding is also that only two useful base algorithms have been invented: factoring done in polynomial time, and database search sped up by square-root. Are there other algorithms [not just spin offs of these two] that benefit from entanglement? Anyone know for sure? [I am also aware that quantum randomness can be used in crypto, but I am interested in entanglement algorithsm]
If you think of a series of coin flips being used to generate a key or one time pad, entanglement basically allows 2 coins to be made, such that when simultaneously flipped, they always land with opposite sides up. You can't control which side yours will land on, so you can't control which side the other will land on. You do know, however, that every time yours lands on heads, the other one landed on tails. So you and your friend each take a coin, and whenever you need to communicate, you both start flipping. One of you bitwise NOTs your data, then you encrypt and send the message. Your friend can then easily decrypt it with his key.
One pair of entangled particles can only be used for one flip, however. So if you want a real key, you need a continuous stream of entangled particle pairs from a single source. Small modifications to this system allow the easy detection of anyone eavesdropping on the entangled particle stream.
Bugrit! Millenium hand and shrimp!