Photonics
Photons carry quantum information at the speed of light and barely interact with anything — which is exactly why they are hard to compute with. After this chapter you will evaluate any photonics claim by first asking which job the photons are doing: computing, networking, or supplying components.
Photonics is the natural carrier of quantum information between systems, and a plausible carrier of quantum information inside a computer. Those are two different claims, and evidence for the first does not count as evidence for the second.
By the end of this chapter you will be able to split a photonic claim into its stack — photon sources, encoding, interference, switching, detection, feedforward — attach a loss budget to each layer, and state what a convincing proof gate would look like for the specific role being claimed.
Core concepts: photonic roles, indistinguishability, loss budgets, feedforward, proof gates.
Light that carries state
A photonic quantum computer stores information in properties of individual photons — which path a photon occupies, when it arrives, or how it is polarized — and processes that information by letting photons interfere in networks of beam splitters and phase shifters. Photons are appealing carriers for three reasons: they move fast, they barely notice their environment, and they travel down the same fibers and waveguides that classical communications already uses. A qubit that tolerates room temperature and rides existing optical infrastructure is a genuine engineering prize.
The same aloofness is the catch. Photons do not interact with each other on their own, so two-qubit logic has to be engineered indirectly — typically through interference plus measurement, which makes gates probabilistic. And photons are easily lost: absorbed in a waveguide, missed by an inefficient detector, or filtered out by imperfect optics. A lost photon is not a flipped bit; it is missing information.
So the first diligence question about any photonics announcement is which role is being claimed. Photonics appears in the quantum world as a full computing platform, as a networking layer connecting other qubit types, as an interconnect inside a larger machine, as a sensing or communication system, or as a component business selling sources and detectors. Each role has its own evidence standard, and a strong demonstration in one role proves almost nothing about the others.
How the bill adds up
The right mental model for a photonic architecture is a compounding budget. If a computation needs many photons to survive generation, coupling into a chip, an interferometer mesh, switching, and detection, then the end-to-end success probability is roughly , where is the loss or error per component of type and is how many such components sit in the path. Small per-component losses sound harmless until the exponents grow: a chain that loses two percent at each of one hundred stages keeps about thirteen percent of its photons.
This is why photonics people obsess over indistinguishability — photons must be identical in every degree of freedom or they fail to interfere — and over per-decibel loss numbers that engineers in other modalities never have to quote. It is also why many photonic computing schemes lean on feedforward: measure some photons early, compute the correction classically, and reconfigure later optics in real time. Feedforward turns a passive optical network into a computer, at the price of adding detectors, logic, and latency to the loss budget.
For memo discipline, score claims the way this book scores every hardware claim: . The score forces a photonic pitch to declare which layer it has actually proven — sources, integrated optics, loss management, detection, networking value, or application-level utility — instead of letting a strong layer borrow credibility from a weak one.
Worked example: deconstructing a photonics claim
Suppose a company says photonics is the best route to scalable quantum computing because photons do not decohere. Do not accept or reject the claim in one move. Split the stack and trace it:
- Role. Is the claim about a compute platform, a network, or components? Write it down.
- Source. Are single photons generated on demand, with what rate and indistinguishability?
- Loss map. Where does light get absorbed — coupling, propagation, switching, detection — and what is the end-to-end survival probability?
- Logic. Are gates deterministic or probabilistic, and what overhead do feedforward and multiplexing add?
- Integration. Which of these has been shown as a component, and which as an integrated system?
- Correction. What is the error-correction story, and does the loss budget fit inside its thresholds?
A strong proof gate for a compute claim would be an integrated demonstration where source quality, loss, detector performance, and feedforward all meet the needs of the claimed architecture at once — not four separate records set in four separate experiments. For a networking claim, the honest gate is end-to-end entanglement delivered between real nodes at a useful rate. The trace tells you which gate matters.
Where the pitch bends
The most common distortion is laundering one photonic strength into proof of every photonic claim. Photons are superb carriers for quantum communication; that fact does not make a universal photonic computer any closer. Run the argument in both directions: the difficulty of photonic computing does not diminish the component and networking opportunities, and the reality of photonic networking does not validate a compute roadmap.
The second distortion is treating loss as a detail. Because photons feel little environmental decoherence, it is tempting to call them clean qubits and move on. But loss in a photonic architecture plays the role that decoherence plays elsewhere — it sets the scale at which the error budget breaks — and it grows with every added component. A pitch that quotes coherence without quoting end-to-end transmission has moved the problem, not solved it.
The compiler's-eye view
If you come from software, photonics is the clearest illustration that the physical representation rewrites the cost model. Some photonic architectures are measurement-heavy: entangled resources are built offline and consumed by measurement. Some are network-heavy: the machine is a fabric of links with small processing nodes. Some trade deterministic gates for probabilistic resource generation plus fast classical feedforward. In each case the operations a circuit description treats as primitives have radically different real costs.
The control-and-readout stack here is optical paths, interferometers, single-photon detectors, time bins, switches, and classical logic racing photon arrival times. Executing a circuit means coordinating that physical process — not applying named gates in the abstract. A compiler targeting photonic hardware must know which operations are native, which are synthesized at enormous overhead, and what the loss budget does to deep circuits.
What this buys you in diligence
Photonics rewards a decision memo that names the wedge precisely. A build decision might favor photonics for interconnects between other qubit types even while the full compute thesis stays unproven. An investment decision might focus on sources, detectors, or integrated photonics — businesses that sell picks and shovels to every modality — rather than on a platform bet. A partner decision might rest on networking value that is demonstrable today.
The discipline that protects you is the same in each case: refuse to let a component-level proof validate the whole stack automatically, and refuse to let stack-level difficulty invalidate a real component business. Photonics is several industries wearing one name.
Exercise
Classify one photonic claim. Take a real announcement — a company page, a paper abstract, a funding pitch — and work it through this chapter's machinery.
- Trace: label the claim as compute platform, networking layer, or component opportunity, then trace it from photon source through loss points to detection and feedforward.
- Budget: write down the compounding-loss model with plausible per-stage losses and show how quickly the success probability falls.
- Gates: define three proof gates appropriate to the specific role being claimed — not to photonics in general.
- Decide: choose build, partner, invest, monitor, wait, or avoid, and state the single piece of evidence that would change your label.
Check your understanding
Answer without notes: why does "photons do not decohere" fail as an argument that photonic computing will scale?
A passing answer names loss as the dominant error channel, explains how per-component errors compound through a deep optical circuit, and separates the compute-platform claim from the networking and component claims. Oral defense: argue both sides — one minute on why photonics is the most plausible path to a networked quantum future, one minute on why a photonic universal computer is the hardest version of the problem.
If you get stuck
If your analysis treats communication strength as proof of compute readiness, or quotes component records as system evidence, go back to Chapter 54, The Full Quantum Computer Stack. That chapter builds the layer-by-layer discipline this one applies to photonics, and the repair usually consists of writing the stack down explicitly.