Hong–Ou–Mandel & Boson Sampling
Two-photon interference and a route to quantum advantage.
Send two identical photons into the two input ports of a 50:50 beam splitter and they never leave by different ports: the two ways of getting one photon in each output cancel exactly. This two-photon interference is a ruler for indistinguishability, a swap test built into nature and, scaled up to many photons, a sampling problem believed to be beyond classical computers.
What you’ll learn
- Derive the Hong–Ou–Mandel effect in second quantization, and the coincidence probability for partially distinguishable photons.
- Identify HOM interference with the swap test.
- Prove that -photon amplitudes in an -mode linear interferometer are permanents of submatrices, and contrast them with fermionic determinants.
- State the Aaronson–Arkhipov hardness results for boson sampling, the conjectures they rest on, and how loss and distinguishability enable classical simulation.
Two photons, one beam splitter
Use creation operators: for the input modes and for the outputs. A lossless 50:50 beam splitter in the Hadamard convention maps and . One photon enters each input.
Transform each creation operator.
Expand.
Bosonic operators commute, , so the cross terms cancel; then .
The coincidence term is gone: both photons always leave together. In path language, "both transmitted" and "both reflected" lead to the same final state with amplitudes and , and for every lossless 50:50 splitter.
Decompose photon 's internal state (time, frequency, polarization) relative to photon 's.
The component along is indistinguishable and bunches perfectly. The orthogonal component behaves like a distinguishable particle: each photon picks an output independently, giving one per port with probability .
Scanning a time delay between the photons traces out the HOM dip: .
Two single photons have mode overlap . What is the coincidence probability at a 50:50 beam splitter, in percent?
Show the answer
5 %
. The dip's depth, compared with the of distinguishable photons, is the standard way to certify that a single-photon source emits indistinguishable photons.
A swap test made of light
The formula is exactly the failure probability of the swap test (Buhrman, Cleve, Watrous & de Wolf, 2001): an ancilla in controls a SWAP of two registers, then is measured in the basis. The beam splitter performs the same projection onto the symmetric and antisymmetric parts of the photons' internal state: only the antisymmetric part produces coincidences. (Garcia-Escartin and Chamorro-Posada, 2013, show the two are equivalent.)
The same mechanism powers linear-optics Bell measurements: of the four polarization Bell states only the antisymmetric gives coincidences behind a 50:50 splitter. Without ancilla photons, such a measurement can succeed at most half the time.
Two identical fermions (say, electrons in a quantum Hall beam splitter) enter the two input ports of a 50:50 beam splitter. What do you observe?
- They always leave together, like photons
- They always leave by different ports
- Each leaves randomly and independently
- They are reflected back into the inputs
Show the answer
B. They always leave by different ports
For fermions and , so the same expansion gives : one particle per port with certainty. The coincidence amplitude is a determinant, , instead of the permanent .
Many photons: permanents
Now let single photons enter the first of modes of a linear interferometer, a unitary acting as . Ask for the amplitude of a collision-free output pattern , one photon in each mode of .
Expand the product of transformed creation operators.
The terms reaching are the assignments of photons to the modes of . Bosonic operators commute, so all assignments add with the same sign. is the submatrix with rows and the first columns.
With photons in mode , row is repeated times and the normalization of contributes the factorials. For fermions the same computation produces .
| Particles | Probability of pattern | Classical cost |
|---|---|---|
| identical fermions | polynomial (Gaussian elimination); free fermions are classically simulable | |
| distinguishable | , entrywise | easy to sample (route each particle independently); nonnegative permanents have an FPRAS (Jerrum, Sinclair & Vigoda 2004) |
| identical bosons | #P-hard to compute in general; best exact methods (Ryser, Glynn) |
Boson sampling
The best classical exact sampler (Clifford & Clifford, 2018) runs in time , roughly the cost of computing a few permanents. Three-photon demonstrations appeared in 2013 from four groups. Gaussian boson sampling, which uses squeezed light and has hafnians in place of permanents (Hamilton et al., 2017), was scaled to experiments with tens of detected photons that claimed quantum advantage (Zhong et al., 2020; Madsen et al., 2022).
Imperfections push the problem back toward classical tractability. Partial distinguishability suppresses high-order interference terms geometrically, which allows efficient approximate simulation (Renema et al., 2018). When loss grows with system size, so that only about photons survive, efficient classical approximations exist as well (Oszmaniec & Brod, 2018). Each advantage claim has therefore been met by classical algorithms that exploit exactly these imperfections.
Key takeaways
- HOM: for identical photons the two coincidence paths cancel (), so : an indistinguishability ruler and a swap test.
- -photon amplitudes in an -mode interferometer are permanents ; fermions give determinants.
- Permanents are #P-hard (Valiant) while determinants are easy: same-sign interference over assignments is the source of hardness.
- Exact classical boson sampling would collapse PH; approximate hardness needs further conjectures, and loss and distinguishability open classical shortcuts.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
Two photons in identical pure modes enter the two ports of a lossless 50:50 beam splitter. What is the coincidence probability?
Show the answer
C.
The amplitudes for "both transmitted" and "both reflected" are and , and they cancel, so the output is .
The photons' mode overlap is . What is the coincidence probability?
Show the answer
B.
: half of the pair amplitude is indistinguishable and bunches, the other half splits like independent particles.
Why is a many-photon interferometer amplitude a permanent rather than a determinant?
- Because bosonic creation operators commute, so all assignments of photons to output modes add with the same sign
- Because photons are massless
- Because the interferometer is not unitary
- Because each photon interferes only with itself
Show the answer
A. Because bosonic creation operators commute, so all assignments of photons to output modes add with the same sign
Expanding and reordering commuting operators gives , the permanent. Anticommuting fermionic operators insert and give the determinant.
Which statement about boson sampling is a theorem rather than a conjecture?
- Approximate boson sampling to small total-variation distance is classically hard
- Estimating for Gaussian is #P-hard on average
- Gaussian boson sampling experiments cannot be simulated classically at any size
- Exact classical boson sampling in polynomial time would collapse the polynomial hierarchy
Show the answer
D. Exact classical boson sampling in polynomial time would collapse the polynomial hierarchy
Aaronson and Arkhipov prove the exact-sampling collapse. Approximate hardness rests on the Permanent-of-Gaussians and anticoncentration conjectures, and noisy experiments face classical algorithms that exploit loss and distinguishability.
Further reading
- C. K. Hong, Z. Y. Ou & L. Mandel, "Measurement of subpicosecond time intervals between two photons by interference", Phys. Rev. Lett. 59, 2044 (1987).
- L. G. Valiant, "The complexity of computing the permanent", Theor. Comput. Sci. 8, 189 (1979).
- S. Aaronson & A. Arkhipov, "The computational complexity of linear optics", Theory of Computing 9, 143 (2013); STOC 2011.
- P. Clifford & R. Clifford, "The classical complexity of boson sampling", Proc. ACM-SIAM SODA (2018).
- H.-S. Zhong et al., "Quantum computational advantage using photons", Science 370, 1460 (2020).