If you’re designing a new computer, you want it to solve problems as fast as possible. Just how fast is possible is an open question when it comes to quantum computers, but JQI physicists have narrowed the theoretical limits for where that “speed limit” is. The work implies that quantum processors will work more slowly than some research has suggested.
The work offers a better description of how quickly information can travel within a system built of quantum particles such as a group of individual atoms. Engineers will need to know this to build quantum computers, which will have vastly different designs and be able to solve certain problems much more easily than the computers of today. While the new finding does not give an exact speed for how fast information will be able to travel in these as-yet-unbuilt computers—a longstanding question—it does place a far tighter constraint on where this speed limit could be.
Quantum computers will store data in a particle’s quantum states—one of which is its spin, the property that confers magnetism. A quantum processor could suspend many particles in space in close proximity, and computing would involve moving data from particle to particle. Just as one magnet affects another, the spin of one particle influences its neighbor’s, making quantum data transfer possible, but a big question is just how fast this influence can work.
The team’s findings advance a line of research that stretches back to the 1970s, when scientists discovered a limit on how quickly information could travel if a suspended particle only could communicate directly with its next-door neighbors. Since then, technology advanced to the point where scientists could investigate whether a particle might directly influence others that are more distant, a potential advantage. By 2005, theoretical studies incorporating this idea had increased the speed limit dramatically.
“Those results implied a quantum computer might be able to operate really fast, much faster than anyone had thought possible,” says postdoctoral researcher and lead author Michael Foss-Feig. “But over the next decade, no one saw any evidence that the information could actually travel that quickly.”
Physicists exploring this aspect of the quantum world often line up several particles and watch how fast changing the spin of the first particle affects the one farthest down the line—a bit like standing up a row of dominoes and knocking the first one down to see how fast the chain reaction takes. The team looked at years of others’ research and, because the dominoes never seemed to fall as fast as the 2005 prediction suggested, they developed a new mathematical proof that reveals a much tighter limit on how fast quantum information can propagate.
“The tighter a constraint we have, the better, because it means we’ll have more realistic expectations of what quantum computers can do,” says Foss-Feig.
The limit, their proof indicates, is far closer to the speed limits suggested by the 1970s result. The proof addresses the rate at which entanglement propagates across quantum systems. Entanglement—the weird linkage of quantum information between two distant particles—is important, because the more quickly particles grow entangled with one another, the faster they can share data. The 2005 results indicated that even if the interaction strength decays quickly with distance, as a system grows, the time needed for entanglement to propagate through it grows only logarithmically with its size, implying that a system could get entangled very quickly. The team’s work, however, shows that propagation time grows as a power of its size, meaning that while quantum computers may be able to solve problems that ordinary computers find devilishly complex, their processors will not be speed demons.
“On the other hand, the findings tell us something important about how entanglement works,” says Foss-Feig. “They could help us understand how to model quantum systems more efficiently.”
This was originally written by C. Boutin for NIST TechBeat, with modifications for JQI made by E. Edwards.