Victor V. Albert

Victor V. Albert

@vva.bsky.social

Theoretical physicist @NIST, QuICS Fellow, Zookeeper @eczoo.bsky.social. Views my own.

796 followers372 following99 posts

v2 adds over 100 codes whose twofold transversals generate the logical Clifford group, including a [[77,34,5]] generalized Golay code. Also AxiomaticAI has independently Lean verified the decomposition of arbitrary twofold gates into Z-diagonal, X-diagonal, and CNOT networks.

imagine a hunter-gatherer who’s spent his entire life learning to survive deep in an unforgiving rainforest, then a giant resort hotel springs up right next to him with a helipad and heated pools and AirBnBs, and without missing a beat scottaaronson.blog?p=10169

scottaaronson.blogThe MathocalypseLast night my 9-year-old son was taunting my wife, complexity theorist Dana Moshkovitz, as follows: “mommy, I heard you got cooked! I heard that a robot solved the math problem you worked on …

Agents helped w/ explaining binary symplectic rep theory and geometry, algorithms for gate search, expressing any group element as a product of generators, which involves an exhaustive recipe for all 720 elements of the two-qubit symplectic group, & sane-looking toc, none of that two-column stuff.

I used the Agentic Publication Protocol [arxiv:2606.27386], which packages the paper into a repo. The repo can be loaded to an agent, which will then pretend to be me and answer your questions.

One can define the "two-fold transversal" group, the group of all stacks of depth-one two-local code-preserving Clifford circuits. Each element turns out to be a product of generating layers that we understand. Several CSS codes admit full logical Clifford group using such stacks.

The group of all code-preserving Clifford circuits turns out to be generated by Z- and X-diagonal circuits, should be useful for circuit compilation. Looking ahead, we can also use permutations to make two-fold transversal circuits code-preserving, which could be interesting for atom platforms.

The "wrong" kind of centaur has a mechanical head: AI in charge, human struggling to catch up. Right now the AI loses track if not handheld. But if the pace continues, it gets away from us—we become historians trying to parse a flood of output we didn't generate and can barely verify.

My usual tutorial opens the talk, AI slides come near the end—so the structure accidentally mirrors the transition itself. Results start at minute 34, discussion in the last 20.

"It's tough to make predictions, especially about the future." Giving a talk tomorrow. What do you think? A artificial scarcity, money problems, compute constraints → higher prices, restrictive APIs B future models cheaper, current models already good enough, tasks routed efficiently → lower prices

We're at a strange, specific moment. Takes range from "publications are dead by fall" to "I tried LLMs in November, they were bad." If you have an LLM-assisted paper, take full responsibility as usual. Do everything: arXiv, GitHub, website, and integrate with databases if appropriate.

Five years of work in the making: manual marathon followed by an AI-assisted verification sprint. Thank you @phfaist.bsky.social for being a steadfast and attentive architect! Suggestions on where to go from here very welcome.

Error Correction Zoo@eczoo.bsky.social

Big update: the EC Zoo is now a handbook. It spans codes, sphere packings, lattices, designs, groups, and phases of matter. Extensively checked, but not perfect—feedback very welcome: arxiv.org/abs/2606.11484

Vibe-classified all subgroups of the 4-qubit symplectic group Sp(8,2), up to conjugacy. 657007 classes vs 1369 for 3-qbit, 56 for 2. AFAIK, this is the simple group with the largest classified subgroups [cf arXiv:1306.4820]. Would not be possible without agents. github.com/valbert4/sp8

Victor V. Albert reposted

Prompts are becoming a new currency. Prompt libraries are popping up. I find myself asking others for their prompts. App installs can now be prompted (cf @karpathy.bsky.social's talk). Hearing discussions on giving agents a skill file instead of writing a scientific paper. Any others?

Victor V. Albert reposted

The forward-looking Oratomic time-efficient architecture claims to "potentially enable runtimes of 10 days for ECC–256 with ≈26,000 qubits, and 97 days for RSA–2048 with ≈102,000." This is based on stitching together several gadgets and plausibly assuming they can work together on an atom platform.

Exciting, scary, and thoughtful session on the future of AI at #apsmarch and possible breakdown of peer review. Matthew D. Schwartz: "AI will keep getting better and better at physics. We will not."

Exciting, scary, and thoughtful session on the future of AI at #apsmarch and possible breakdown of peer review. Matthew D. Schwartz: "AI will keep getting better and better at physics. We will not."

Exciting, scary, and thoughtful session on the future of AI at #apsmarch and possible breakdown of peer review. Matthew D. Schwartz: "AI will keep getting better and better at physics. We will not."

Participated in my first NSF panel: wide variety of excellent proposals, from basic-science to practical. Thank you to the other panelists and program directors for upholding high standards and competitiveness!

Peter Shor and Bert de Jong hosted our discussion. We discussed ingredients for achieving the elusive practical quantum speedup. Several noted that an asymptotic polynomial speedup may not be enough since constants can prevent it from kicking in at practical parameter regimes.

Participants in that panel were Sofia Vallecorsa, Eleanor Rieffel, Hank Lamm, Gabe Perdue, Matthew Otten, Sarah Sheldon, Andrew Sornborger, Yigit Subasi, Thomas ladecola, Peter Orth, Norm Tubman, and Maxime Dupont.

Recommendation letters for the Hartree are due on Dec. 8th. Please verify with your writers that your letters are uploaded!

Victor V. Albert@vva.bsky.social

QuICS Hartree fellowship application is out! A competitive and completely free-range postdoc. Anyone interested in quantum science and technology topics is encouraged to apply, preferably by Dec. 1. umd.wd1.myworkdayjobs.com/en-US/UMCP/j...

Victor V. Albert reposted

Peter Shor: we haven't found many new quantum algorithms, in part, because we need larger quantum devices for testing our heuristics. He gives several examples of algorithms that were discovered computationally, including turbo codes, @fermilab.bsky.social quantum symposium by the SQMS center.