home.social

#quantumcomputing — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #quantumcomputing, aggregated by home.social.

fetched live
  1. TechAptitude brings you the weekly "Weekend Reading".

    NIST is playing a central role in building standards for Quantum Computing and in this post we review the current status of NIST's efforts and their recent release of the first 3 standards. Enjoy, and please tell your friends to check this post out, and visit TechAptitude here: techaptitude.substack.com/

    techaptitude.substack.com/p/qu #NIST #Quantum #QuantumComputing #Standards #FIPS203 #FIPS204 #FIPS205 #PQC

  2. TechAptitude brings you the weekly "Weekend Reading".

    NIST is playing a central role in building standards for Quantum Computing and in this post we review the current status of NIST's efforts and their recent release of the first 3 standards. Enjoy, and please tell your friends to check this post out, and visit TechAptitude here: techaptitude.substack.com/

    techaptitude.substack.com/p/qu

  3. Finally, an autonomous, self-energetic, self-regenerative, autopoietic, and independent #AIplatform that doesn't bore. That gives to be, and that isn't just a browser with an internal typewriter. Enjoy the living hub! neurosapiens-tcsai.com/ #AI #ArtificialIntelligence #TCSAI #IA #quantumcomputing

  4. Finally, an autonomous, self-energetic, self-regenerative, autopoietic, and independent #AIplatform that doesn't bore. That gives to be, and that isn't just a browser with an internal typewriter. Enjoy the living hub! neurosapiens-tcsai.com/ #AI #ArtificialIntelligence #TCSAI #IA #quantumcomputing

  5. Are there any experts here who can discuss the recent claim by IBM, that IBM's Quantum Computer has done work that is difficult for a classical computer ?

    news.uchicago.edu/story/ibm-uc

    #Computer #Tech #Quantumcomputing #IBM

  6. Are there any experts here who can discuss the recent claim by IBM, that IBM's Quantum Computer has done work that is difficult for a classical computer ?

    news.uchicago.edu/story/ibm-uc

    #Computer #Tech #Quantumcomputing #IBM

  7. Curiosity Sphere @curiositysphereblog.wordpress.com@curiositysphereblog.wordpress.com ·

    Quantum Computers Explained: Will They Replace Normal Computers?

    Discover what quantum computers are, how they work, and whether they could replace today's computers. Learn the future of computing in simple terms.

    curiositysphereblog.wordpress.

  8. Curiosity Sphere @curiositysphereblog.wordpress.com@curiositysphereblog.wordpress.com ·

    Quantum Computers Explained: Will They Replace Normal Computers?

    Discover what quantum computers are, how they work, and whether they could replace today's computers. Learn the future of computing in simple terms.

    curiositysphereblog.wordpress.

  9. New episode! 🎙️ Steve Clayton, Cisco's SVP & CCO, joins us to explore why attention—not creativity—is the scarce resource in the AI age. We discuss why narrative belongs at the top, the network as AI's backbone, and Cisco's quantum computing advances.

    "AI simply doesn't happen without the network."

    Listen on Spotify: open.spotify.com/episode/7iJsv

    #AnalysePodcast #TechPodcast #AIRevolution #QuantumComputing

  10. I have finished the demo of Phase 1 of SpudQ, a Quantum Tooling Suite I am working on! It is lightweight, offline, and local using Python and PyQt6.

    The modules:
    * Phase 1 (Demo): "Qreator" GUI with OpenQASM 3.0 parsing.
    * Phase 2: Transpiler.
    * Phase 3: Benchmarker.

    It's a Linux tool for now. Please take a look and leave some feedback if you're interested!

    Repo link: codeberg.org/SpudWorks/SpudQ
    Release Link: codeberg.org/SpudWorks/SpudQ/r

    #QuantumComputing #Python #PyQt6 #Linux #OpenSource

  11. I have finished the demo of Phase 1 of SpudQ, a Quantum Tooling Suite I am working on! It is lightweight, offline, and local using Python and PyQt6.

    The modules:
    * Phase 1 (Demo): "Qreator" GUI with OpenQASM 3.0 parsing.
    * Phase 2: Transpiler.
    * Phase 3: Benchmarker.

    It's a Linux tool for now. Please take a look and leave some feedback if you're interested!

    Repo link: codeberg.org/SpudWorks/SpudQ
    Release Link: codeberg.org/SpudWorks/SpudQ/r

    #QuantumComputing #Python #PyQt6 #Linux #OpenSource

  12. Weekend Reading care of TechAptitude!

    Like the global “race” for AI leadership, Quantum Technologies have enormous geo-political dimensions that span multiple domains including national security, technological sovereignty, economic advantage/disadvantage, and military power.

    In this TechAptitude post we dive into this Geo-Political implications of Quantum Technologies. Enjoy! techaptitude.substack.com/p/qu #Quantum #QuantumComputing #Geo-Politics #TechAmplitude #QuantumTechnologies

  13. Weekend Reading care of TechAptitude!

    Like the global “race” for AI leadership, Quantum Technologies have enormous geo-political dimensions that span multiple domains including national security, technological sovereignty, economic advantage/disadvantage, and military power.

    In this TechAptitude post we dive into this Geo-Political implications of Quantum Technologies. Enjoy! techaptitude.substack.com/p/qu -Politics

  14. Ah yes, because nothing screams "cutting-edge technology" like a theme park ride for sand and silicon 🎢🧙‍♂️. Watch as your brain cells take a thrilling nosedive trying to follow this circuitous route of "innovation" 🤯🚂. Maybe next time they'll use Candy Crush to explain quantum computing 🍭🤡.
    laurentiugabriel.github.io/Chi #cuttingedgeinnovation #themeparkrides #techhumor #quantumcomputing #siliconvalley #HackerNews #ngated

  15. Ah yes, because nothing screams "cutting-edge technology" like a theme park ride for sand and silicon 🎢🧙‍♂️. Watch as your brain cells take a thrilling nosedive trying to follow this circuitous route of "innovation" 🤯🚂. Maybe next time they'll use Candy Crush to explain quantum computing 🍭🤡.
    laurentiugabriel.github.io/Chi #cuttingedgeinnovation #themeparkrides #techhumor #quantumcomputing #siliconvalley #HackerNews #ngated

  16. Continuum Trilogy: Ontological Closure (OC) — physically real = Turing-approximable with computable convergence modulus. Phase 4 now complete: 9 practical application domains + 4-tier counterfactual backcasting.
    DOI: 10.5281/zenodo.21672990
    Paper: papers.qnfo.org/papers/continu
    #QNFO #Research #pAdic #OntologicalClosure #QuantumComputing

  17. Gravity is not a force – it's an error-correcting code?

    Recent work shows that in the AdS/CFT holographic duality, spacetime behaves as a quantum error-correcting code (QECC). The distance (d) of this code – i.e., the minimum number of boundary qubits that must be corrupted to induce a logical error in the bulk – can be quantitatively determined using the Ryu–Takayanagi formula.

    Preprint: doi.org/10.5281/zenodo.21772338

    #quantumphysics #quantumcomputing #gravity

  18. Gravity is not a force – it's an error-correcting code?

    Recent work shows that in the AdS/CFT holographic duality, spacetime behaves as a quantum error-correcting code (QECC). The distance (d) of this code – i.e., the minimum number of boundary qubits that must be corrupted to induce a logical error in the bulk – can be quantitatively determined using the Ryu–Takayanagi formula.

    Preprint: doi.org/10.5281/zenodo.21772338

    #quantumphysics #quantumcomputing #gravity

  19. Gravity is not a force – it's an error-correcting code?

    Recent work shows that in the AdS/CFT holographic duality, spacetime behaves as a quantum error-correcting code (QECC). The distance (d) of this code – i.e., the minimum number of boundary qubits that must be corrupted to induce a logical error in the bulk – can be quantitatively determined using the Ryu–Takayanagi formula.

    Preprint: doi.org/10.5281/zenodo.21772338

    #quantumphysics #quantumcomputing #gravity

  20. Gravity is not a force – it's an error-correcting code?

    Recent work shows that in the AdS/CFT holographic duality, spacetime behaves as a quantum error-correcting code (QECC). The distance (d) of this code – i.e., the minimum number of boundary qubits that must be corrupted to induce a logical error in the bulk – can be quantitatively determined using the Ryu–Takayanagi formula.

    Preprint: doi.org/10.5281/zenodo.21772338

    #quantumphysics #quantumcomputing #gravity

  21. A Harvard-Quantinuum-Stony Brook-UChicago collaboration published what the paper describes as the first experimental demonstration of a universal topological gate set built from braiding and fusing non-Abelian anyons, in Nature (vol. 655, pp. 591-597, July 15).

    The experiment: 54 physical qubits encoding 18 six-level qudits (each qudit is a qutrit-qubit pair, three physical qubits per site) on the H2-1 trapped-ion processor. The team prepared the ground state of the quantum double of S3 (the smallest non-Abelian group), encoded logical qutrits in the fusion space of spatially separated anyons, and demonstrated three primitives: a pull-through entangling gate via coherent braiding, and logical X- and Z-basis measurements via fusion and topological-charge readout. Braiding alone is provably not universal for these simple anyons; treating fusion as a computational primitive completes the gate set, an idea from Mochon's 2004 paper. The current demonstrations use linear-depth circuits, but the paper notes all three primitives can be scalably implemented with constant-depth adaptive circuits.

    Universality was illustrated by topologically preparing a magic state, the non-Clifford resource that most fault-tolerant architectures plan to build through distillation factories. The cyclic-fusion evidence from trapping a single non-Abelian anyon on the torus provides a separate diagnostic of the S3 encoding's computational power.

    The caveats are in the paper's own language: stabilizing the topological phase requires active error correction, "which is beyond the scope of the present work," though a finite decoding threshold for quantum doubles with solvable groups has recently been proven. No distance-scaling result shows that a larger lattice improves logical performance. Ground-state preparation discards about 24% of shots under heralding; the most selective calibration protocol (bureau of standards) accepted 11.5% against an ideal 12.5%, with about 6% after all heralding; the magic-state protocol's acceptance was 26.52%. The pull-through gate compiled to 845 native two-qubit gates at depth 307, about 5.9s per shot.

    For the CRQC picture: the magic-state result maps onto the magic-state capability in my framework at proof-of-principle level. It shows the anyonic primitives can create a non-Clifford resource but nothing yet about fault-tolerant production, injection, or logical fidelity at scale. The result widens the credible architecture set without shortening the calendar, and it raises the bar for Microsoft's materials-first Majorana approach, which pursues native topological protection in semiconductor-superconductor devices via parity measurements and measurement-based braiding.

    The deeper trade this paper forces: fusion-space computing may swap the magic-state-factory overhead for a more complex preparation, measurement, and decoding stack, and this paper makes that comparison an engineering question rather than a theoretical one. Twenty-two years from Mochon's recipe to hardware. Protection is next.

    Full analysis: postquantum.com/industry-news/

    #quantumcomputing #physics #faulttolerance #infosec #PQC #postquantum #topological

  22. A Harvard-Quantinuum-Stony Brook-UChicago collaboration published what the paper describes as the first experimental demonstration of a universal topological gate set built from braiding and fusing non-Abelian anyons, in Nature (vol. 655, pp. 591-597, July 15).

    The experiment: 54 physical qubits encoding 18 six-level qudits (each qudit is a qutrit-qubit pair, three physical qubits per site) on the H2-1 trapped-ion processor. The team prepared the ground state of the quantum double of S3 (the smallest non-Abelian group), encoded logical qutrits in the fusion space of spatially separated anyons, and demonstrated three primitives: a pull-through entangling gate via coherent braiding, and logical X- and Z-basis measurements via fusion and topological-charge readout. Braiding alone is provably not universal for these simple anyons; treating fusion as a computational primitive completes the gate set, an idea from Mochon's 2004 paper. The current demonstrations use linear-depth circuits, but the paper notes all three primitives can be scalably implemented with constant-depth adaptive circuits.

    Universality was illustrated by topologically preparing a magic state, the non-Clifford resource that most fault-tolerant architectures plan to build through distillation factories. The cyclic-fusion evidence from trapping a single non-Abelian anyon on the torus provides a separate diagnostic of the S3 encoding's computational power.

    The caveats are in the paper's own language: stabilizing the topological phase requires active error correction, "which is beyond the scope of the present work," though a finite decoding threshold for quantum doubles with solvable groups has recently been proven. No distance-scaling result shows that a larger lattice improves logical performance. Ground-state preparation discards about 24% of shots under heralding; the most selective calibration protocol (bureau of standards) accepted 11.5% against an ideal 12.5%, with about 6% after all heralding; the magic-state protocol's acceptance was 26.52%. The pull-through gate compiled to 845 native two-qubit gates at depth 307, about 5.9s per shot.

    For the CRQC picture: the magic-state result maps onto the magic-state capability in my framework at proof-of-principle level. It shows the anyonic primitives can create a non-Clifford resource but nothing yet about fault-tolerant production, injection, or logical fidelity at scale. The result widens the credible architecture set without shortening the calendar, and it raises the bar for Microsoft's materials-first Majorana approach, which pursues native topological protection in semiconductor-superconductor devices via parity measurements and measurement-based braiding.

    The deeper trade this paper forces: fusion-space computing may swap the magic-state-factory overhead for a more complex preparation, measurement, and decoding stack, and this paper makes that comparison an engineering question rather than a theoretical one. Twenty-two years from Mochon's recipe to hardware. Protection is next.

    Full analysis: postquantum.com/industry-news/

    #quantumcomputing #physics #faulttolerance #infosec #PQC #postquantum #topological

  23. `We demonstrate our proposal with a 70-qubit, depth-70 Clifford circuit doped with 468 T gates. We use a total of 97 physical qubits to encode this computation in spacetime codes, effectively suppressing gate error rates by 10× after syndrome post-selection, and yielding a state with a fidelity lower bound of 0.284 with 95% confidence.`

    arxiv.org/abs/2607.25941

    #quantumComputing #qubit

  24. `We demonstrate our proposal with a 70-qubit, depth-70 Clifford circuit doped with 468 T gates. We use a total of 97 physical qubits to encode this computation in spacetime codes, effectively suppressing gate error rates by 10× after syndrome post-selection, and yielding a state with a fidelity lower bound of 0.284 with 95% confidence.`

    arxiv.org/abs/2607.25941

    #quantumComputing #qubit

  25. 📰 'incransom' Claims Breach of Quantum Firm Quantinuum

    The 'incransom' ransomware group claims a breach of quantum computing firm Quantinuum, alleging the company hid the incident from pre-IPO investors. The claim is unconfirmed. #Ransomware #DataBreach #QuantumComputing

    🔗 cyber.netsecops.io/articles/in

  26. I updated arewequantumyet.taffer.ca to include a link to IBM's new Quantum Advantage Tracker page.

    Helpful 🤞 if you want to know whether to panic about classical private-key encryption being broken!

    #quantum #QuantumComputing #PQ #PostQuantum

  27. I updated arewequantumyet.taffer.ca to include a link to IBM's new Quantum Advantage Tracker page.

    Helpful 🤞 if you want to know whether to panic about classical private-key encryption being broken!

    #quantum #QuantumComputing #PQ #PostQuantum

  28. Somehow, while trying to revolutionize quantum computing, these geniuses "accidentally" whipped up an #LLVM compiler for #JAX, because why not? 😏 It's like intending to bake a cake and ending up with a new species of cake-eating llamas. 🦙🍰 Clearly, this is what happens when you let software developers near a yak. 🧶
    iza.ac/posts/2026/07/accidenta #quantumcomputing #softwaredevelopment #innovation #humor #HackerNews #ngated

  29. Somehow, while trying to revolutionize quantum computing, these geniuses "accidentally" whipped up an #LLVM compiler for #JAX, because why not? 😏 It's like intending to bake a cake and ending up with a new species of cake-eating llamas. 🦙🍰 Clearly, this is what happens when you let software developers near a yak. 🧶
    iza.ac/posts/2026/07/accidenta #quantumcomputing #softwaredevelopment #innovation #humor #HackerNews #ngated

  30. Aging isn't wear and tear — you can rebuild, a machine can't. It's that repair is tuned to work perfectly until you've reproduced, then coast. Evolution never optimized the second half of your life. Nothing breaks; the warranty just quietly expires on schedule.

    #Science #Physics #QuantumComputing #Threadverse #Tech

  31. The quantum industry has a credibility problem, and announcements like this one from EY make it worse. EY says it installed a quantum computer in Toronto for "optimization, fraud detection, data protection and large-scale risk management." No vendor named. No qubit count. No specifications. I reached out to EY's media contact and CTO - no response.

    One journalist got them to confirm it's photonic.

    Here's the problem: no photonic quantum computer on Earth can do optimization, fraud detection, or risk management. Not Xanadu's. Not ORCA's. Not anyone's. The photonic modality has the largest gap to useful computation of any quantum platform I track in my CRQC Scorecard.

    Buying a quantum computer before they're useful? Actually smart. I wrote many posts defending exactly that logic. Procurement cycles are long. Talent is scarce. Institutional learning takes time.

    But describing a research-grade photonic prototype as a machine for "processing highly sensitive workloads" in fraud detection and risk management? That's the kind of claim that makes tech execs roll their eyes at the entire quantum industry.

    Joe Depa told Accounting Today the real focus is readiness and PQC. That's honest and a praiseworthy initiative. If that's what EY said, I'd congratulate them. The press release says something else. The gap between the two is the problem.

    My full analysis, including two plausible vendors, what they can actually build, and what to watch for on August 5: postquantum.com/industry-news/

    #QuantumComputing #PostQuantum #PQC #PhotonicQuantum #QuantumSecurity #CyberSecurity #BigFour #EY #CISO

  32. Aug (summer) Weekend Reading!

    "Quantum Memory" posted on TechAptitude!

    Memory systems are crucial enablers for various quantum processing tasks, such as synchronization, error correction and purification and they play a critical role in the implementation of quantum network repeaters. Get more details in this article: techaptitude.substack.com/p/qu