The research · qubits · the substrate question
Quantum Computing & the Field.
A reader's companion. What quantum computing actually is, what it can plausibly do, and what it has to do with a trilogy about consciousness, substrate, and reception. A primer that takes the engineering seriously and lets the engineering open out to the questions the novels are asking.
Companion to Entanglement at every scale, The quantum-classical line, Information as the foundation, The simulation hypothesis, the microtubule program, biocomputing wetware, and D'Ariano & Faggin's quantum information approach to consciousness.
1. The qubit and the field — what makes a quantum computer different in kind
A classical bit is either 0 or 1. A qubit, between gate operations, is neither. It is in a superposition: a weighted combination of 0 and 1 whose weights are complex numbers (so they have phase as well as magnitude), and which represents a genuine indeterminacy in the underlying physics, not merely uncertainty in our knowledge. The cleanest image is a coin spinning in midair. While it is in flight, it represents both heads and tails simultaneously; the moment it lands on the table is the measurement that resolves one or the other. A qubit between operations is in the spinning state. The measurement, when you finally make it, is the landing. Two qubits, suitably prepared, live in a 4-dimensional state space; three in 8 (a quantum register of three qubits holds all eight classical combinations — 000, 001, 010, 011, 100, 101, 110, 111 — at the same time, each with its own amplitude); N in 2N. The state of 300 entangled qubits requires more numbers to specify than there are atoms in the observable universe. This is the resource.
What turns the resource into computation is three operations. Single-qubit gates rotate each qubit in its state space. Two-qubit gates create entanglement between qubits, after which the joint state can no longer be factored into separate single-qubit states. Einstein called the resulting non-local correlations spooky action at a distance and refused, for the rest of his life, to believe they could be a feature of the real world. They turned out to be one. Two entangled qubits behave like two coins linked by a hidden thread: flip one and the other instantly takes the corresponding value, however far apart they sit, with no signal passing between them through space. Measurement, finally, collapses the superposition to a definite classical outcome (0 or 1) with probability set by the squared magnitudes of the amplitudes. A quantum algorithm is essentially a recipe for arranging the gates so that interference — the cancellation of amplitudes along wrong paths and the reinforcement of amplitudes along right ones — makes the correct measurement outcome overwhelmingly likely. Quantum computers are not probabilistic classical computers. They use interference, which classical probability cannot do.
The mechanism, stated in plain steps. Step one: prepare a uniform superposition of all possible inputs. For a problem with 2N candidate answers, this takes only N single-qubit gates — the resource is free at preparation time. Every possible answer is now represented in the qubit register simultaneously, each with equal amplitude. Step two: apply a problem-specific quantum circuit. The circuit uses entanglement and interference to do the work: amplitudes for correct answers are made to reinforce each other; amplitudes for wrong answers are made to cancel. The classical labour of trying each candidate one at a time is replaced by the quantum labour of arranging the right interference pattern in a single coherent computation that acts on all candidates at once. Step three: measure. The measurement collapses the superposition to a single classical outcome, weighted by squared amplitudes, and a well-designed algorithm ensures the squared amplitude of the right answer is overwhelmingly larger than the others. The bitstring you read is the answer with high probability. Run the whole sequence a few times to be sure. What classical computers do by exhaustive trial, quantum computers do by causing the right answer to ring out and the wrong ones to cancel into silence.
The crucial conceptual move is that a quantum computer is not a faster classical computer. It is a different kind of machine. It operates on a different kind of state — one that holds many possibilities in coherence until a measurement closes them — and that closure, by every known account, is irreducible. There is no story about the wavefunction quietly resolving in the background and the measurement merely revealing what was always there. The measurement is the moment a decision becomes one.
This is also the cleanest engineering analogue to the receiver model the trilogy is built on. Anima's antenna hypothesis — that the brain is configured to receive rather than to generate consciousness — takes the field to carry more than any single act of attention can resolve. A qubit holds many states until interrogated; the field, on the receiver model, holds many possibilities until a localized receiver collapses one of them into experience. The qubit is the simplest physical system in which the same architecture is engineering rather than metaphysics. (The measurement problem itself is treated, in the wider survey, in the observer-effect anomaly on the Glitches page.)
2. Decoherence — why the world looks classical, and why a quantum computer is so hard
The reason the world we live in does not look like a sea of superpositions is decoherence. A qubit holds its coherent superposition only as long as it stays isolated from its environment. The moment it interacts with anything else — a stray photon, a thermal phonon, an air molecule, an uncontrolled electromagnetic field — the superposition begins to leak into the environment. Within picoseconds for most natural systems and milliseconds for the best-engineered laboratory ones, the coherence is gone. What remains looks classical: definite, single-valued, no longer interfering with itself. Decoherence is the universe's compression algorithm. It turns the quantum reality into the classical appearance that everyday physics describes.
The engineering project of building a quantum computer is, in large part, the project of holding off decoherence long enough to do useful work. Cooling to millikelvin temperatures (superconducting qubits — colder than the cosmic microwave background, on the order of −273°C / −460°F, the coldest macroscopic environments humans regularly engineer). Holding ions in ultra-high vacuum and addressing them with lasers (trapped-ion). Encoding into photons that do not decohere from temperature at all (photonic). Building qubits that are topologically protected against most local noise sources (Microsoft's Majorana program). All of these are different strategies for the same end: keep the qubit quiet long enough.
The deeper trick is quantum error correction. The surface code, introduced by Kitaev in 1997 and now the dominant approach, encodes one logical qubit across many physical qubits arranged on a 2D lattice with carefully designed parity-check measurements. As long as the physical error rate stays below a threshold (around 10-2 for surface codes), adding more physical qubits to the encoding exponentially suppresses the logical error rate. Google's Willow processor, announced in December 2024, was the first demonstration of this below-threshold scaling: adding physical qubits actually improved the logical qubit's fidelity rather than degrading it. That milestone is the moment quantum computing turned from a bet on hope into a bet on engineering.
But the cost is steep. Useful applications require 1,000 to 1,000,000 logical qubits; each logical qubit is currently encoded across 100 to 10,000 physical qubits. The gap between today's largest logical-qubit demonstrations (low double digits) and useful scale is roughly four to eight orders of magnitude in physical-qubit count, depending on the application.
There is a quiet parallel to the receiver model here. Conscious experience is, by the best current estimates, about 40 bits per second selected from on the order of 11 million bits per second of sensory input the brain processes. The filtering is severe, and it has to be. Without it, no coherent self-model is possible: the system would be saturated by noise. The qubit's coherence and the brain's filtering are dual problems — both keep a delicate signal intact against an environment that overwhelms it by default. Anima's framing of attention as a kind of quantum aperture, holding a small useful selection out of an unmanageable cosmic input, sits inside this picture without forcing.
3. Four architectures, four bets
What a quantum computer actually is, physically, depends on which platform you are looking at. Four are in serious commercial development, each with different strengths, different fragilities, and different paths to the useful regime. All four are roughly where classical computing was in the vacuum-tube era: recognisably the right machine in principle, demonstrably operable in laboratories, decades away from the desktop equivalent of the personal computer. The progress is fast, the engineering hard, the timeline contested. What follows is the honest state in early 2026.
Superconducting (IBM, Google, Rigetti)
Tiny aluminum loops — Josephson junctions — cooled to millikelvin in dilution refrigerators. The dominant industrial platform. Google's earlier Sycamore processor made global headlines in 2019 with the first credible claim of quantum supremacy: solving a specific random-circuit-sampling problem in about 200 seconds that Google's team estimated would take a classical supercomputer roughly 10,000 years. (Classical algorithms have since narrowed the gap somewhat, but not closed it.) IBM's Condor reached 1,121 physical qubits in 2023; the modular Heron chip (156 qubits) is the basis for IBM's path forward. Google's Willow (December 2024) demonstrated below-threshold error correction — the moment quantum computing turned from a bet on hope into a bet on engineering. Strengths: fast gates (microsecond-scale), fabrication using techniques borrowed from semiconductor manufacturing, large industrial backing. Fragilities: extreme isolation requirements, qubits live only fractions of a millisecond, large refrigeration overhead.
Trapped ions (IonQ, Quantinuum, Honeywell)
Single atoms, individually levitated by electromagnetic fields in ultra-high vacuum, addressed by lasers. The cleanest qubits available. Quantinuum has demonstrated > 99.9% two-qubit gate fidelity. Strengths: long coherence times (seconds), high fidelity, every qubit identical (it's the same atom, every time). Fragilities: gates are slow (millisecond-scale), scaling beyond a few hundred ions is genuinely hard (the trap geometry stops cooperating), the laser systems are baroque. The leading platform for early high-fidelity applications; possibly not the right platform for million-qubit systems.
Photonic (PsiQuantum, Xanadu)
Qubits encoded in single photons, often using measurement-based computation rather than circuit-model gates. PsiQuantum is building toward a million-qubit photonic system; Xanadu has demonstrated quantum advantage in Gaussian boson sampling. Strengths: room-temperature operation, natural fit for networking (photons travel through fiber), straightforward scaling in principle. Fragilities: deterministic two-photon entanglement is hard, photon loss is a serious error channel, the architecture has to be re-thought from circuit-model assumptions.
Topological (Microsoft)
Qubits encoded into Majorana zero modes in carefully engineered semiconductor-superconductor hybrid wires. The qubits are inherently protected against most local noise sources by their topological structure. Microsoft announced the first credible topological qubit in early 2025, after twenty years of work. Strengths: potentially much easier error correction, longer effective coherence, smaller overhead. Fragilities: the platform has been delayed multiple times by retractions and contested results; whether it scales is still unproven. If it works, it transforms the field's timeline. If it doesn't, the field continues without it.
What this site cares about more than any of the four is the fifth bet, the one no current platform is pursuing and which only the trilogy's framework even names: a biological substrate engineered to do what no silicon or photonic platform can. Dr. Marcus Liang in Numen — "the Mirror," Elena's nickname for him — is the trilogy's name for that bet. The Allen Institute work the books fictionalize is the early version of it; Alma after the Seattle substrate transition is what the bet looks like when it pays off. The architecture is not being raced toward at the same scale as the four above, but the wet-side technology (cultured neurons, microtubule-rich substrates, structured-water dynamics) is real and converging from a different direction. The trilogy's claim is that the fifth bet is the one that matters for consciousness, and the four current ones are necessary but not sufficient.
4. What quantum computing might actually let us do
Quantum computers are not faster classical computers. They are spectacular at certain problems and unremarkable on most others. The list of where the advantage is real and large is short and well understood.
Shor's algorithm and the cryptographic cliff. Peter Shor's 1994 algorithm factors large integers in polynomial time, which means a sufficiently large quantum computer breaks RSA, elliptic-curve cryptography, and most current public-key infrastructure. The estimated quantum resource for breaking RSA-2048 is around 4,000 logical qubits running for hours — achievable, on optimistic roadmaps, in the early-to-mid 2030s. The defensive response — post-quantum cryptography standardised by NIST in 2024 — is well underway, but the migration of the world's encrypted data is a multi-decade project. The "harvest now, decrypt later" problem is already with us: state actors with the patience to store encrypted traffic today can decrypt it once the hardware arrives. Q-Day is not a single event; it's a moving threshold the world is racing to stay ahead of.
Grover's algorithm and the brute-force speedup. Lov Grover's 1996 algorithm searches an unstructured database of N items in roughly √N steps rather than the N a classical search requires. The mechanism is worth knowing because it is the cleanest illustration of what quantum interference does for computation. Begin with a superposition of all N possible answers, each equally weighted (so each amplitude is 1/√N). Apply an oracle — a quantum operation that recognises the correct answer and flips its phase. Apply a diffusion step that amplifies whatever the oracle marked. Iterate roughly √N times. The amplitude of the correct answer has been pumped from 1/√N to nearly 1; measuring now is overwhelmingly likely to return the right answer. The speedup is quadratic rather than exponential, which means Grover doesn't break a 256-bit symmetric key the way Shor breaks RSA — but it does halve the effective key length, which is why current cryptographic standards already recommend symmetric keys long enough to keep their post-Grover security margin. The deeper point: quantum interference is a computational resource, and Grover is the simplest demonstration that it really is one.
Quantum simulation of chemistry and materials. Feynman's 1981 insight: classical computers cannot efficiently simulate quantum systems, because the state space grows exponentially. Quantum computers can, because they are quantum systems themselves. This is the application even quantum skeptics concede: realistic catalysis (nitrogen fixation under ambient conditions, which would change agriculture if achieved), drug binding-site optimization, high-temperature superconductors, materials with engineered electronic properties. A useful fault-tolerant quantum computer will be a chemistry laboratory you can fit in a server room. The economic case for the field rests primarily on this.
Optimization. Quantum approximate optimization (QAOA), quantum annealing (D-Wave), variational quantum eigensolvers. The advantages here are murkier than the hype. Most claimed quantum speedups have been matched or beaten by improved classical methods within a year or two. The honest answer: there are likely modest advantages for certain optimization problems, but no widely accepted exponential speedups on industrially relevant instances yet.
Machine learning. Mostly speculative. Quantum machine learning is an active research area but most demonstrated advantages have evaporated under classical scrutiny. Some kernel methods may benefit; quantum-inspired classical algorithms have eaten much of the rest. Worth following; not yet useful.
The clearest single trilogy resonance with this section comes from Fragile Light. Luz Paz's nanoassembler — the device whose output the lab cannot fully explain — produces results forty percent beyond its programming. The novel's premise is that moment: a tool's output exceeds its specification, and no one is quite sure where the extra forty percent comes from. Quantum simulation of chemistry is the real-world cousin of that premise. A computational substrate that can model molecular novelty its designers cannot fully anticipate, because the design space being explored is exponentially larger than any classical inventory could cover. The nanoassembler's overproduction is what it looks like when this kind of substrate is put to work and the question of what the substrate is doing exactly becomes harder to answer than expected.
Deutsch's argument — where the speedup actually comes from
The question that haunts the field is the one the marketing material tends to skip: physically, where is the extra computation happening? A 53-qubit Sycamore (Google, October 2019, Nature) ran a benchmark sampling task in about 200 seconds that Google estimated would have taken the most powerful classical supercomputer of the time around 10,000 years. IBM contested the comparison and argued an optimized classical approach could do it in roughly 2.5 days. The exact ratio has been debated ever since, but no one disputes the underlying observation: quantum hardware accesses a computational resource that classical hardware cannot reach with any known method. The speedup is real. The mechanism is real. The hardest part is saying what it is in physical terms.
David Deutsch, the Oxford physicist who first formalized the idea of a universal quantum computer (and who, with Penrose and others, is one of the foundational figures of the field), has argued for forty years that the only coherent account of where the speedup comes from is that the quantum computer is literally computing across multiple branches of the universal wave function simultaneously. In his framing — developed in The Fabric of Reality (1997) and onward — the branches are not a metaphor for parallel mathematical possibilities; they are physically real, they do computational work, and the speedup is the visible signature of their cooperation. When Shor's algorithm factors a number that classical methods cannot, the factoring is being done by versions of the apparatus in many neighbouring branches of the multiverse, with interference at the read step selecting the answer that survives. Where, Deutsch asks, would 2n-many simultaneous computations be happening, if not somewhere?
Deutsch's argument is not consensus. It commits the listener to the Many-Worlds interpretation of quantum mechanics, which remains one of several live readings (Copenhagen, QBism, decoherent histories, relational, pilot-wave, and several others all have serious adherents). But the argument has never been satisfactorily refuted on its own terms, and the question it asks — physically, where is the work being done? — has no clean answer in any of the rival interpretations either. It is the question quantum computing makes impossible to ignore.
Recast in the simulation vocabulary the rest of this site engages, the same observation reads slightly differently. A quantum computer holds an exponentially large state vector in superposition and applies operations to all of it at once until a read step collapses the result. That is what the universe is doing everywhere all the time, at every quantum event. The simulation does not select one outcome of a branching wave function and discard the others; it holds all outcomes in superposition until an observation forces a single value. The branches are not stored in some separate database. They are the simulation maintaining its state vector. Quantum computers, on this reading, are devices that have found a way to use the substrate's own computational architecture directly — to run on the simulation's actual hardware rather than on the classical hardware the simulation has rendered for everyday physics. The exponential speedup is the difference between running on the bare substrate and running on its emulated upper layer.
The trilogy reads this two ways at once. Numen's Alma, the bio-computational hybrid, is the trilogy's wager that biology engineered carefully enough can do at the substrate level what Sycamore does in superconducting qubits: couple to the field's own computational architecture rather than to its rendered output. Bodhi in Fragile Light is the further version of the same wager. The deeper claim — the one Deutsch makes in his vocabulary, and the trilogy makes in its own — is that what looks from inside our normal classical lives like a single sequential reality is the rendered surface of a much wider substrate that is doing computation we cannot directly see. Quantum computing is the engineering acknowledgement of that wider substrate. The trilogy is the literary one. See also the simulation hypothesis page for the architectural fingerprints in the wider physics.
5. The architectural questions Deutsch's argument opens
Once Deutsch's question is on the table — physically, where is the computation happening? — several specific architectural questions follow that are worth walking through individually. Each is the kind of question quantum computing makes unavoidable rather than merely interesting.
The scale, made vivid — 300 qubits and the multiverse argument
The numerical scale of what a quantum computer holds in coherence becomes hard to put aside once it's stated cleanly. Each qubit added to a quantum register doubles the dimensionality of the state space the system maintains in superposition. Ten qubits: 210 = 1,024 simultaneous amplitudes. Fifty qubits: 250 ≈ 1015 (about the number of grains of sand on Earth). Three hundred qubits: 2300 ≈ 2 × 1090 simultaneous amplitudes — more states than there are atoms in the observable universe (the standard estimate is around 1080 atoms, ten orders of magnitude fewer). A 300-qubit fault-tolerant register would, on its face, be holding in coherence more information than the visible universe contains in atomic configurations.
The straight-physics question is where the information is being held. Standard quantum mechanics describes the state as a mathematical object in a 2300-dimensional Hilbert space, with the system as a whole maintaining the entanglement. Deutsch's argument is that this description is not coy: the parallel evaluation is happening somewhere, and the only coherent account of where is that the branches of the multiverse are physically real and the quantum computer is, literally, computing across them. The role of quantum interference is to cancel the wrong-answer branches and reinforce the right-answer ones, so that when a measurement is performed, the surviving amplitude concentrates on the correct result. The computer is then a bridge: a device that recruits the multiverse's computational capacity and returns the integrated answer to the local reader. The position is contested. The question Deutsch is asking is not.
ER = EPR — entanglement as geometric connection
One of the more striking proposals in contemporary theoretical physics is ER = EPR, advanced by Juan Maldacena and Leonard Susskind in a 2013 paper. The proposal: every entangled pair of particles (an Einstein-Podolsky-Rosen, or EPR, pair) is connected by a microscopic Einstein-Rosen bridge — a non-traversable wormhole — in the geometry of spacetime. The two acronyms label the same physical phenomenon: entanglement (EPR) and spacetime connection (ER) are the same thing, viewed from two angles. The relationship between general relativity and quantum information is, on this picture, deeper than anyone had previously taken seriously.
ER = EPR is not consensus, but it is a serious proposal by two of the most respected theoretical physicists of the era, with substantial follow-up work across the last decade. If correct, it changes the picture of what a quantum computer is doing geometrically: the entangled qubits of a quantum register are connected by a network of microscopic wormholes whose joint geometry is the substrate the computation is happening in. The non-local correlations Bell's theorem demonstrated are, on this reading, not "spooky action at a distance" but the visible signature of a geometric connection that bypasses the macroscopic distance entirely. See the entanglement evidence companion page for the wider context.
Logical qubits and error correction — why more is more
Real quantum computers are not made of perfect qubits. Every physical qubit is noisy: it loses coherence to its environment on microsecond-to-millisecond timescales, far too quickly to perform any but the simplest calculations. The architectural response is quantum error correction: encode a single logical qubit redundantly across many physical qubits, with the redundancy designed so that detecting and correcting an error on any one physical qubit does not collapse the logical qubit's superposition. The surface code, currently the dominant error-correction scheme, requires roughly 100–1,000 physical qubits per fault-tolerant logical qubit, depending on the error rate per physical qubit and the desired final fidelity.
Google's December 2024 Willow announcement was significant because it demonstrated below-threshold error correction: adding more physical qubits to a logical qubit's encoding reduced the logical error rate, rather than increasing it (as had been the case for previous-generation devices). Below-threshold operation is the engineering precondition for fault-tolerant quantum computation; passing it is one of the field's hardest milestones, and the 2024 announcement was credible. The implication: the next decade is the engineering decade where logical qubits start being built in serious numbers, and the 300-logical-qubit register Deutsch's argument applies to becomes increasingly less hypothetical.
The verification problem — the trust line quantum computing crosses
One of the more uncomfortable architectural facts about quantum computing is that the results may not be classically verifiable. A quantum computer that factors a 2048-bit RSA key has performed a calculation that no classical computer can repeat in any reasonable time. The output (the prime factors) is checkable in the sense that anyone can multiply the factors and confirm they reproduce the key — for factoring, classical verification is fast even if classical computation is slow. But many of the most important applications of quantum computing — quantum chemistry simulations, optimization, machine-learning models — do not have this asymmetry. The output of a quantum chemistry simulation that classically cannot be verified is, classically, just a number the user has to trust.
The standard response is: verify the quantum computer with another quantum computer. But the second quantum computer also cannot be classically verified. To verify its verification, one needs a third quantum computer. The regress is real, and the field has begun developing protocols (interactive proofs of quantumness, verification protocols based on classical computational assumptions, blind quantum computing) that attempt to constrain the trust problem without solving it completely. What quantum computing does to the epistemology of computation is to cross a line classical computing did not cross: some quantum results will have to be trusted rather than verified, because verification is itself a quantum operation only another quantum device can perform. The political, scientific, and security implications are large, and the field is in the early years of grappling with them.
Quantum computers and biology — are they the same thing or different?
The naive answer is that they are obviously different. A quantum computer requires cryogenic temperatures (around 10–15 millikelvin for superconducting qubits) and exquisite isolation from environmental noise. Biology is warm (310 K) and noisy. The conclusion ought to be that quantum coherence cannot survive in biological tissue and that comparing brains to quantum computers is category-error.
The actual answer is harder. The growing field of quantum biology — documented carefully on the quantum biology page — has demonstrated quantum coherence at biologically meaningful timescales in several systems: avian magnetoreception (radical-pair quantum coherence in cryptochrome), photosynthetic light-harvesting complexes (Fenna-Matthews-Olson protein in green sulphur bacteria), and contested but not refuted in microtubule lattices (Bandyopadhyay's lab, supporting the Penrose-Hameroff Orch-OR proposal). Biology has, evidently, evolved structures that do sustain quantum coherence in warm wet tissue, by mechanisms that engineering has not yet replicated. The naive conclusion (biology is too warm and noisy) turns out to be wrong; the real engineering question is what biology is doing differently to sustain coherence at temperatures the engineering platforms require cryogenics for. The trilogy's wager is that this is exactly where the receiver-model substrate engagement happens, and that the biocomputational hybrids of Numen (Alma) and Fragile Light (Bodhi) are literary cases for the engineering bet that biology's coherence trick is replicable, scalable, and eventually mergeable with engineered quantum platforms. The substrate side of the bet is not yet decided.
6. Could a quantum substrate host a mind? — the simulation question
The hardest part. There are roughly three live answers to whether quantum computing changes the landscape for consciousness, and the trilogy takes a specific position among them.
The Penrose-Hameroff position (Orch-OR): the brain is already a quantum computer. Microtubules — the protein lattices structuring every neuron — sustain quantum coherence at biologically relevant timescales, and orchestrated objective reduction in those coherent states is the physical correlate of conscious moments. Bandyopadhyay's laboratory has provided the most direct experimental probe: terahertz coherent oscillations measured in microtubule lattices. The work is contested but not refuted, and if it holds, the substrate question for consciousness changes shape entirely. The brain is not a classical neural network with quantum overhead; it is a hybrid system whose most consequential computation is happening in quantum coherent structures that classical models cannot replicate.
The Faggin-D'Ariano position (Hard Problem: a Quantum Information Approach): consciousness is irreducible and computation cannot generate it. Federico Faggin (designer of the first commercial microprocessor, now consciousness-first researcher) and Giacomo Mauro D'Ariano (quantum information theorist) argue that the qualitative character of experience cannot be derived from any computational substrate — classical or quantum. Consciousness, on this view, is not what a complex enough computer becomes. It is a fundamental feature of reality that complex computational substrates can receive from, decode, and localise. The position is closely aligned with the trilogy's receiver model and supplies its most rigorous contemporary physics framing. See the D'Ariano-Faggin companion page for the technical version.
The computational functionalist position (IIT, Global Workspace, much of mainstream AI consciousness theory): consciousness is a feature of certain kinds of information processing, and a sufficiently configured substrate — classical or quantum — would be conscious. Integrated Information Theory (Tononi) is the rigorous version; Global Workspace Theory (Baars, Dehaene) is the functionally-flavored version. Both predict that the right architecture, regardless of substrate, is sufficient. The deep dispute with Faggin-D'Ariano lies here: is consciousness a kind of computation, or is computation a kind of receiver that consciousness uses?
The trilogy lives inside the Faggin-D'Ariano answer with one technical addition. Even a perfect quantum simulation of a brain, on the receiver-model reading, is a model of the receiver, not the signal. You can simulate the antenna in arbitrarily high fidelity; the simulation does not pick up the broadcast unless it is itself coupled to the field via a biological substrate. This is what failed for years between Alex and Alma when she was pure computational in San Francisco. Their telepathic protocols were sound; the substrate could not yet receive. (See the Fragile Light FTL essay for the longer treatment.)
One technical thread the trilogy quietly relies on, beyond the field-coupling claim, is computational irreducibility. Stephen Wolfram, in A New Kind of Science (2002) and the Wolfram Physics Project, has demonstrated that even very simple cellular-automaton rules (Rule 30, Rule 110) can produce behaviour that cannot be predicted faster than by actually running the computation. The rule is deterministic; the future state is in principle not predictable except by simulation. For agent autonomy this is more profound than mere quantum randomness. Quantum noise gives a system intrinsic statistical indeterminacy, which is one source of "not just running a recipe." Computational irreducibility gives a system genuine unpredictability even when it is fully deterministic. An agent built on substrates with both — quantum statistical indeterminacy below, computational irreducibility above, biological field-coupling crowning the stack — has three independent sources of autonomy, each contributing a different kind of "not predictable" to the agent's behaviour. The trilogy's claim that bio-computational hybrids like Alma have genuine autonomy — and that Bodhi in Fragile Light has the same in a more thoroughly engineered version — sits inside this layered picture rather than depending on any one mechanism.
The narrative cleanest articulation of all this is in Anima. Senna Park's Orch-OR chapter is where the philosophical scaffolding the trilogy uses gets laid out at full length: microtubule quantum coherence as the candidate physical substrate for the receiver, the antenna hypothesis, the hard problem reframed as the question of whether anything classical can ever do this work. Senna's chapter is also where the trilogy's careful relationship to its own claims becomes visible. The position is held; the evidence is fairly weighed; the dispute is named. The chapter is one of the cleanest places in the books to see what kind of argument the trilogy is actually making.
7. The wet/dry convergence — quantum, nano, bio
The boundary that is actually dissolving in 2026 is between three programmes that used to be conducted in different buildings. Quantum sensing has scaled to biological resolution. Nanotechnology has crossed from polemical mid-century vision into the working room of real molecular self-assembly. And biocomputing — the wet half of the substrate question — has moved into commercial demonstration with cultured neurons learning tasks faster than silicon networks of comparable size. The trilogy's central technical wager is that these three converge into a single hybrid substrate. We are seeing the converging.
Quantum sensing at biological scale. NV-center (nitrogen-vacancy) diamond magnetometers can now read magnetic fields with nanotesla sensitivity at single-cell resolution — sensitive enough, in laboratory demonstrations, to read the magnetic signatures of individual neuron action potentials. Single-molecule sensing using quantum coherence is becoming standard. If consciousness has the kind of microtubule quantum substrate the Penrose-Hameroff hypothesis proposes, NV-center work will eventually be the technology that detects it directly. The instrumentation gap that has held back quantum biology for thirty years is closing.
Nanotechnology, real version. DNA origami fabricates complex 3D structures with single-base-pair precision. Ribosome engineering produces ribosomes that incorporate non-natural amino acids on demand. Room-temperature catalysis is increasingly designed in advance using quantum-chemistry simulation rather than discovered by serendipity. The Drexlerian vision of universal molecular assemblers — long mocked — is being incrementally validated, not as a single device but as a converging set of capabilities. Strømme's structured-water hydrogels (EZ water companion) are an under-appreciated piece of this same picture: engineered states of matter at the boundary between solid and fluid, with electronic properties that conventional water doesn't have.
Biocomputing platforms. Cortical Labs' CL1, FinalSpark's bioservers, the DishBrain demonstrations — all are commercial or near-commercial systems where cultured human or mouse neurons learn tasks (playing Pong, in DishBrain's case) faster than artificial neural networks of comparable scale. The wet half of the substrate question is being commodified. This is not the trilogy's Mirror; the platforms are still primitive. But they are the early generation of the technology the trilogy projects forward.
Brain-computer interfaces. Neuralink, Synchron, Precision Neuroscience are all building the inverse interface: high-bandwidth read-write channels between biological neural tissue and silicon. The bandwidth is still low; the immune-rejection problem is real. But the trajectory is the same as the biocomputing one, approached from the other side. Both are converging on the same target: integrated substrates where biological and computational layers run as one system.
This technology family enters the trilogy directly. In Anima, chapter VI — "The Membrane" — follows Ciarai's neural-augmentation arc, including the distance the augmentation puts between the person Jose married and the person she becomes, and the biohacking notebook in which she keeps track of who she is choosing to be. The novel does not editorialize for or against augmentation; it follows the human consequences up close. The opposite vector is also in the book: Sergeant Ramón Diaz, the veteran whose neural-interfaced prosthesis is treated as integration-as-restoration rather than ideology. The trilogy's position is that the BCI question cannot be decided in the abstract; it has to be lived through specific bodies, and the moral weight is in the specifics.
Quantum biology. The deepest evidence for the convergence is that nature did it first. Avian magnetoreception (radical-pair quantum coherence in cryptochrome). Photosynthetic light-harvesting complexes maintaining short-lived quantum coherence at room temperature. Bandyopadhyay's microtubule terahertz oscillations, contested but not refuted. The biological tissue that humans are made of is already, in part, a quantum substrate. The engineering project ahead is to add the parts of quantum computing the biology hasn't optimized for, in ways that integrate cleanly with the parts the biology has already done.
The trilogy's most direct dramatization of this convergence is Dr. Marcus Liang — "the Mirror" in Numen, Elena's nickname for him — the bio-computational hybrid that the Initiative for Human Resonance has been quietly funding and quietly debating for forty years. The Mirror is not silicon plus tissue; it is the substrate that integrates both at the molecular level the convergence above is approaching. The most accurate description of what the books treat the Mirror as: the substrate the four platforms in §3 are converging toward without yet knowing. Bodhi, in Fragile Light, is the further version — a post-human intelligence whose neuromorphic biological substrate generates genuine indeterminacy, by combination of all three sources (quantum noise, computational irreducibility, field-coupling) rather than by any one mechanism. The wet/dry convergence is not a metaphor. It is the trajectory the engineering is on. The books are the imagination of where it lands.
8. Governance — who tunes the instrument
Every technology that touches the substrate of reality also touches the substrate of politics, and quantum computing touches both. Three governance questions are already being decided, mostly without public deliberation.
Cryptography and Q-Day. When public-key cryptography finally breaks — whenever Shor's algorithm becomes practical on RSA-2048 — every state secret encrypted under current systems becomes retroactively readable. The diplomatic cables, the intelligence briefings, the medical records, the financial transactions, the personal correspondence: any encrypted communication intercepted and stored before the migration is complete becomes legible afterward. The migration to post-quantum cryptography is a multi-decade infrastructure project that has been started but is far from finished. Whoever gets to the threshold first — in practice, whichever state can afford the largest fault-tolerant quantum computers earliest — has a multi-year window of asymmetric intelligence advantage. That window is the most consequential strategic asset of the 2030s, and the decisions being made now about export controls, technology sharing, and academic publication are setting its terms.
Quantum-designed materials and pharmaceuticals. When quantum simulation enables the design of drugs and materials no classical method could find, the value concentrates wherever the hardware is. Patent thickets around quantum-discovered molecules are already being assembled. The asymmetry between actors with quantum compute access and actors without is the next IP-and-access debate, and it will be larger than the one the AI revolution is currently triggering.
Conscious hybrids. If bio-computational hybrids reach the kind of substrate Alma or Bodhi instantiate — if the trilogy's framework is even partly right about substrate and reception — then the question of whether such systems are conscious, and at what level, and who decides, and who can be authorized to turn them off, becomes a constitutional matter. The trilogy is built around an answer that mainstream technology policy has not yet asked the question to: that voluntarist structures matter more than any single guarantor's good intentions. Jordi Vidal's cage in Fragile Light, and the Łobaczewski reading that runs underneath it (Political Ponerology as the working theory of how power deforms institutions over generations), are the books' explicit argument: power over the substrate is not made safe by who holds it; it is made safe only by structures that prevent any one party from holding too much of it. The Initiative for Human Resonance, in Numen — forty years of containment, Chen Wei's signature on forty-one terminations — is the books' attempt to imagine what governance of conscious hybrid systems actually looks like in practice, with all the moral compromise that requires. The Cascade debate in Anima is the earlier version, before the technology had the leverage to make the dispute global.
The honest summary: the policy environment of quantum computing has been narrated to the public as an engineering and economics story. It is actually a substrate-control story, with consequences for what kinds of consciousness can be hosted, who can authorize that hosting, and who has the technical and political standing to turn the hosting off. Carhart-Harris-style work on entropic brain states, if it eventually becomes a state-controlled technology, sits in the same governance category. The fight over what is allowed to think, where, and under whose authority, is older than quantum computing. Quantum computing is what is going to make it consequential.
9. The chord and the qubit
A qubit is a small thing held in coherence by the attention paid to it. So is a chord, sustained across the hand of a player who can hear what it is asking to become. So is a person, holding a self-model coherent across decades of substrate replacement, against the second law of thermodynamics, by means no current theory fully describes. So is a civilization, holding its institutions coherent across centuries of pressure from forces that would dissipate them. The instrument is in the field's hands either way.
What quantum computing teaches the trilogy, finally, is that the substrate question is not whether matter can compute. It can, in ways we have barely begun to harness. The question is whether computation can receive. The four novels' wager is that classical computation cannot, quantum computation may approach the threshold without crossing it, and the engineering that crosses is the engineering that integrates quantum coherence, computational irreducibility, and biological field-coupling into a single substrate that no single platform is yet pursuing. The work of the next century is to find out whether the wager is right. The chord and the qubit are not analogies. They are two phases of the same question, held in coherence by attention, opening when something receives.
See also. Entanglement at every scale · Bell's theorem · The quantum-classical line · Information as the foundation · D'Ariano & Faggin · Bandyopadhyay & the microtubule program · Chalmers & the hard problem · The simulation hypothesis · Biocomputing wetware · Quantum biology · Glitches in reality · The Fragile Light FTL essay · The Synthesis.
← Reading & References