- Open Access
Quantum circuits for simulating linear interferometers
Phys. Rev. Research 8, 013190 – Published 20 February, 2026
DOI: https://doi.org/10.1103/z5l3-z2dr
Abstract
Motivated by recent proposals for quantum proof of work protocols, we investigate approaches for simulating linear optical interferometers using digital quantum circuits. We focus on a second quantization approach, where the quantum computer's registers represent optical modes. We can then use standard quantum optical techniques to decompose the unitary matrix describing an interferometer into an array of unitaries, which are subsequently synthesized into quantum circuits and stitched together to complete the circuit. For an -mode interferometer with identical photons, this method requires approximately qubits and a circuit depth of . We present a software package aquinas (a quantum interferometer assembler) that uses this approach to generate such quantum circuits. For reference, an arbitrary five-mode interferometer with two identical photons is compiled to a ten-qubit quantum circuit with a depth of 1972.
Physics Subject Headings (PhySH)
Article Text
References (25)
- P. Kok, W. J. Munro, K. Nemoto, T. C. Ralph, J. P. Dowling, and G. J. Milburn, Linear optical quantum computing with photonic qubits, Rev. Mod. Phys. 79, 135 (2007).
- S. Aaronson and A. Arkhipov, The computational complexity of linear optics, in Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC’11 (Association for Computing Machinery, New York, 2011), pp. 333–342.
- D. J. Brod, E. F. Galvão, A. Crespi, R. Osellame, N. Spagnolo, and F. Sciarrino, Photonic implementation of boson sampling: A review, Adv. Photonics 1, 034001 (2019).
- L. S. Madsen, F. Laudenbach, M. F. Askarani, F. Rortais, T. Vincent, J. F. F. Bulmer, F. M. Miatto, L. Neuhaus, L. G. Helt, M. J. Collins, A. E. Lita, T. Gerrits, S. W. Nam, V. D. Vaidya, M. Menotti, I. Dhand, Z. Vernon, N. Quesada, and J. Lavoie, Quantum computational advantage with a programmable photonic processor, Nature (London) 606, 75 (2022).
- J. M. Arrazola and T. R. Bromley, Using Gaussian boson sampling to find dense subgraphs, Phys. Rev. Lett. 121, 030503 (2018).
- K. Brádler, S. Friedland, J. Izaac, N. Killoran, and D. Su, Graph isomorphism and Gaussian boson sampling, Spec. Matrices 9, 166 (2021).
- D. Singh, G. Muraleedharan, B. Fu, C.-M. Cheng, N. R. Newton, P. P. Rohde, and G. K. Brennen, Proof-of-work consensus by quantum sampling, Quantum Sci. Technol. 10, 025020 (2025).
- N. Heurtel, S. Mansfield, J. Senellart, and B. Valiron, Strong simulation of linear optical processes, Comput. Phys. Commun. 291, 108848 (2023).
- S. Aaronson and D. J. Brod, BosonSampling with lost photons, Phys. Rev. A 93, 012335 (2016).
- M. Oszmaniec and D. J. Brod, Classical simulation of photonic linear optics with lost particles, New J. Phys. 20, 092002 (2018).
- A. E. Moylett, R. García-Patrón, J. J. Renema, and P. S. Turner, Classically simulating near-term partially-distinguishable and lossy boson sampling, Quantum Sci. Technol. 5, 015001 (2019).
- H. Leone, Aquinas, version 1.0, GitHub, https://github.com/FalafelGood/Aquinas, accessed 30 August 2024.
- S. Scheel and S. Y. Buhmann, Macroscopic quantum electrodynamics—concepts and applications, Acta Phys. Slovaca 58, 675 (2008).
- A. E. Moylett and P. S. Turner, Quantum simulation of partially distinguishable boson sampling, Phys. Rev. A 97, 062329 (2018).
- D. Bacon, I. L. Chuang, and A. W. Harrow, Efficient quantum circuits for Schur and Clebsch-Gordan transforms, Phys. Rev. Lett. 97, 170502 (2006).
- N. P. D. Sawaya, T. Menke, T. H. Kyaw, S. Johri, A. Aspuru-Guzik, and G. G. Guerreschi, Resource-efficient digital quantum simulation of -level systems for photonic, vibrational, and spin- Hamiltonians, npj Quantum Inf. 6, 49 (2020).
- W. R. Clements, P. C. Humphreys, B. J. Metcalf, W. S. Kolthammer, and I. A. Walmsley, Optimal design for universal multiport interferometers, Optica 3, 1460 (2016).
- The reason this unitary was chosen is that it can be expressed as a time-independent Hamiltonian. It is worth noting though that the Clements unitary given in Eq. ( (7) can be written as a product of time-independent Hamiltonians [see Eq. (4.13) in Ref. [25]]. This is needlessly complex for the sake of our example, which is why we use the Eq. ( (8) unitary instead.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, England, 2012), 10th anniversary ed.
- A. Hurwitz, Uber die Erzeugung der Invarianten durch Integration, Nachr. Ges. Wiss. Göttingen, Math.-Phys. Kl. 1897, 71 (1897).
- M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, Experimental realization of any discrete unitary operator, Phys. Rev. Lett. 73, 58 (1994).
- A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta, Quantum computing with Qiskit, arXiv:2405.08810.
- D. W. Berry, M. Kieferová, A. Scherer, Y. R. Sanders, G. H. Low, N. Wiebe, C. Gidney, and R. Babbush, Improved techniques for preparing eigenstates of fermionic Hamiltonians, npj Quantum Inf. 4, 22 (2018).
- M. Krishnan Vijayan, A. Paler, J. Gavriel, C. R. Myers, P. P. Rohde, and S. J. Devitt, Compilation of algorithm-specific graph states for quantum circuits, Quantum Sci. Technol. 9, 025005 (2024).
- I. Arrazola, Design of light-matter interactions for quantum technologies, Ph.D. thesis, University of the Basque Country, Leioa, 2020.