Magic-state preparation is a central component of fault-tolerant quantum computing. Recent theoretical and experimental successes in code-switch-based magic-state preparation have underscored the promise of these methods for quantum error correction. Similarly, magic-state cultivation has likewise been demonstrated in both numerical and experimental settings. However, a thorough comparison between magic-state cultivation and code-switch-based ma... Read more ›
Thanks to 261 contributors, 1185 pull requests, community reviewers, and our generous donors, we're happy to announce the Bevy 0.19 release on crates.… Read more ›
A Go CLI tool that scans rendered Kubernetes/Helm manifests and produces a CSV & JSON report of security misconfigurations. - VahidR/helmsniff Read more ›
Between myriads of instances of the same font, multi-file output, multiple bibliographies, and support for more than one PDF standard at once, Typst 0.15 is all about multiplicity. Read more ›
The rapidly evolving quantum computing industry has quickly spun through two critical stages and now ... Read more ›
Quantum error-correcting codes (QECs) are essential components quantum computation and have deep connections to quantum phases of matter. A key obstruction to passive self-correcting QECs is the presence of string logical operators, which can generate logical errors through constant-energy-barrier processes. Haah's Codes (fracton codes) showed that three-dimensional stabilizer codes can forbid such string logical operators, but their translation... Read more ›
Notes on Go's accepted goroutine leak profile and how it reuses the GC to find them. Read more ›
A font family designed for software developers. Font follows function. Read more ›
We study the problem of emergency operation center placement in disaster response, where a minimal number of hubs must be selected to ensure timely coverage of all affected locations. This task can be formulated as a minimum dominating set problem on a graph encoding reachability within a target response time. We propose a hybrid quantum-classical approximation framework that leverages neutral-atom quantum computers as independent set samplers. ... Read more ›
Elsewhere, beyond-classical quantum hardware, plus classical computing fires back. Read more ›
Contribute to katarinapetrov19/ShipKit development by creating an account on GitHub. Read more ›
# V131 Silicon Photonic Chip — Topological Manifold Processor & Photonic Cipher **Project:** NINE-HEADED BIRD (V131-S01) **Status:** Physical Resonance Locked **Organization:** Milkyway Center **Contact:** yuanjimaster@gmail.com **Report Date:** June 2026 --- ## 08. V131 Silicon Photonic Chip Tapeout **Topological Manifold Processor on SOI** 2^363 Crystal Manifold | 80-Channel C-Band DWDM | FPGA Real-Time Decode **Tape-Out: 3/3 PASS | BER=0 Verified** ### 08.1 Key Specifications | Param... Read more ›
I built the same in-memory cache six ways with the Go standard library and benchmarked them across read/write mixes and core counts. Lock striping wins by up to 8×, sync.RWMutex turns out to be a trap, and one design gets slower the more cores you add. Read more ›
The surface code is a promising route towards large-scale quantum computing, requiring only nearest-neighbour gates amenable to superconducting hardware. However, surface codes incur large qubit overheads. Novel quantum low-density parity check (qLDPC) codes promise to reduce overheads but require long-range connections that are difficult to achieve on superconducting platforms. Here, we introduce "Vine Codes" - qLDPC codes that are implementabl... Read more ›
Font Proof is a Mac app for type designers. It watches your Glyphs file, builds real PDF proofs, and updates the moment you save. One-time $100 license, 14-day free trial, requires macOS 14 (Sonoma) or later. Read more ›
Neutral atom quantum computers (NAQC) are emerging as a promising, scalable quantum computing platform because of their long qubit coherence, flexible qubit arrangement, and multiqubit gate capabilities. However, circuit execution often requires physically moving qubits, making compilation a critical optimization challenge. We propose a circuit independent mathematical framework built on graph-theoretic combinatorial optimization that determines... Read more ›
Classic-feel Quake multiplayer. Contribute to classicq/classicq development by creating an account on GitHub. Read more ›
Even if Shor's Algorithm is now implementable inside ten years, symmetric keying should still be trustworthy if we fix RSA with PQC methods. Don't throw the baby out with the bathwater! Read more ›