Pith. sign in

REVIEW

New designs of linear optical interferometers with minimal depth and component count

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.06059 v1 pith:GRNRSFOU submitted 2025-04-08 quant-ph

classification quant-ph
keywords opticalalgorithminterferometerinterferometerslinearbosondesigndesigns
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We adapt an algorithm for CNOT circuits synthesis based on the Bruhat decomposition to the design of linear optical circuits with Mach-Zehnder interferometers (MZI). The synthesis algorithm reduces to designing sorting networks with nearest neighbor swapping operations as elementary gates. We recover previous designs from the literature but with additional theoretical properties regarding the compiler that implements unitaries on the interferometer. Notably the compiler can always decide whether a unitary can be implemented on a given interferometer and, if so, returns the shallowest possible implementation. We also show natural extensions of our framework for boson sampling experiments and for the coupling of multiple integrated interferometers to design larger linear optical systems. In both cases, the designs are optimal in terms of number of optical components. Finally, we propose a greedy design which exploits the arbritrary-but-fixed coupling of separate integrated interferometers to perform shallow boson sampling. We discuss the optimal interferometer dimensions to maximize the transmission. Beyond boson sampling, our developed framework allows a resource-favourable implemention of any non-adaptive linear optical quantum algorithm, by providing the shallowest possible interferometer for implementing this algorithm.

Discussion (0). Continue with ORCID to comment.

Pith tools