The Classical Complexity of Boson Sampling

DOI10.48550/arXiv.1706.01260zbMath1402.68065arXiv1706.01260MaRDI QIDQ126355

Raphaël Clifford, Peter Clifford, Raphaël Clifford, Peter Clifford

Publication date: 5 June 2017

Full work available at URL: https://arxiv.org/abs/1706.01260

Mathematics Subject Classification ID

Nuclear physics (81V35) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (10)

Efficient computation of permanents, with applications to boson sampling and random matrices ⋮ Classical benchmarking of Gaussian boson sampling on the Titan supercomputer ⋮ Models in quantum computing: a systematic review ⋮ Implementation of photon partial distinguishability in a quantum optical circuit simulation ⋮ Strong simulation of linear optical processes ⋮ BosonSampling ⋮ On the classical complexity of sampling from quantum interference of indistinguishable bosons ⋮ A quantum hash function with grouped coarse-grained boson sampling ⋮ Cryptographic one-way function based on boson sampling ⋮ Unitary matrix decompositions for optimal and modular linear optics architectures

This page was built for publication: The Classical Complexity of Boson Sampling