Boffin Claims Microsoft's 'Quantum Leap' Is Invalid Due To 'Basic Python Errors'
5 74A peer-reviewed Nature critique argues that Microsoft's 2025 Majorana quantum-computing breakthrough -- and its claim that it could enable "a truly meaningful quantum computer not in decades, as some have predicted, but in years" -- is fundamentally flawed. According to Dr Henry Legg, a lecturer at the University of St Andrews, the claims were undermined by omitted data, selective plotting, and basic Python errors that concealed alternative results. Microsoft, for its part, says the bugs were minor and stands by its findings and roadmap. The Register reports: "Last year they claimed to be years, not decades from a 'topological quantum supercomputer,'" Legg told The Register in an email. "My feeling is that they are centuries, not decades away. If it works at all -- and, based on what I have seen, the most likely scenario is that it doesn't work." Based on his analysis of the research Microsoft published in 2025, Legg argues that the company's claims about finding and being able to control the elusive Majorana particle to build a topological superconductor do not withstand scrutiny.
"I demonstrate that Microsoft's tune-up software is flawed and that coding errors resulted in incorrect statements to peer reviewers," said Legg. "Raw data, which was omitted from the original paper, also appears to indicate Microsoft's devices contain considerable disorder and are not compatible with the existence of a topological gap. In other words, the prerequisites for Microsoft's claims do not appear to be met, but this was obscured because this data did not appear in the original publication."
Essentially, Microsoft has proposed a Topological Gap Protocol (TGP) that can be used to detect the phase transition deemed to be a prerequisite for conducting quantum calculations using Majorana particles. Legg argues that based on his analysis of underlying transport data (measurements of particle change) -- omitted from the original publication -- Microsoft chose to focus on results that supported its thesis and ignored data that could be interpreted as a negative result. As he notes in his critique: "The TGP plotting code was set to highlight only the largest purportedly topological region."
"The primary consequence was the omission of other regions that passed their tune-up protocol (the TGP)," said Legg. "When peer reviewers asked if other regions existed, Microsoft inaccurately stated that they had investigated the only region passing the protocol within the explored range. This was not correct." Legg also argues that Microsoft mishandled its code. "The code antisymmetrized bias voltage based on array index rather than physical value," his analysis says.
In other words, Microsoft's researchers made a basic programming mistake by evaluating the array index -- the number identifying a value's position in an array -- instead of the value to which the index refers. "There were two pretty basic Python programming errors that hid these alternative regions," Legg explained. "Their plotting software was hardcoded with a filter (zbp_cluster_numbers=[1]) that forced it to display only the single largest region, concealing other successful results from their phase maps. Changing this to zbp_cluster_numbers=[1,2] shows already a second region." Legg added: "The TGP software transformed the data by simply reversing a Python array (x[::-1]) based on its index position, ignoring the actual physical bias voltages."
5 comments
Quantum Leap is invalid? (Score: 5, Funny)
by 93 Escort Wagon ( 326346 ) on Wednesday June 24, 2026 @01:11PM (#66208036)
Quick! Somebody call Scott Bakula!
"the most likely scenario is that it doesn't work" (Score: 5, Informative)
by gweihir ( 88907 ) on Wednesday June 24, 2026 @01:19PM (#66208056)
At this time, this is the only rational stance left. There is no indication that QCs can ever scale to useful size, but a ton of indicators that they likely will not. There is not even solid proof that QCs work at all, because the longest, most complex complex calculation ever done successfully is apparently factoring 29 with a specialized algorithm for 29. That is easily in range for a conventional analog computation by non-quantum mechanisms. Hence while I think it is unlikely, the computation mechanisms that QCs rely on may still turn out to be hallucinations. Also note that even very, very, very minor deviations from the theory (and we _always_ had those in the past as soon as we had equipment to verify theory against reality precisely enough) would completely kill the QC idea. The precision required to do, say, a 128 bit calculation precisely, is unimaginable and a digital computer only reaches it by extreme measures.
Re:"the most likely scenario is that it doesn't wo (Score: 5, Informative)
by Entrope ( 68843 ) on Wednesday June 24, 2026 @01:38PM (#66208124)
the longest, most complex complex calculation ever done successfully is apparently factoring 29 with a specialized algorithm for 29.
Shor's algorithm has been used to factor 21, not 29. 29 is prime, and people don't usually talk about factoring primes because the factors are trivial. But otherwise, yes.
Boffin (Score: 5, Insightful)
by Himmy32 ( 650060 ) on Wednesday June 24, 2026 @01:33PM (#66208108)
A quick perusal of his published papers [google.com] seems that boffin would even be understatement, but a well published researcher who is wholly dedicated to this field of research. And whose papers are appear to be written with well respected researchers in the field like this one [google.com] and several others written with Daniel Loss [wikipedia.org].
From the Daniel Loss article:
His 1998 paper (jointly with David DiVincenzo) proposing the use of spin qubits in semiconductor quantum dots is the foundation of one of the main approaches towards the realization of a quantum computer and (as of 2025) has been cited more than 9000 times.
This doesn't appear to be a critique that should be easily dismissed, guy clearly knows his stuff.
Re:Python ? (Score: 5, Informative)
by HiThere ( 15173 ) on <charleshixsn&earthlink,net> on Wednesday June 24, 2026 @02:17PM (#66208208)
What you don't understand is the Python is often used as a method of invoking libraries that are written in more efficient languages. And for the layer that it handles it doesn't introduce unacceptable inefficiencies. E.g., you wouldn't want to do ray tracing in Python, but it's fine for calling a library that does that.