JUST IN: DAINES, KIM RESOLUTION CELEBRATING 100 YEARS OF QUANTUM MECHANICS PASSES U.S. SENATE
https://www.daines.senate.gov/2025/07/11/daines-kim-resolution-celebrating-100-years-of-quantum-mechanics-passes-u-s-senate/
https://www.daines.senate.gov/2025/07/11/daines-kim-resolution-celebrating-100-years-of-quantum-mechanics-passes-u-s-senate/
Senator Steve Daines
Daines, Kim Resolution Celebrating 100 Years of Quantum Mechanics Passes U.S. Senate - Senator Steve Daines
U.S. SENATE – U.S. Senators Steve Daines (R-MT) and Andy Kim (D-N.J.) announced their bipartisan resolution commemorating the 100th anniversary of the development of quantum mechanics passed the U.S. Senate. The resolution recognizes America’s global leadership…
Quantum computers just got a lot closer to becoming reliable. ⚛️
Researchers at Chalmers University of Technology in Sweden have developed a new method that could make certain quantum operations more than 1,000× faster.
Here’s the problem:
Quantum information is incredibly fragile.
The longer a quantum operation takes, the more time there is for noise and other disturbances to corrupt the quantum state.
And when researchers use bosonic quantum error-correcting codes, preparing and controlling those states has traditionally required thousands of repeated control cycles.
The new approach changes that.
Instead of building the desired quantum state step by step, the researchers use quantum lattice gates + Floquet control to perform the operation within a single driving cycle.
That could dramatically reduce the time quantum information is exposed to errors.
The team demonstrated the approach theoretically for several bosonic codes, including cat, binomial and GKP states, with high-fidelity logical operations in their calculations.
But there’s an important distinction:
This isn't a physical quantum computer running 1,000× faster yet.
The result is currently a theoretical method that still needs experimental validation.
If it works in hardware, though, it could remove a major bottleneck on the road toward fault-tolerant quantum computing.
And that may be the bigger story:
The future of quantum computing is about making those qubits reliable enough to actually compute.
Would you rather see quantum computers get 1,000× faster or 1,000× more reliable? 👇
Follow for more quantum computing, AI & emerging technology explained without the hype.
Researchers at Chalmers University of Technology in Sweden have developed a new method that could make certain quantum operations more than 1,000× faster.
Here’s the problem:
Quantum information is incredibly fragile.
The longer a quantum operation takes, the more time there is for noise and other disturbances to corrupt the quantum state.
And when researchers use bosonic quantum error-correcting codes, preparing and controlling those states has traditionally required thousands of repeated control cycles.
The new approach changes that.
Instead of building the desired quantum state step by step, the researchers use quantum lattice gates + Floquet control to perform the operation within a single driving cycle.
That could dramatically reduce the time quantum information is exposed to errors.
The team demonstrated the approach theoretically for several bosonic codes, including cat, binomial and GKP states, with high-fidelity logical operations in their calculations.
But there’s an important distinction:
This isn't a physical quantum computer running 1,000× faster yet.
The result is currently a theoretical method that still needs experimental validation.
If it works in hardware, though, it could remove a major bottleneck on the road toward fault-tolerant quantum computing.
And that may be the bigger story:
The future of quantum computing is about making those qubits reliable enough to actually compute.
Would you rather see quantum computers get 1,000× faster or 1,000× more reliable? 👇
Follow for more quantum computing, AI & emerging technology explained without the hype.