On the classical complexity of sampling from quantum interference of indistinguishable bosons
type: Item
instance of: scholarly article
title: On the classical complexity of sampling from quantum interference of indistinguishable bosons
zbMATH Open document ID: 1461.81149
DOI: 10.1142/S0219749920500446
published in: International Journal of Quantum Information
publication date: 2021-04-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1904.02013
Mathematics Subject Classification ID: 81V73
Mathematics Subject Classification ID: 81V80
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 68Q12
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 7336392
zbMATH Keywords: boson sampling
zbMATH Keywords: multi-photon interference
zbMATH Keywords: computational complexity
author: V. S. Shchesnovich
MaRDI profile type: MaRDI publication profile
arXiv ID: 1904.02013
cites work: Q3191572
cites work: The complexity of computing the permanent
cites work: Q3851094
cites work: The permanent of a square matrix
cites work: Mathematical Foundations of Computer Science 2005
cites work: Computing the permanent of (some) complex matrices
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: Q4847941
cites work: The Quantum Computer Puzzle
cites work: The Classical Complexity of Boson Sampling
cites work: ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS
cites work: Two Algorithmic Results for the Traveling Salesman Problem
cites work: Q4184984
cites work: Majorization and the time complexity of linear optical networks
cites work: On Gospers formula for the Gamma function
cites work: Probability Inequalities for Sums of Bounded Random Variables
OpenAlex ID: W3107299644
description: scientific article; zbMATH DE number 7336392