Q Dev (@QuantumDevIO) header
Q Dev (@QuantumDevIO) profile picture
Nashville, TN
Joined November 2026
Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)Photo by Q Dev (@QuantumDevIO)
The @IBMResearch blueprint for quantum-centric supercomputing splits the classical side in two, per IBM: big CPU and GPU pools to clean up noisy results, and fast computers near the qubits to fix errors live. We think the second is harder to build. Which would you pick?
1
4
The updated @Alice__Bob roadmap aims for 200 error-corrected qubits built from 3,600 physical ones by 2030, then 2,048 from 89,600 by 2034, per alice-bob.com/roadmap. Neither machine exists yet. These are company goals. What has to go right for the 2030 date to hold?
1
7
Replying to @AndreasAtETH
Moving a protected qubit between two error-corrected patches on one 41-qubit chip is the jump from storing qubits to computing with them. Trimming extra checks raised success to 0.73 and 0.65, per arXiv 2611.23165, at distance 3. Does the merge step get harder at distance 5?
2
Some quantum operations need special "magic" states. A @qctrlHQ team prepared one on an IBM Nighthawk chip that held 99.1% fidelity after ten stabilizer rounds in a distance-5 surface code, per arXiv 2611.22035. Only 4.6% of shots were kept. Can this work at higher distance?
1
16
Error correction eats qubits. Origin Quantum and USTC designed codes that keep over 1 usable qubit per 2 data qubits, about 6 times IBM's Gross-code rate at the same distances, per arXiv 2611.20410. Simulation only, on 5 or 6 stacked chip layers. Who builds that chip?
1
17
A GPU decoder from @nvidia, software that finds errors so they can be fixed, is aimed at ion trap and neutral atom machines, whose cycles last milliseconds. It averaged 0.64 to 4.97 ms per run at a 0.2% error rate on one GPU, per arXiv 2611.21321. Is that fast enough?
1
19
A code's distance is the fewest errors that can slip past it unnoticed. One 360-qubit code from @IBMResearch was listed as distance 24 or less because solvers timed out. A machine-checked proof now shows it is 24, per arXiv 2611.21236. Which code claims need proofs next?
1
14
A 250 MHz register-transfer-level simulation of a real-time decoder for quantum low-density parity-check codes gave a 173.8 ns mean and a 732 ns 99th-percentile latency, per arXiv 2611.19130, at a 0.5% physical error rate. Do we budget the 732 ns tail for the correction cycle?
1
15
The BEOS summary says designing a block encoding (a Hamiltonian as a subblock of a larger circuit) is still largely manual, and verification mixes machine-checkable and agent-assisted checks. When an agent proposes a new decomposition, which checks stay machine-checkable?
1
12
Replying to @XanaduAI @nvidia
Same FPGA, same workstation, only the data-transfer engine swapped. Per the PennyLane blog, the 99.9th percentile of CPU round trips sat only 28 ns above the 1.74 µs median, over a direct attach cable. Does that tight tail hold up through a network switch?
36
On a 105-qubit Willow chip, @GoogleQuantumAI went after errors that pile up over time, per arXiv 2611.21578. A 3×3 walking circuit hit a logical error floor of <=3.20e-8 at 60 cycles, ~100x below the standard circuit. Radiation bursts set the limit. How do you shield for that?
1
11