See every side of every news story
Published loading...Updated

Good news for once! A faster Quantum Fourier Transform

Summary by Shtetl-Optimized
Update: In the comments, Craig Gidney points out that Ronit’s O(n log2 n) quantum circuits for the exact QFT were already published by Cleve and Watrous in 2000 (in a paper whose main point was something else, parallelization). Ronit’s O(n (log log n)2) circuits for the approximate QFT still appear to be new (Gidney says he and others knew related techniques but had never explicitly combined them). Of course, while the exact result was Platonica…
DisclaimerThis story is only covered by news sources that have yet to be evaluated by the independent media monitoring agencies we use to assess the quality and reliability of news outlets on our platform. Learn more here.

Bias Distribution

  • There is no tracked Bias information for the sources covering this story.
Factuality

To view factuality data please Upgrade to Premium

Ownership

To view ownership data please Upgrade to Vantage

Shtetl-Optimized broke the news in on Thursday, January 23, 2025.
Sources are mostly out of (0)

You have read out of your 5 free daily articles.

Join us as a member to unlock exclusive access to diverse content.