My grandfather and I were both Eagle Scouts. My grandfather received his in 1930 (the case on the left); mine was awarded September 26, 1983. The newspaper clipping must be from the Williamson Daily News.
See our online course on quantum computing or our online courses on quantum communication.
My grandfather and I were both Eagle Scouts. My grandfather received his in 1930 (the case on the left); mine was awarded September 26, 1983. The newspaper clipping must be from the Williamson Daily News.
Last Sunday we released the -02 version of our Internet Draft, "A Quantum Network Architecture". This is a major release. Many things have changed, and hopefully most of the changes count as improvements. (This is an artisanal, human-crafted draft throughout. No AI used!)
This version introduces a lot of topics that haven't yet been discussed in QIRG in any depth: network installation, debugging, and management, especially. It is an architecture draft, aiming toward a concrete implementation, and while those issues might not sound important in research terms they impact various issues in design and implementation, at the architecture level.
The -00 and -01 versions were very preliminary, to put something in front of the group for discussion of the direction. This draft (-02) is the first one that's moderately complete, though I don't think it's finished in any sense of the word.
The draft is available in several forms at
https://datatracker.ietf.org/doc/draft-van-meter-qirg-quantum-network-architecture/
If you want to see the differences from the -01 version:
https://author-tools.ietf.org/iddiff?url1=draft-van-meter-qirg-quantum-network-architecture-01&url2=draft-van-meter-qirg-quantum-network-architecture-02&difftype=--html
If you are interested in contributing, the best way is to comment on the Quantum Internet Research Group (QIRG) mailing list, which is archived for the record. Links to subscribe and to see the archive are available at
https://datatracker.ietf.org/group/qirg/about/
If you become actively involved in writing substantial new text, or if you just want to nose about in the edit history, the draft is stored in a publicly visible GitHub repository:
https://github.com/moonshot-nagayama-pj/draft-van-meter-qirg-quantum-network-architecture
Bullet-point level summary:
As you can see, it's long (74 pages, about 14,000 words of central text).
Areas that are still ripe for a lot of work:
Comments VERY welcome -- that's what I-Ds are all about!
I have taken to describing the current situation thusly:
The last time I felt this exhilarated but this unsettled was when the Berlin Wall fell in 1989.
In important ways it represented an exciting advance, a true change in the world. There was hope, even celebration, but there was also uncertainty and even fear; would it all work out? What would the response from Moscow be? A little later, as the Soviet Union itself disintegrated, what would come out the other side -- and who would control the nukes?
I'll admit, I have reservations about AI, but even above those I didn't expect things to really move this fast. Having lived through many plateaus, I assigned a high probability to LLMs hitting another plateau in capability below their current level. I am startled, and concerned, but also intrigued.
There is so much more to say, but I'll leave it here for now.
Will AI put out new papers, theorems, code, and other artifacts, just like existing systems put out data that has to be synthesized into knowledge?
The massive dump of mathematics papers from OpenAI a few days ago suggests that we are going to be flooded with a new type of "data point": a theorem, function, larger piece of code, or even entire paper, just like digital systems and the Internet have flooded us with data in the last couple of decades.
Maybe we can call them synthetic papers, or synths, instead of actual academic journal papers?
What will it be like to try to sift through those, looking for the message or the meaning?
Each synth won't really represent a new piece of knowledge until, of course, it's evaluated for correctness, but also not until it can be incorporated into further work, and particularly not until humans can understand it, vouch for its importance and build on it. (Unless we all just want to go the way of the Eloi, but that would be a very long and somewhat separate conversation.)
New paper from our collaboration with Argonne/Chicago. I think this is one of the most thorough, careful papers on quantum repeaters out there.
We began more than two years ago with the idea of just making sure our simulators work right, to compare the output on some simple tasks and strengthen our confidence in both simulators. It turned into a journey of understanding, identifying a long list of assumptions underlying our work that differed in the two groups.
It also resulted in a number of outright bugfixes to both simulators, including several months of head scratching near the end where the paper was essentially ready to go but we couldn't get an equation and the output of one of the simulators to match. Now resolved.
If you work on quantum networks, check it out -- and check your own assumptions about protocols and design and compare to ours!
As always, feedback welcome. And thanks to all ten coauthors, especially Michal and Joaquin, for pushing through on the coding, math and writing.
Joaquin Chung (1 and 2), Michal Hajdušek (3), Naphan Benchasattabuse (3), Robert J. Hayek (1 and 4), Alexander Kolar (1 and 2), Ansh Singal (1 and 4), Kento Samuel Soon (3), Kentaro Teramoto (5), Allen Zang (1 and 2), Caitao Zhan (1), Raj Kettimuthu (1 and 2), Rodney Van Meter (3) ((1) Argonne National Laboratory, (2) University of Chicago, (3) Keio University, (4) Northwestern University, (5) Mercari Inc.)
https://arxiv.org/abs/2610.09322
Oh, and I should point out that there was a preliminary version of this published at an IEEE INFOCOM workshop in 2025. The new version is better, though! (Literally almost two years of extra work, substantially deeper and more detailed.)
Posted first as a comment on a friend's Facebook post, but worth elevating here, I think. Extended and corrected:
The anthropomorphizing of (present-day) AI doesn't bother me much. I don't refer to any LLM by name or say "please" and "thank you" and worry about its feelings (or, as a recent report would have it, its pain), but referring to its activity as "thinking" -- heck, we've done that since before I joined the CS community. How many programs printed out "thinking..." while they were computing? The verb "to think" has such a broad set of vernacular meanings that I don't worry about it much.(n.b.: both images seem to show up low resolution in my browser, but when you click them they enlarge cleanly. They are just bitmaps, though, so still limited in quality.)
Quantum error correction (QEC) is one of the most important and exciting subfields out there. It's very possible to make contributions looking only at encoding qubits, but to have a complete picture of managing errors in a quantum system, you need to recognize that there is more to the problem and a lot more to the solution. Starting from the layer closest to the atoms and working up to the layer closest to the algorithm, we can divide into seven layers (no relationship to the OSI model of communications).
Current-generation AIs are particularly good at finding and generating corresponding patterns. This can be useful when classifying images as cats or dogs (classifiers) or creating new sentences or images (genAI). But those patterns in physical systems arise from the behavior of physical laws. Oscillators are a good example -- a pendulum's behavior is due to its own potential and kinetic energy, momentum, and the restoring force of gravity. An AI that could derive the laws describing the behavior of pendulums was demonstrated more than fifteen years ago. That's great, and at the time was touted as heralding a new automation of science.
In the last few years, though, AIs have been tasked with predicting the weather. Three years ago, there were claims that DeepMind could outperform European weather models on some tasks. This is great when the task involves finding a pattern. What happens when the system deviates from the pattern? We know that happens whenever there is sensitive dependence on initial conditions (chaos). We also know that there are limitations to the accuracy of computer arithmetic, even at the most fundamental level.
If we become too dependent on systems that mainly look for patterns, we might find deeper patterns than those that we already knew about, but we might miss out on finding new physical phenomena, especially emergent behavior.
To me, this is a pretty fundamental concern about replacing mathematical modeling with AIs. Just recently, it was shown that physics-based models still outperform AIs on certain weather tasks, and I think this is why.
So, let's be careful about simply handing over both the thinking and the computation to AI, okay?
Leslie Valiant's "A Theory of the Learnable" is certainly considered a landmark: it has been cited over 9,000 times, according to Google Scholar. Cited in a lot of quantum machine learning (QML) papers, this is a highly technical paper with mathematical theorems and proofs showing that certain classifications can be learned in polynomial time, and I definitely don't fully understand it yet. Gotta love this image from the conclusion, though:
Consider a world containing robots and elephants. Suppose that one of the robots has discovered a recognition algorithm for elephants that can be meaningfully expressed in k-conjunctive normal form. Our Theorem A implies that this robot can communicate its algorithm to the rest of the robot population by simply exclaiming "elephant" whenever one appears.
I wonder how many elephants are required...
Speaking of landmarks, the creators of UNIX, Ken Thompson and Dennis Ritchie, received their Turing Award in 1983, and their speeches are printed here. Thompson's speech on trust is funny, engaging, insightful, and unexpected, and at least in my circle of friends probably the most-cited Turing talk of all.
A benchmark paper on, well, benchmarking appeared in October -- the original Dhrystone paper. As far as I'm aware, the first benchmark per se was Whetstone, originally written in ALGOL 60 in the very early 1970s, then rewritten in FORTRAN, which is probably its best-known form. Dhrystone came along a decade later. The paper contains full source in Ada, which was the trendy programming language of the day. Hard to imagine publishing several hundred lines of code in CACM today. The paper discusses a version in C but doesn't include it, claiming that an "equivalent" program in C is harder than an equivalent program in Pascal due to the lack of native language support for assigning (copying) data structures and strings. Benchmarking of quantum computers is a hot research topic now, so it's always nice to revisit the origins.
The Dhrystone paper cites a 1971 collection of FORTRAN programs by Donald Knuth, who is in CACM again this year analyzing the complexity of songs.
And a personal note -- my former colleague and friend Yigal Arens, talking to a UNIX computer in English. Nice.
The shining jewel of the year (besides the Thompson paper) is the September special issue on the Space Shuttle. I still teach from one or two of the papers in this issue. At the time, the Space Shuttle was considered the most complex machine ever built, and it required a sophisticated control system. IBM built the computers, and included a sophisticated fault tolerance scheme using five computers. It would be interesting, in today's context, to compare this system to the control system of SpaceX Dragon spacecraft.