Slashdot Mirror


Physicists Made An Unprecedented 53 Qubit Quantum Simulator (vice.com)

Two teams of researchers have published papers [1, 2] in the journal Nature detailing how they were able to create unprecedented quantum simulators consisting of over 50 qubits. The University of Maryland team and National Institute of Standards and Technology team -- the two teams behind one of the two new papers -- were able to create a quantum simulator with 53 qubits. Motherboard reports: Quantum simulators are a special type of quantum computer that uses qubits to simulate complex interactions between particles. Qubits are the informational medium of quantum computers, analogous to a bit in an ordinary computer. Yet rather than existing as a 1 or 0, as is the case in a conventional bit, a qubit can exist in some superposition of both of these states at the same time. For the Maryland experiment, each of the qubits was a laser cooled ytterbium ion. Each ion had the same electrical charge, so they repelled one another when placed in close proximity. The system created by Monroe and his colleagues used an electric field to force the repelled ions into neat rows. At this point, lasers are used to manipulate all the ytterbium qubits into the same initial state. Then another set of lasers is used to manipulate the qubits so that they act like atomic magnets, where each ion has a north and south pole. The qubits either orient themselves with their neighboring ions to form a ferromagnet, where their magnetic fields are aligned, or at random. By changing the strength of the laser beams that are manipulating the qubits, the researchers are able to program them to a desired state (in terms of magnetic alignment).

According to Zhexuan Gong, a physicist at the University of Maryland, the 53 qubits can be used to simulate over a quadrillion different magnetic configurations of the qubits, a number that doubles with each additional qubit added to the array. As these types of quantum simulators keep adding more qubits into the mix, they will be able to simulate ever more complex atomic interactions that are far beyond the capabilities of conventional supercomputers and usher in a new era of physics research. Another team from Harvard and Maryland also released a paper today in which it demonstrated a quantum simulator using 51 qubits.

70 comments

  1. That's all fine and dandy... by Anonymous Coward · · Score: 0

    But can it run Crysis?

    1. Re:That's all fine and dandy... by freeze128 · · Score: 4, Funny

      Well, it *CAN* and it *CAN'T*...

    2. Re:That's all fine and dandy... by Anonymous Coward · · Score: 1

      I peeked inside. It can't now. :(

  2. Ummm...Yay? by Shogun37 · · Score: 0

    Sounds like a lot of trouble to reinvent an abbcus (yes, I probably misplelled it. Oops.) It does seem like another small step forward.

  3. Does this impacts any KeyEx by sinij · · Score: 2

    For uninitiated, does it mean some of our KeyEx methods that rely on factorization are about to get broken?

    1. Re:Does this impacts any KeyEx by rogoshen1 · · Score: 1

      Seriously? That's *EXACTLY* what this'll be used for -- just give it some time..

      the NSA and FBI feel entitled to decrypt everything to you know, keep us safe.

      They'll probably issue a gag order to the research teams to prevent them from going public with their findings, and a press release like this one will be the last we ever hear about the technology.

    2. Re:Does this impacts any KeyEx by Anonymous Coward · · Score: 0

      There are at least some reputable experts in both the quantum computing and cryptography research domains who believe that cryptanalysis of classical ciphers is the *only* thing that quantum computers will be used for, if a large-scale quantum computer is ever built. At least, that's about the only compelling application that we know for sure that a quantum computer can do fundamentally better than a classical computer at a comparable cost. And a not insignificant fraction of funding for research in quantum computer comes from folks who are interested specifically in the cryptanalytic applications.

      But to answer the parent's question: nope. Even if this were the sort of quantum computer that could run Shor's algorithm, 53 qubits isn't even beginning to come close to threatening any deployed crypto.

  4. Is it true? by Anonymous Coward · · Score: 0

    Is it false?

    Is it ... BOTH!

  5. Scott Aaronson's take by JoshuaZ · · Score: 4, Informative

    Scott Aaronson, a prominent quantum computing expert made comments about some very similar work that is relevant https://www.scottaaronson.com/blog/?p=3512. The short summary is that we should expect people to continue to push up how many qubits can be practically simulatable. But that sort of improvement through clever tricks and the like doesn't really do much to address the more interesting issue of quantum supremacy https://en.wikipedia.org/wiki/Quantum_supremacy, whether there are problems that a quantum computer can solve that a classical computer practically cannot. Note that the "practically" in the previous sentence is really important. Everything a quantum computer can do a classical computer can do with exponential slow down; standard conjectures essentially amount to saying that a classical computer cannot do any better than that.

    1. Re:Scott Aaronson's take by Nemyst · · Score: 1

      While that's true, I think having realistically usable quantum computers with stable enough qubits to perform interesting calculations is an important step towards determining whether quantum computers are any better than classical computers. In doing so, you increase the interest in quantum computers, since they can do more than novelty calculations or toy programs, which in turn increases research on further applications for them. The more eyes there are on the problem, the more likely it is that we'll figure out the answer.

  6. RSA by manu0601 · · Score: 1

    How much qubits do they need to break RSA?

    1. Re:RSA by Anonymous Coward · · Score: 1

      They're gonna need about tree fiddy.

    2. Re:RSA by Anonymous Coward · · Score: 0

      just go thru the backdoor.

    3. Re:RSA by Anonymous Coward · · Score: 0

      Thousands. Depending how big the key was. Don't hold your breath.

    4. Re:RSA by z3alot · · Score: 2

      After some googling, one source says about 4000 qubits to break 2048-bit RSA keys. Another says 10000 for the same job

    5. Re:RSA by Onthax · · Score: 1

      How many to break Bitcoin?

    6. Re:RSA by Anonymous Coward · · Score: 0

      In theory a quantum computer only needs as many qbits as the keylength. Qbits can test both combinations at once, thus in conjunction with many others we could break any encryption key in one cycle. In theory...

      The sources that claim 4k or 10k for a 2048k key are misinformed themselves or don't know how quantum computing (theory) works.

    7. Re:RSA by Anonymous Coward · · Score: 3, Informative

      The sources that claim 4k or 10k for a 2048k key are misinformed themselves or don't know how quantum computing (theory) works.

      You're more than welcome to point out the specific thing they get wrong, as there are plenty of detailed accounts of how many qubits are needed for Shor's algorithm, e.g. here's a paper discussing the trade-off of space vs. speed scaling. Much like classical digital circuitry, you need some scratch space to store intermediate values, and more space lets you use fewer operations for quicker results, or less space requires more operations.

      Even the naive implementation of Shor's algorithm for n bit number requires 2n qubits, and takes special efforts to make that work with a minimum n+1 qubits by reusing a qubit n times (greatly increasing the time the whole system needs to hold together).

    8. Re:RSA by alexgieg · · Score: 1

      Don't hold your breath.

      If there's one rule of thumb for how technology develops, it's that it follows S curves. Slow in the beginning, then absurdly fast in the main development phase, then slow again once most of it has been developed. That's how it went with industry, then computing, now biotechnology (we're beginning to enter the exponential part of the curve), and how it's going to be with Quantum computing once the threshold of industrial production of qubits is achieved.

      So, if Quantum computing is currently at its "vacuum tube" stage, sure, it seems like things will still take a while. Once it gets into its Moore's law stage though, well...

      And the thing is, we don't actually know whether we're close or not to that turning point. It might happen that next year someone will announce they have found a method to get as many qubits as needed to any application on a logarithmic scale of cost-per-qubits. Or it might take 40 more years of research before we get anywhere close to that. Who knows? One way or another, once it does enter the exponential stage, and begins being used for biotech research (protein folding is a Quantum system, so I imagine Quantum computers would be particularly good at it), my, things will change! And fast!

      --
      Conservatism: (n.) love of the existing evils. Liberalism: (n.) desire to substitute new evils for the existing ones.
  7. How many nanoseconds did the qubits last? by Anonymous Coward · · Score: 0

    Qubits made so far last fractions of a second.

    And it seems this is a qubit simulator? (i.e. no actual quantum states going on)

    Is that like having a turtle participate in a simulation of a race car?

    Or is there some actual meat here on some way to get more performance out of a conventional computer but performing calculations in an unconventional manner?

    1. Re: How many nanoseconds did the qubits last? by Anonymous Coward · · Score: 0

      It is not a simulator of qubits, it uses qubits to simulate a specific problem. This is a special purpose quantum computer using actual quantum behaviour.

    2. Re: How many nanoseconds did the qubits last? by Anonymous Coward · · Score: 0, Interesting

      Admit it you like stupid circular definitions that do not provide any useful information or answer a real life question. You faggots should just die, useless parasites.

    3. Re: How many nanoseconds did the qubits last? by Anonymous Coward · · Score: 2, Informative

      How is it circular? This is no different than saying, "A hydraulic computer is not modeling water flow without water, but is an analog computer using water to model other things."

      GGP said this uses no actual quantum states. GP says that is flat out wrong: This computer uses qubits, but is not a general purpose quantum computer. It is the same difference as between a general purpose cpu and a fixed logic circuit that does one thing, but still uses bits.

      If that seems circular, then it is because your reading comprehension has been impaired by your preoccupied with where people stick their genitalia.

  8. Can it crack 53-bit encryption in one cycle? by Anonymous Coward · · Score: 0

    No?

    Until physicists prove or disprove that claim of quantum computation, it's just a toy that might be more efficient than a classical computer some of the time at the same clock speed and bitrate.

    1. Re:Can it crack 53-bit encryption in one cycle? by HuguesT · · Score: 1

      Others have pointed out that it should be able to break a 21-bit key (half the number of qbits).

    2. Re:Can it crack 53-bit encryption in one cycle? by Anonymous Coward · · Score: 0

      Assuming you don't need any error correction and the qubits work perfectly (which still means there is a chance of giving the wrong answer on the first run), you can do factor a 21 bit number with a 53-bit general purpose quantum computer. If your qubits had low error rates anyway, you could in principle factor a 52-bit number with 53-qubits, just the quantum part of the algorithm would take more steps. Requiring error correction or trying to use some other speed optimization to get the quantum part to go faster could amount to requiring a lot more qubits though (e.g. 5n+1 qubits in on scenario in a paper linked to in another thread).

      But that is all irrelevant to the device in TFA, as it is not a general purpose computer that can factor numbers using Shor's algorithm.

    3. Re:Can it crack 53-bit encryption in one cycle? by Hal_Porter · · Score: 1

      Is there any way to use a 53 qubit quantum computer to crack a longer key faster than a classical computer but slower than a quantum computer with more bits? I.e split Shor's algorithm up into multiple stages?

      --
      echo -e 'global _start\n _start:\n mov eax, 2\n int 80h\n jmp _start' > a.asm; nasm a.asm -f elf; ld a.o -o a;
    4. Re:Can it crack 53-bit encryption in one cycle? by Anonymous Coward · · Score: 0

      (AC you replied to)

      i would be damn impressed if there were a way to break the problem up. The problem is you are trying to factor a number that is made by multiplying two primes together... so you can't just slice part of the number off and factor that to figure out what the factors of the whole number is. The prime factors won't have any smaller factors to work with. I won't say it is impossible, as I'm not that good with the number theory beyond a point (I'm coming from the physics side), but I would be surprised if someone did figure it out and am guessing it would be something radically different from Shor's algorithm.

  9. Qubits by Anonymous Coward · · Score: 0

    Imagine a Beowulf cluster of these!

    1. Re:Qubits by SuperKendall · · Score: 1

      Now THAT is a classic I have not seen in some time.

      --
      "There is more worth loving than we have strength to love." - Brian Jay Stanley
  10. Bitcoin by Anonymous Coward · · Score: 0

    The question now is how many bitcoin can I mine with it?

  11. Thats enough qubits. by fleabay · · Score: 5, Funny

    53 qubits ought to be enough for anybody.

    1. Re:Thats enough qubits. by Anonymous Coward · · Score: 0

      And 640KB of non-quantum memory is more than any "personal" computer will ever need. Eight characters is more than enough for a file name, especially since you can also add a three character extension. And 32 bits for an IP address will be able to handle more computers than we could ever image being connected fo a network.

    2. Re:Thats enough qubits. by Anonymous Coward · · Score: 0

      And 20 years of sarcastic 'ought to be enough for anyone' comments ought to be enough for readers to understand Sarcasm.

      (That wasn't sarcasm btw) :)

  12. Super Impressive:magnetizing coherent light. by Neuronwelder · · Score: 1

    And lining them like a group of balls on a billiard table. But even if this idea comes true, to being a real regular computer that works on your desktop. Will the Net Neutrality put all this tremendous work in vain?? It's like putting a Tesla that will go 0 to 60 in three seconds. On a road that only goes 10 miles an hour.

  13. Shortcut by Neuronwelder · · Score: 1

    I wonder if you can use this same technology to employ line of sight. House to house transmission of data? That would be cool! Game with your neighbors!

  14. Only 247 more qubits by hyades1 · · Score: 1

    That would give them a decent start on building an arq.

    --
    I've calculated my velocity with such exquisite precision that I have no idea where I am.
    1. Re:Only 247 more qubits by Anonymous Coward · · Score: 0

      Booo! Get off the stage!

    2. Re:Only 247 more qubits by Miles_O'Toole · · Score: 1

      I'm here 'til Sunday. Try the fish.

      --
      Only two things are infinite, the universe and human stupidity, and I'm not sure about the former.
  15. Yes they can! by Anonymous Coward · · Score: 1

    They can bubble sort faster than 'classical' computers. Only sometime the results won't be sorted properly, and often it will be slower than qsort.

    Quick take my money, I'm gullible!

  16. Quantum cumputer explanation fail by Anonymous Coward · · Score: 0

    I've seen tons of stuff along the lines of "qubit can exist in some superposition of both of these states at the same time" but how can you program that? I've yet to see a decent explaination of how quantum computer really works, inputs-to-answer, it's all too laymanized or too opaque.

    1. Re:Quantum cumputer explanation fail by Anonymous Coward · · Score: 0

      Anyone with enough algebra to work with vector components can learn a huge chunk of undiluted (not "laymanized") quantum mechanics. If you can do algebra, then learn bra-ket notation which will sweep calculus under the rug for you. At that point Wikipedia level articles on topics from quantum teleporation to quantum computers are pretty straightforward about exactly what they are doing with the states involved. There should also be plenty of free class notes around from graduate level courses that will go into more detail, but without that much advanced math, assuming students did the grunt work in an intro QM course.

    2. Re:Quantum cumputer explanation fail by sexconker · · Score: 1

      quantum teleporation

      Stop. Go directly to jail. Do not pass GO. Do not collect $200.

      Teleportation violates causality. Stop using that fucking word for things that are absolutely not teleportation.

    3. Re:Quantum cumputer explanation fail by Anonymous Coward · · Score: 0

      Teleportation violates causality. Stop using that fucking word for things that are absolutely not teleportation.

      It only violates causality if it transports information faster than light. Even in sci-fi, teleportation does not imply FTL in many stories... so who says that is actually a necessary requirement for the word?

    4. Re:Quantum cumputer explanation fail by z3alot · · Score: 1

      Well im not happy with the word the physicists have chosen either, but this is actually established terminology. It refers to the ability to transfer a qubit by actually transfering 2 classical bits, provided the two parties have preshared an EPR entangled pair of qubits.

    5. Re:Quantum cumputer explanation fail by Anonymous Coward · · Score: 0

      The whole amazing part of quantum teleportation is that an unmeasured quantum state essential appears at the destination (with the help of a classical communication channel) after being destroyed at the source, without actually transmitting/traveling the space between the source and destination. That seems to pretty much agree with the definition of teleportation at places like wikitionary.

      Quantum teleportation is quite distinct from something like say a fax machine, where you measure something at your source, describe it to the destination, and build it from scratch there. That is in fact impossible to do, because it is impossible to completely measure the particular state of many quantum systems, as your measurement would not tell you there is a superposition, only one of the eigenstates that compose that superposition. So you can't just measure a specific quantum state and tell someone by classical means how to make it elsewhere. Quantum teleportation on the other hand does allow you to get superpositions from source to destination because you never actually measure the state itself. you do measure the aftermath of an operation on the source's half of an entangled pair, which is what has to be sent by the classical channel.

      The information you send via classical means is a fraction of what is actually sent via the teleportation process as a whole though, hence something is sent from source to destination without traveling the distance itself.

      Besides, if violating causality is impossibly, why reserve and lock away a word to only be used to describe an impossible process, when a slightly broader use is actually applicable to something that exists?

    6. Re:Quantum cumputer explanation fail by sexconker · · Score: 1

      Teleportation is instantaneous spatial transference.
      Anything else (such as encoding, destroying and rebuilding) is not teleportation.
      Teleportation is impossible without violating causality. And that's why it's important to keep the definition clear, just as Tachyons are not merely "really fast particles".

    7. Re:Quantum cumputer explanation fail by sexconker · · Score: 1

      Besides, if violating causality is impossibly, why reserve and lock away a word to only be used to describe an impossible process, when a slightly broader use is actually applicable to something that exists?

      Precisely because there's a hard, definitive line between what's possible and what isn't (as far as we know).
      It's the same reason Tachyons have a name that isn't bastardized and used for other random fast particles.

    8. Re:Quantum cumputer explanation fail by Anonymous Coward · · Score: 0

      Anything else (such as encoding, destroying and rebuilding) is not teleportation.

      Encoding and rebuilding an unknown quantum state is impossible. E.g. the uncertainty principle prevents you from measuring the state you want to send. Quantum teleportation gets around that by using the instantaneous, connected behavior of entangled particles to make the desired state jump to the destination instantaneously along with a random scrambling. If you got luck and guess which particular scrambling happened, you could have the transmitted state there instantly, otherwise you have to wait for a classical communication from the source to tell you which transformation will unscramble it, hence preserving causality because you won't get any certain information without nonFTL effects.

  17. Re:Just like my penis by Anonymous Coward · · Score: 0

    But it is also, though less likely, in your own butt simultaneously.

  18. Re:Just like my penis by Anonymous Coward · · Score: 0

    Also Michelle Obama's. Because Moo-shelle is a TRANNY!

  19. Re:Quantum Synergy by Anonymous Coward · · Score: 1

    How did this get modded up? Quantum computers are not supposed to give results instantly. Even general purpose quantum computer algorithms are expected to not return the best optimization every time, which is why they are proposed as good for problems that are easy to verify but hard to search. E.g. Shor's algorithm for factorization includes the possibility of re-running the algorithm when verification of the result on classical computer fails.

  20. Excited! by dreamygeek · · Score: 1

    Now that's something to be really excited about!

  21. The Chinese Factor by Anonymous Coward · · Score: 0

    >... a) They don't get a result instantaneously
    >... b) they don't always get the best result of an optimization
    >... c) they're brute force solution finders
    > .......that makes them an analogue computer with MBA spin

    You are forgetting the most important factor - The Chinese Factor

    Any research with involvement of any Chinese individual is going to be FAKE and Mr. Zhexuan Gong is a stinking Chinese !

  22. Not only size matters, but also resilience by Anonymous Coward · · Score: 1

    According to John Martinis' (from Google) invited talk to this year's Crypto 2017, building a quantum computer with as many qubits as possible might be good for getting into the headlines, but for being otherwise useful, the qubits' error rate and how long they stay stable is as important. For current sizes 1% error rate might be OK, but as quantum computer become bigger they have to drop below 0.1% for being able to use error correction.

    Thanks to error correction there is an important distinction to make between physical (before error correction) and logical (after error correction) qubits. They guys and gals building quantum computer offer physical qubits, but the theorists use logical qubits. If you can factor with few thousand logical qubits, you need a quantum computer with 100,000s to 100 millions physical qubits (how many depend on the error rate).

  23. Comment removed by account_deleted · · Score: 1

    Comment removed based on user account deletion

  24. Technobabble by skovnymfe · · Score: 4, Insightful

    Quantum simulators are a special type of quantum computer that uses qubits to simulate complex interactions between particles. Qubits are the informational medium of quantum computers, analogous to a bit in an ordinary computer. Yet rather than existing as a 1 or 0, as is the case in a conventional bit, a qubit can exist in some superposition of both of these states at the same time.

    I love how quantum people love writing stuff like this, because if you don't already know exactly what it means, it won't do diddly dick to help you clarify what a quantum computer is anyway.

    1. Re:Technobabble by Anonymous Coward · · Score: 0

      I am not sure who you mean by "quantum people." Some researchers I know have gone to great lengths to try to explain how quantum computers work in a way that does not need math, but the result is longer than most pop-science news blurbs. As much as pop-science writers will re-use analogies and definitions, like the one you quoted, they tend to not re-use very long explanations. Usually the far worse situation is recycling of short analogies, and analogies for quantum mechanics are almost all really bad.

      At some point you have to decide whether to treat the reader as an adult who can go look up things elsewhere they don't know about or risk rewriting an explanation badly when many such well written explanations already exist. The lowest common denominator approach is to just copy-paste a definition like this, which is technically true.

      Without going down a rabbit hole, about the only thing you can further say is that a system of qubits is more than the simple sum of its parts: you can have superposition of different patterns of bits that encode a relationship between those patterns and allow you to manipulate multiple patterns at the same time. It makes a quantum computer a lot more useful than a collection of individual combinations of 1s & 0s, e.g. a quantum algorithm is one that makes the answer pattern more likely that non-answer patterns.

      Unfortunately, it takes a lot of words to say anything more without math. (On the other hand, basic algebra can let you explain things very concisely...but I've taught enough classes that had students refusing to use algebra whenever possible, even when they knew algebra quite well)

  25. this is how the satellites/military radar by strstr · · Score: 0

    do mind control and environmental tampering - giving them access to our brains, memories, thoughts, etc.

    they've had these quantum computers for ages going back to the 1920s-1950s. it was just kept secret and entirely off the record. It was covered up as a big game of psychic warfare, parapsychology, etc whenever it was used on the world around us.

    https://www.trumpsweapon.com/

  26. Qubits, alignment, charge, bla bla bla by coofercat · · Score: 1

    All I really want to know is when can they laser-cool my beer?

    1. Re:Qubits, alignment, charge, bla bla bla by Miles_O'Toole · · Score: 1

      The answer to your question is, "Not soon enough!

      --
      Only two things are infinite, the universe and human stupidity, and I'm not sure about the former.
  27. damn straight by Anonymous Coward · · Score: 0

    East Coast representing! Git rekt silicon valley! WOOT

  28. Re:53 bits - why? by xanadu113 · · Score: 1

    According to this, 53 qubits can simulate 1 gram of DNA: https://www.quora.com/Quantum-...

    --
    -Myke
  29. American units by Hal_Porter · · Score: 1
    --
    echo -e 'global _start\n _start:\n mov eax, 2\n int 80h\n jmp _start' > a.asm; nasm a.asm -f elf; ld a.o -o a;