Please create an account to participate in the Slashdot moderation system

 



Forgot your password?
typodupeerror
×
Hardware Science

World's First Programmable Quantum Photonic Chip 156

MrSeb writes "A team of engineering geniuses from the University of Bristol, England has developed the world's first re-programmable, multi-purpose quantum photonic computer chip that relies on quantum entanglement to perform calculations. With multiple waveguide channels (made from standard silicon dioxide), and eight electrodes, the silicon chip is capable of repeatedly entangling photons. Depending on how the electrodes are programmed, different quantum states can be produced. The end result is two qubits that can be used to perform quantum computing. Most importantly, though, unlike existing quantum photonic setups which require apparatus the size of a 'large dining table,' this new chip is tiny: just 70mm (2.7 inches) by 3mm."
This discussion has been archived. No new comments can be posted.

World's First Programmable Quantum Photonic Chip

Comments Filter:
  • sweet. i want 40-50 thousand made, and strewn on my bed. i would sleep like a baby.
    • Protip: silicon is not soft. Further, it probably has, y'know, copper inputs and outputs? 40-50 thousand of those (times however many pins each chip has) poking into your supple, greasy back are also not soft.
      • by Denihil ( 1208200 ) on Sunday December 11, 2011 @06:39PM (#38338252)
        i know! one time i slept on about 60 cat-5 cables on a 200+ person man LAN, it wasn't too bad. maybe if i laid in bed, and then had the chips on top of me? thanks for the input though :) i slept next to my frigid bitch of a ex girlfriend, so if i can handle near absolute zero temperatures, this should be a walk in the park.
        • Re:excellent. (Score:5, Interesting)

          by mikael ( 484 ) on Sunday December 11, 2011 @07:19PM (#38338410)

          That would be awesome to see - a hammock made of woven cat-5 cables.

          Once saw the interconnect of a supercomputer/rack server "styled" into ocean waves, rather than just some snake-pit of cables.

        • paranormally hilarious.
      • by Hentes ( 2461350 )

        Actually, the more pins are there, the more evenly your weight is distributed on them. 50 thousand pins are very close to a flat surface.

        • Not when they're randomly distributed in little uneven mounds. 40,000 of these chips would have a surface area of 6' x 16.29' when laid out in a rectangle, so to fit them all on a single-sized bed you'd need to stack them three or four layers deep. It would be more like sleeping on a bed of pine needles that stick up at odd angles. Don't worry, I've seen the "lying on a bed of nails!" videos too, and I know what you're talking about—but these would definitely be very uncomfortable unless you glued the
      • by TheLink ( 130905 )
        Many babies cry a lot, sleep for a while, wake up, cry a lot. Repeat...

        So the OP might sleep like those babies ;).
        • by Anonymous Coward

          Many babies cry a lot, sleep for a while, piss and crap themselves, wake up, cry a lot. Repeat...

          So the OP might sleep like those babies ;).

    • ... And after all this political madness finally a qubit of good news... :-p
  • ok (Score:5, Funny)

    by j00r0m4nc3r ( 959816 ) on Sunday December 11, 2011 @06:23PM (#38338158)
    but can you link it to the inverted phase-induced sub-space harmonic protocol analyzer to initiate a modulated tachyon pulse?
  • by Janek Kozicki ( 722688 ) on Sunday December 11, 2011 @06:28PM (#38338186) Journal

    For those who are unaware why qubits are so powerful: the computing power provided by qubits scales exponentially if compared to bits used in ordinary computing. For example if you had 20 qubits, that would be like doing simultaneous calculations on processor with internal register size of 1048576 bits. Roughly. That's orders of magnitude more than modern CPUs, which have about dozen of 64 bit registers.

    • by Janek Kozicki ( 722688 ) on Sunday December 11, 2011 @06:31PM (#38338202) Journal

      oh, and I forgot to mention - that's also the reason why quantum physics is so difficult to model using our today's computers. Monte carlo and other rough estimations are widely used. Only simplest problems (think harmonic oscilator) have analytical (and crazy complex) solutions.

      • by alexgieg ( 948359 ) <alexgieg@gmail.com> on Sunday December 11, 2011 @07:00PM (#38338332) Homepage

        I know qubits can be very useful at encryption/decryption/cracking and such, but I'm curious: what else would they be useful for? I mean, is there something that a typical desktop/workstation does today that could be improved by adding some qubit-based magic behind the scenes, similar to how GPUs (and FPUs before them) resulted in improved GUIs, games, CAD/CAM etc.? Or is this the kind of thing that's most probably going to remain restricted to specific fields, with very specific needs, for the foreseeable future?

        • by whovian ( 107062 ) on Sunday December 11, 2011 @07:18PM (#38338396)

          I wonder if it could be used for simulating consciousness. I mean, IBM's Watson is a machine with clever brute force implementation of language parsing and data retrieval. Quantum computing seems paradigm-shifting enough to effectively implement many Watson-type machines, perhaps.

        • by mikael ( 484 ) on Sunday December 11, 2011 @07:55PM (#38338620)

          The general rule for qubits seems to be anything that requires a unique solution but has to consider every possible combination of boolean states. Since they are Boolean zero or one values, that leads to cryptography because a relatively few number of bits would be required; 256,512,1024.

          GPU's do floating-point calculations in parallel, which is really good for those problems which have to apply the same algorithm to different data points, like CFD, physics, AI, image and signal processing.

          To represent floating-point data would require at least 16 qubits for half-floats, 32-bits for IEEE 754 standard floats, and 64-bits for doubles. But to do anything useful like CFD, would require storage of the entire state of the system which would require gigabits of data.

          Unless someone could shrink the problem of CFD modelling down to atomic scales using phantom atoms, and overlapping qubits onto the same logic, GPU's won't have any competition.

          • Now your going to suggest finding all of the Mercian Primes under 10^1000 or something. Just what we needed, more goddamn Mercian Primes. They're all over the place.

            • Re: (Score:2, Informative)

              by Anonymous Coward

              It's Mersenne primes. And use powers of 2, not 10.

            • by mikael ( 484 )

              Maybe there's an easier way than qubits. What if you could use natural resonance of something like a torus pipe. Set up one frequency to represent the quantity you are trying factorize as a ratio of the quantity to the circumference of the torus. This would define a standing wave pattern. Create some white noise into the system at one point. Factors of the value would then create points of minimum and maximum amplitude around the torus.

        • by frisket ( 149522 )

          ...what else would they be useful for? I mean, is there something that a typical desktop/workstation does today that could be improved by adding some qubit-based magic behind the scenes...?

          That is, will it run Emacs, LaTeX, and other important stuff? :-)

        • by hhawk ( 26580 )

          From the article it seems that one thing that we "just have to discover.. " we know it will be good at some applications but only actual use/engineering will fill in all the blanks..

        • by ceoyoyo ( 59147 )

          Quantum computers are sort of the ultimate parallel systems. That does mean they only work well on really parallel problems though. "Cracking encryption" means factoring large numbers - it goes much faster if you can try all the possibilities at the same time. Quantum computing may well remain a niche thing though, good for physical simulations and things like factoring (until everyone quits using that kind of encryption). Or maybe we'll think of entirely new uses.

        • Comment removed based on user account deletion
        • We could make mighty fast logical reasoners, text search would become even faster etc.

    • by HuguesT ( 84078 ) on Sunday December 11, 2011 @06:37PM (#38338246)

      Definitely. However right now we do not have 20 qubits in a device, we have 2 qubits today. If progress in physics and electronics allows us to have 3 qubits in 18 month, 4 qubits in 36 months and so on, we have just reinvented the quantum version of Moore's law.

      • by hweimer ( 709734 ) on Sunday December 11, 2011 @07:17PM (#38338384) Homepage

        Oh, we already have a quantum version of Moore's law [quantenblog.net]. However, the time constant for doubling is on the order of six years and not 18 months.

        • by HuguesT ( 84078 )

          Actually if the number of qubit we can manage doubles within some time constant, then this is cool, because I was assuming that it would increase *linearly* with time. If the qubits scale linearly and the traditional computers exponentially, ten quantum computers may never catch up to classical ones. However with exponential qubit growth they do have a chance irrespective of the time scale.

          Your linked article says that quantum computers will become interesting at about 50 qubits and that it might happen by

    • Bad news for crypto (Score:5, Interesting)

      by gillbates ( 106458 ) on Sunday December 11, 2011 @08:07PM (#38338688) Homepage Journal

      If what you say is true, this is truly bad news for cryptography. Algorithms like AES owe their security largely to the fact that brute-forcing all of the keys is generally impractical; with a 256 qubit machine, AES 256 would be cracked in *a single clock cycle*.

      If they can do this with two qubits, why not 4? Why not 8, or 128, or 512?

      In the same way the WWII cipher designers probably had a hard time imagining that in 40 years there would exist a machine which could crack their ciphers in real time, the designers of block ciphers like DES and AES probably had a difficult time imagining that their ciphers would be insecure in mere decades. DES took 30 years before brute force became practical; will AES survive even 20?

      It was just 20 years from the invention of the transistor to the first 32 bit computer. How long will it be before a machine with more computing power than in all of recorded history can be built on something the size of a postage stamp, for a few dollars?

      • by Prune ( 557140 ) on Monday December 12, 2011 @02:21AM (#38340652)
        This is plain wrong. Under a quantum-computer attack, AES256 is as strong as AES128. Thus, you simply need to double your key size. Most symmetric ciphers are safe. Most public-key, on the other hand, is indeed broken by quantum-computation. People often forget that for most things, quantum algorithms can only provide a quadratic speedup--not an exponential one!
      • If they can do this with two qubits, why not 4? Why not 8, or 128, or 512?

        Quantum decoherence. [wikipedia.org]

    • by Anonymous Coward on Sunday December 11, 2011 @08:15PM (#38338778)
      No, that's false. Quantum computing offers polynomial time algorithms for a very small set of problems for which classically only exponential time algorithms are known, particularly, instances of the hidden subgroup problem [wikipedia.org] (including integer factorization in the form of Shor's algorithm [wikipedia.org]). More generally, Grover's algorithm [wikipedia.org] gives some speedup to general NP problems, but not exponential. As I understand it, you would need a rather large quantum computer before it would actually faster than existing classical computers.
    • by marcosdumay ( 620877 ) <marcosdumay&gmail,com> on Sunday December 11, 2011 @08:25PM (#38338840) Homepage Journal

      The computing part does indeed act on every combination your register can have at the same time. An exponential speedup here, that part is right. What is missing on your post is that reading the result is kind of hard. We only know how to get usefull data from a few kinds of calculation, and we don't know if it is possible to get anything usefull from the general case.

      The good news is that if we ever discover a way to read the result of a general computation (if it is possible), we'd have discovered a nondeterministic computer. And forget about P ?= NP.

      • by Prune ( 557140 )
        In fact, speedup is generally quadratic, not exponential. The poster pulled the exponential part out of his ass, and should be modded down.
    • by Hentes ( 2461350 )

      Yeah well but this one only has 2.

    • This isn't accurate. Qubits don't in general give you exponential speed up. In particular, there's no known reduction of exponential time solvability to BQP (problems solvable on a quantum computer in polynomial time http://en.wikipedia.org/wiki/BQP [wikipedia.org] ). The known speed ups generally are for things that are less than exponential. So for example, integer factoring is in BQP by Shor's algorithm http://en.wikipedia.org/wiki/Shor's_algorithm [wikipedia.org] but the best known factoring algorithm is already subexponential. Most
    • by Prune ( 557140 )

      That's false; the power increases polynomially, not exponentially (usually power of two). This is the reason quantum computers can't solve NP-hard problems asymptotically faster than classical ones.

  • by vlm ( 69642 ) on Sunday December 11, 2011 @06:41PM (#38338272)

    I assume this is the same group (how many quantum computer groups are there likely to be in Bristol?) that did the whole "lets run Shors algorithm on a silicon etched chip" a couple years ago. So the new news right now is ... Or is this a re-reporting of that historical event, or another paper about that historical work? I'm just trying to figure out the whole timeline thing here.

    Hey /. editors, the recent interviews have been very interesting and all that, I'm just thinking interviewing the quantum group in Bristol would be even more interesting...

  • Just think what would be possible if the megalomaniacs weren't hogging all the money.
    • by Jeremi ( 14640 )

      Just think what would be possible if the megalomaniacs weren't hogging all the money.

      We'd finally find out what happens when the meek inherit the Earth?

  • by ross.w ( 87751 ) <rwonderley AT gmail DOT com> on Sunday December 11, 2011 @06:49PM (#38338300) Journal
    It takes hours to sort them out afterwards.
  • a beowulf cluster of these...

    Had to go there, this is /. afterall...

    • by rbmyers ( 587296 )
      Leave off the cluster as your project and demonstrate the interconnect that would make a cluster of quantum computers a sensible enterprise, and you will be remembered forever.
  • by MyHair ( 589485 ) on Sunday December 11, 2011 @07:10PM (#38338356) Journal

    Unfortunately, after you program it you no longer know where it is.

  • by Anonymous Coward

    Help me out.

    This would have happened sooner or later, and I am assuming it happened. Quantum computer are here to stay.
    Question is, what this means to general community of engineers and software developers ?

    I am perfectly aware that we don't have Hardware that is capable of supporting the work of this chip (RAM and HD don't make sense). Maybe in another 15 years.
    Does it mean complete shift of computing paradigm ?
    Instead of 100 servers, we have just small black-box in a backroom ?
    What will happened to all th

    • "(RAM and HD don't make sense)" Why?
    • by gweihir ( 88907 ) on Sunday December 11, 2011 @08:55PM (#38339022)

      Quantum computers are not "here" in any meaningful sense. Nobody ever has demonstrated a meaningful larger-numbers quantum computation (say, with numbers > 1000). At the moment, the there is no proof these will even work. It is still entirely feasible that the theory is wrong and large quantum computers are not possible or not useful. Even some tiny deviations from the current theory could cause that. Remember the results have to be physically measured and the input has to be physically put in. Both operations with huge, huge errors when compares to the precision classical computers achieve.

      Then, even if meaningful sizes can be built (which is entirely unclear at this time) they are not effective or efficient for most problems.

      Example: For breaking ciphers like AES, you get a square root on the key size, i.e. breaking AES-256 becomes as difficult as breaking AES-128 (both by brute force). Breaking AES-128 by brute force without quantum computers is quite infeasible in this universe. Breaking AES-256 by brute-force with quantum computers is quite infeasible in this universe as well.

      Forget about any large data-set problems as well. Unlike classical computers, you cannot break problems down for quantum computers. You always have to solve the whole thing in one go, or you lose the advantages.

      Bottom line: This is not a revolution, even if it turns out not to be bogus in the first place.

      • let sqrt(x) = x/2

        oh wait, i think you got something wrong there.

        • log2(sqrt(x)) = log2(x)/2

          (by key size, he meant the magnitude of the key, not the number of bits in the key)

          • by gweihir ( 88907 )

            Indeed. I should have said "square root of the key-space" instead to be clear. So half the bits, i.e. square root of the number of possible keys.

    • by Surt ( 22457 )

      Nothing happens to engineers. They just design quantum chips instead, at worst (but most likely: a mix of quantum and conventional computers is still required). Most likely it will still be decades yet before most even need to care.

      Nothing happens to programmers. A handful of library designers will work out the interesting bits. The rest will continue building applications on top of the libraries as usual.

  • Sounds delicious.

  • heck, I'll settle for snake, I'm an easy game consumer to please

  • Years ago, if someone had told me I might actually die by having my heart vaporized, in situ, by a T-101, I would have laughed.

    http://en.wikipedia.org/wiki/Quantum_computer [wikipedia.org]
    http://en.wikipedia.org/wiki/Artificial_intelligence [wikipedia.org]
    http://en.wikipedia.org/wiki/Self-replicating_machine [wikipedia.org]
    http://en.wikipedia.org/wiki/Military_robot [wikipedia.org]
    http://en.wikipedia.org/wiki/Directed-energy_weapon [wikipedia.org]
    http://en.wikipedia.org/wiki/Skynet_(satellite) [wikipedia.org]

    Not so funny anymore.

  • Star Trek called. They want their technobabble back.
  • by Reteo Varala ( 743 ) <reteo.lamprosliontos@com> on Monday December 12, 2011 @04:41AM (#38341078)
    Before mathematical capability was baked into the main processor cores, motherboards used to have mathematical co-processors, which could handle the advanced math in a computer. Even if a quantum chip cannot compare with a classical chip's calculation performance at this time, just how feasible would it be to include a quantum co-processor on a classical motherboard for quantum calculations? Would the two combined provide any benefit that either by itself could not?
  • Wake me up when I can order a dozen from Digikey.
  • OK, what if this universe is just a simulation, running on a huge (comparatively) quantum computer. Now what if it was such a wicked simulation, that some beings within it, became more than just simulations but rather self aware. What if they started poking around at the fabric of the universe (being a simulation), and start to see some of the underpinning of that quantum computer. So they build quantum computers. Eventually in an effort to discover the answers to their questions, they try to model a univer

  • but does it run Crysis?

Understanding is always the understanding of a smaller problem in relation to a bigger problem. -- P.D. Ouspensky

Working...