Quantum simulation of partially distinguishable boson sampling
arXiv:1803.03657 · doi:10.1103/PhysRevA.97.062329
Abstract
Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational complexity conjectures, in general the problem is difficult to solve classically, motivating optical experiments aimed at demonstrating quantum computational "supremacy". There are a number of challenges faced by such experiments, including the generation of indistinguishable single photons. We provide a quantum circuit that simulates bosonic sampling with arbitrarily distinguishable particles. This makes clear how distinguishabililty leads to decoherence in the standard quantum circuit model, allowing insight to be gained. At the heart of the circuit is the quantum Schur transform, which follows from a representation theoretic approach to the physics of distinguishable particles in first quantisation. The techniques are quite general and have application beyond boson sampling.
arXiv comment25 pages, 4 figures, 2 algorithms, comments welcome
References in corpus (41)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithm for solving linear systems of equations
- Efficient classical simulation of slightly entangled quantum computations
- Characterizing Quantum Supremacy in Near-Term Devices
- Universal Linear Optics
- Boson Sampling on a Photonic Chip
- Quantum Computational Supremacy
- Experimental Boson Sampling
- Experimental boson sampling in arbitrary integrated photonic circuits
- Photonic Boson Sampling in a Tunable Circuit
- Separability of very noisy mixed states and implications for NMR quantum computing
- Efficient experimental validation of photonic boson sampling against the uniform distribution
- On the role of entanglement and correlations in mixed-state quantum computation
- A Universal Two--Bit Gate for Quantum Computation
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Optimal entanglement criterion for mixed quantum states
- No imminent quantum supremacy by boson sampling
- How robust is a quantum gate in the presence of noise?
- Distinguishability and many-particle interference
- Sampling of partially distinguishable bosons and the relation to the multidimensional permanent
- Efficient algorithm for boson sampling with partially distinguishable photons
- Generalized multi-photon quantum interference
- Partial indistinguishability theory for multi-photon experiments in multiport devices
- The generalized partial transposition criterion for separability of multipartite quantum states
- On the hardness of classically simulating the one clean qubit model
- A numerical algorithm for the explicit calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients
- Dual pairing of symmetry groups and dynamical groups in physics
- Error tolerance of the BosonSampling model for linear optics quantum computing
- Experimental statistical signature of many-body quantum interference
- BosonSampling with Lost Photons
- Sufficient bound on the mode mismatch of single photons for scalability of the boson sampling computer
- Applications of coherent classical communication and the Schur transform to quantum information theory
- Representations of the Weyl group and Wigner functions for SU(3)
- Impossibility of Classically Simulating One-Clean-Qubit Computation
- Classical simulatability, entanglement breaking, and quantum computation thresholds
- Qudit Entanglement
- Boson-sampling with photons of arbitrary spectral structure
- Symmetries and entanglement features of inner-mode resolved correlations of interfering nonidentical photons
- Quantum Schur Sampling Circuits can be Strongly Simulated
- The complexity of the fermionant, and immanants of constant width
- Classical simulatability of the one clean qubit model
Cited by in corpus (16)
- Classical simulation of photonic linear optics with lost particles
- Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
- Classical simulation of linear optics subject to nonuniform losses
- Interfering distinguishable photons
- Noise in BosonSampling and the threshold of efficient classical simulatability
- Classically simulating near-term partially-distinguishable and lossy boson sampling
- Quantum machine learning with adaptive linear optics
- Discriminating distinguishability
- Signatures of Many-Particle Interference
- Proof-of-work consensus by quantum sampling
- Many-body interference in bosonic dynamics
- Distinguishability in quantum interference with the squeezed states
- A Classical Algorithm for Quantum Schur Sampling
- Quantum advantage from energy measurements of many-body quantum systems
- Realistic photon-number resolution in generalized Hong-Ou-Mandel experiment
- Distinguishability theory for time-resolved photodetection and boson sampling