Physicists find way to detect entanglement without disrupting it

When it FEELS like magic, but the math checks out... Davidson Quantum Engineer Randall Gay, Ph.D. is still in awe of the possibilities unfolding before him. In just a few short weeks, the D-Wave Advantage2 quantum computer, installed right here at Davidson HQ in Huntsville, will complete calibration and come fully online. It’s the first of its kind in the Southeast, and one of only two on-premises systems in the U.S. Stay tuned for more as we approach this milestone! 

New from #OPG_OpticaQ, Chip-based phonon splitter brings hybrid quantum networks closer to reality: https://bit.ly/3KFOZUB This coupler acts like a junction in a quantum ‘postal route to split, route or recombine single quantum vibrations so that an excitation created in one processor can be sent reliably to another processor on the same chip or to multiple recipients. The device could enable microscopic on-chip routers and splitters that link different types of quantum technologies. Delft University of Technology #Quantum #QuantumNetworks #ScienceAndTechnology

🤝 QuTech has joined forces with Fujitsu to create a blueprint for a scalable quantum computer. 💡 Our collaborative approach is comprehensive, encompassing everything from the development of physical components to the error-correction algorithms necessary to operate the computer. 🔎 At the heart of our research into scaling are high-quality qubits with extended coherence times and the creation of optical connections between qubit modules. 🎉 The collaboration has already achieved significant scientific success. For instance, we've demonstrated the fault-tolerant operation of a logical qubit. Find out more about our collaborative research on qutech.nl/fujitsu

💎 NV Center qubits, based on nitrogen atoms within a diamond lattice, are a QuTech specialty. 🔎 In Delft, QuTech and Fujitsu are working together to realise a complete blueprint for a scalable quantum computer based on these spin qubits in diamond, while creating optical interconnects between small qubit modules. Watch the video to learn more👇

"Quantum entanglement can’t beat the speed-of-light limit, but it can still make some wild things work. This includes quantum-enhanced sensors to improve applications in medicine and environmental monitoring, and in precision measurements such as the gravitational wave detector LIGO in the United States."

The German (or at least the Berlin) Quantum community will remember October 9 at 2.15 p.m of the Photonics Days 2025. At this point in time, the squeezed community (Prof. Roman Schnabel from Hamburg University, Dr. Axel Schönbeck from Noisy Labs and Luis Gonzales from Fraunhofer IOF) did outline in a 45 min staccato the potential advantages of squeezed states over photon counting like QKD for large distances using normal telecom infrastructure and fault tolerant quantum computing. However, still some way to go and all starts with metrology. And: At the moment excellent pin-diodes are used, but they need to become perfect which is the basic challenge at the moment.

A time crystal, a long-life quantum system approaching perpetual motion, has been hooked up to its environment for the first time, unlocking an intriguing way to increase quantum computational and sensing power. https://lnkd.in/gfnH8xWD

think about this next time you bet big on moving to Quantum Proof cryptography I wonder if this reflects the state across all factions in research or if some covert project where bespoke hardware is purposefully made would make a dent or maybe even break weaker keys we now think unbreakable. I've come to think we shouldn't trust too much in what is now considered Quantum Proof until actual hardware is built running at intended production level reliability and performance. #tech #crypto

Indeed, we need more #quantumalgorithms, we need more quantum algorithms that have the potential to show practical utility and we need to achieve a better understanding - say, on end-to-end complexity or the range of applicability - of those already known.

Beyond Shor's Algorithm: Why His Own Field Has Passed Him By Professor Shor, Your contribution to the field remains the paradigmatic demonstration of what a quantum computer could achieve. But precisely because of the weight your voice carries, I feel compelled to correct several points in your framing. You presented “quantum supremacy” as if it were reducible to the act of factoring large integers on a fault-tolerant machine, and further suggested that this goal remains “several decades away.” With due respect, this is a mischaracterization. Supremacy is not, and has never been, synonymous with cryptographic collapse. It is a complexity-theoretic notion: the existence of any problem in BQP demonstrably intractable for classical machines. By that definition, supremacy demonstrations already exist—random circuit sampling (Google’s Sycamore), boson sampling (Xanadu’s Borealis), Gaussian boson sampling with threshold detectors. These are not speculative curiosities; they are experimentally verified instantiations of separations between quantum and classical resources, unless one chooses to redefine supremacy post hoc as “breaking RSA or nothing.” Your suggestion that improved classical algorithms may refute these demonstrations is a valid caveat but ultimately bounded. Complexity theory (Aaronson–Arkhipov; Bremner–Montanaro–Shepherd) shows that efficient classical simulation of such distributions would collapse the polynomial hierarchy—an outcome more radical than accepting the reality of quantum advantage. Temporary algorithmic workarounds (tensor networks, Clifford+T stabilizer simulators) narrow but do not erase the separation. Moreover, the prediction that factoring is “decades away” rests on a linear extrapolation of today’s error rates. This ignores the non-linear trajectory of progress: bosonic encodings (GKP states), LDPC codes with constant overhead, modular ion-trap arrays, and photonic cluster states. Logical qubits with demonstrated break-even error suppression already exist. To dismiss these as incremental curiosities is to repeat, in 1946, the claim that stored-program digital machines were “obviously” incapable of scaling. What matters here is conceptual clarity. Supremacy is not utility. Factoring will indeed be the cryptographically dramatic instantiation, but it is not the definitional gatekeeper. To equate supremacy with factoring is to erase the very progress that your own algorithm inspired. Supremacy has already been achieved in restricted but complexity-theoretically rigorous models. To suggest otherwise risks turning a scientific milestone into a rhetorical mirage. Few individuals have shaped quantum computation as deeply as you have. For that reason, when you speak, the community listens—and sometimes uncritically. With admiration for your foundational work, but with equal commitment to correcting what must not remain unchallenged, Marcos Eduardo Elias Founder, Holosystems Quantum Algorithms / EquiVerse AI