When Picture-Languages Borrow From Other Fields

Why pictures feel good and why that is risky

People like seeing a drawing come together. A chart or a wiring plan can make a hard idea feel simple. That feeling helps us teach and build things. But feeling right is not the same as being right. A neat picture might show nothing real. And the neater it is, the easier it is to forget it is only a picture.

The ZX picture-language is the main drawing tool used in quantum computing today. It helps people design circuits, fix errors, and plan measurements. Its rules are proved correct for big parts of quantum math. Its success is real. But the same drawings are now being shown next to ideas that no proof in the language touches: space-and-time nets from gravity studies, twisted math groups, heat-and-information ideas, and toy models of black holes. Each borrowed idea has its own proved story. What is missing is any check of whether these stories fit together — or fit the flat drawing surface they all share.

This paper looks for cracks. It takes the three main building blocks of the language — spiders, Pauli webs, and gadgets — and asks each one: where did you come from, what do you quietly carry with you, and where does the map stop? It then checks whether the borrowed pieces fit each other. It names the general pattern the "cafeteria problem": separate fields stay separate except when someone finds it handy to mix their ideas, with no check for whether the mix makes sense.

The three building blocks and where they come from

Spiders are the dots in the drawings. A green dot copies and joins information in one way. A red dot does the same in a turned-around way. The rules for moving dots around keep the hidden math exactly right. Proofs show that every true match between two math tables can be shown by moving dots. This is solid ground.

Pauli webs track how error-fixing codes work inside the drawings. They show families of fix-lines that move through the picture as rules are applied. One proved result shows that red and green dots match exactly with rough and smooth join-and-split moves in surface codes. Pauli webs have become a standard tool for reading code structure off drawings. They have also been stretched to cover endless repeating codes by adding a single delay step between time moments.

Gadgets are small drawing patterns that stand for costly operations in quantum computing. They let people shrink and improve circuits by rewriting around these patterns. The idea comes from a way of computing by measuring tangled resource states. It reached its drawing form in a sister language with wider join-points. Recent work shows how to undo gadget-making to save qubits, with hard math limits and practical methods.

What each block quietly carries

Every borrowed idea brings more than its label. Spiders come from flat diagram algebra. They carry the flat layout of lines and planes. The proofs show facts about the algebra, not about real space and time. Pauli webs come from error-fixing theory. They carry a picture of code spread through space and time. In the heat-and-gravity use, they also carry words about entropy, wormholes, and black holes. Gadgets come from measurement-based computing and circuit-shrinking. They carry claims about matching between different ways to compute — claims checked by rule-following, not by building anything real.

Inside the computing area, these three work together perfectly. They are all maps of the same hidden math object: a linear table between qubits. The matches are proved where they matter.

But the borrowed pieces have grown past the map. Space-and-time nets from gravity studies have been placed into an extended drawing language. Twisted math groups have been used to build braided versions. Heat-and-gravity codes have been studied through Pauli webs, with entropy numbers and toy black-hole and wormhole models computed by moving dots. These are imports from space-and-time particle physics and from line-like heat theory — landing on a flat drawing surface.

Where the map holds and where it cracks

Inside computing, the answer is yes, with proof. Spiders and Pauli webs match because the fixed part of the language is complete. Spiders and gadgets match because gadget-making keeps circuit meaning intact. Pauli webs and gadgets match because both are tools on the same fixed structure. Here the drawings do exactly what their proofs say. This paper does not question this.

At the edge of the physical imports, the answer is: nobody checked. Three cracks appear.

First, the flat-to-space-and-time crack. Space nets are structures of space-and-time gravity study. They carry turning-momentum data. Twisted math groups carry change numbers that encode real symmetry shifts. When these are placed in a flat drawing language, no published work checks whether the source theory's space-and-time meaning survives the move. The host language's proofs are about its own algebra; they say nothing about the imported structures' physical claims.

Second, the flat-to-line crack. Heat-and-gravity codes compute entropy numbers and model black holes and wormholes through Pauli webs. Entropy is a line-like heat idea — a number tied to a group of possible states. The heat-to-geometry dictionary that links it to shape is itself one of the most fought-over builds in physics. The drawings import the words without any shown match with the drawing rules. The same crack appears one step earlier, in how chance itself is treated: an extended language covers classical chance spreads over ordinary bits, and this classical piece is routinely mixed with the quantum one with no line drawn. The drawings are not wrong to track fix-lines; they are unchecked as carriers of heat and chance claims.

Third, a crack inside the same drawing. When space nets and heat-and-gravity ideas appear in the same drawing tradition, the two physical imports are being combined without any argument that their physics matches each other — the exact problem named at the start.

A search of the written record for a published match-check across the separate fields found none as of August 2026. This absence is itself the finding. The cracks are not argued land; they are unvisited land. The negative claim is bounded by the search and by its stated test: a published match-check showing mutual consistency of the physical imports would prove the "unchecked" part wrong, and the claim is written to be changed if one appears.

Where each map ends

A map is not wrong for leaving things out. It is wrong when its users forget it leaves things out. Every building block has a seam — the place where the map stops being reliable — and the seam is not marked on the drawings.

A spider is a copy-join move on a measurement basis. It is not a particle. Its lines are not paths through time. The flat surface is not space. The proofs guarantee that every table match is provable in the picture — they guarantee nothing about whether the picture's layout matches any real process. When a reader sees a spider as a real event, they have crossed the seam.

A Pauli web is bookkeeping for fix-line structure. Its error-fixing meaning is internal to the map and sound. When a web is read as "the space-and-time structure of the code," or as evidence about black holes, the heat-and-gravity words have been moved across the seam with no check.

A gadget is a drawing code for a gate. Its match claims are internal to the map and proved. When a gadget is read as a real hardware piece, the physical-making assumptions have been moved across without the resource states being shown.

Why does this matter? Because the unknown region of a map — the area the map cannot test, since its questions can only be answered inside the picture — is unknown by design. The language cannot tell you whether the flat layout of its drawings is the layout of real quantum stuff, because every question it can answer is answered inside the flat picture. The seam is exactly where the map's questions stop — and no theorem of the map can see past it.

The wider pattern

The pattern in the writings is not local. Separate fields stay separate in their journals, their words, and their proof standards. They come together only when handy: when a drawing needs an entropy number, a gravity bit, or a resource count, the import is grabbed from the nearest field and used without checking whether the fields' claims fit together. The language is one worked example of this cafeteria problem, but the mechanism is general.

A map gains users because it works inside itself. The better the map, the louder the silence about its edges. The seam is not marked on the map. Nothing on a drawing tells you where the computing promise ends and the physical claim begins. Imports arrive unchecked. The written record shows the mixing; no written record shows the match-check. The unknown region is unknown. Because the map never tests outside its own area, nobody can say how much the map misses — which is exactly when confident misuse grows.

The cafeteria problem is a failure of borrowing, not of building. It is what happens when a good notation spreads faster than its warnings.

What to do about it

The fix is not to drop the drawings. It is to use them as maps, with the seam stated.

Name where each import came from. For every building block, know the home field and what the import quietly carries. Mark the seam. In any use of a drawing that carries a physical claim — a particle, an entropy number, a black hole — state where the drawing's promises end. Check matches at the boundary. When imports from different fields meet in one drawing, ask whether any published result shows they fit. If not, say so. Test beyond the map's area. The unknown region is not tested by the map. It is tested by real experiments and by formal arguments that link drawing meaning to real processes — the kinds of arguments that, as of this writing, the written record has not yet supplied for the physical imports.

None of this is against drawings. It is for honesty about what a drawing is.

Where this paper's own map ends

The language is one of the great successes of modern quantum computing — a careful, clean, and truly useful picture of computing. Its spiders, Pauli webs, and gadgets are maps, and excellent ones, inside their area. This paper has argued that their physical meaning is unestablished, that the written record shows imports from space-and-time particle physics and line-like heat theory being loaded onto flat drawings without match-checks, and that this cafeteria pattern is a general risk of borrowing across fields. The argument is evidence-based where it cites the written record, and plainly argumentative where it generalizes.

Three things are assumed rather than proved, and the reader should weigh them. First, that a formal system can meaningfully be "about" real stuff at all, so that questions of physical meaning make sense. Second, that unchecked mixing of imports across fields is a real danger worth checking, not a harmless side effect of cross-field work. Third, that there is a difference between a picture of computing and a picture of reality, and that the difference matters. These are the unbreakable ground this paper stands on without proving. Everything else is either a checked fact about the written record or an argument built on that ground, and the line between the two has been marked throughout.

The pleasure of a closing drawing is real. So is the discipline of remembering that it closed a map, not the world.

Words used here

seam

the place where a map stops being reliable and starts being misread as the real thing

Pauli web

a way of tracking how error-fixing patterns move through a drawing

gadget

a small drawing pattern that stands for a costly computing step

entropy

a number that measures disorder or uncertainty in a group of possible states

stabilizer

a fixed pattern that keeps a code's important features unchanged

Learn more in plain language

• Map–territory relationWikipedia (English, more technical)
• Quantum error correctionWikipedia (English, more technical)
• Loop quantum gravityWikipedia (English, more technical)
• AdS/CFT correspondenceWikipedia (English, more technical)
• One-way quantum computerWikipedia (English, more technical)
• GadgetWikipedia (English, more technical)