Permanents in linear optical networks
arXiv:quant-ph/0406127
Abstract
We develop an abstract look at linear optical networks from the viewpoint of combinatorics and permanents. In particular we show that calculation of matrix elements of unitarily transformed photonic multi-mode states is intimately linked to the computation of permanents. An implication of this remarkable fact is that all calculations that are based on evaluating matrix elements are generically computationally hard. Moreover, quantum mechanics provides simpler derivations of certain matrix analysis results which we exemplify by showing that the permanent of any unitary matrix takes its values across the unit disk in the complex plane.
6 pages, typeset using RevTeX
Cited by in corpus (33)
- Experimental boson sampling in arbitrary integrated photonic circuits
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Boson Sampling for Molecular Vibronic Spectra
- Experimental Scattershot Boson Sampling
- Multimode quantum interference of photons in multiport integrated devices
- Simulating quantum statistics with entangled photons: a continuous transition from bosons to fermions
- Interference of Identical Particles from Entanglement to Boson-Sampling
- Generalised Hong-Ou-Mandel Experiments with Bosons and Fermions
- A Linear-Optical Proof that the Permanent is #P-Hard
- Sufficient bound on the mode mismatch of single photons for scalability of the boson sampling computer
- Graph isomorphism and Gaussian boson sampling
- Totally Destructive Many-Particle Interference
- Fock State-enhanced Expressivity of Quantum Machine Learning Models
- Generalized concurrence in boson sampling
- Distinguishing noisy boson sampling from classical simulations
- Complete three photon Hong-Ou-Mandel interference at a three port device
- Linear optics only allows every possible quantum operation for one photon or one port
- The Computational Complexity of Linear Optics
- Certification of Boson Sampling Devices with Coarse-Grained Measurements
- A method to determine which quantum operations can be realized with linear optics with a constructive implementation recipe
- Photonic quantum data locking
- Analysis of optical loss thresholds in the fusion-based quantum computing architecture
- Gaussian boson sampling with partial distinguishability
- Efficiency limits for linear optical processing of single photons and single-rail qubits
- Efficient Computation of the Permanent of Block Factorizable Matrices
- Sampling and the complexity of nature
- QOptCraft: A Python package for the design and study of linear optical quantum systems
- Modular architecture of large-scale optical interferometers for sparsely populated input
- Physical Unclonable Functions with Boson Sampling
- From Quantum Optics to Quantum Technologies
- The Computational Power of Non-interacting Particles
- Quantum Pattern Recognition in Photonic Circuits
- Sum rules in multiphoton coincidence rates