On the classical complexity of sampling from quantum interference of indistinguishable bosons

DOI10.1142/S0219749920500446zbMath1461.81149arXiv1904.02013OpenAlexW3107299644MaRDI QIDQ4985083

Valery S. Shchesnovich

Publication date: 22 April 2021

Published in: International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityboson samplingmulti-photon interference

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum optics (81V80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12) Bosonic systems in quantum theory (81V73)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Classical Complexity of Boson Sampling
• Computing the permanent of (some) complex matrices
• The complexity of computing the permanent
• The permanent of a square matrix
• The Quantum Computer Puzzle
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• On Gospers formula for the Gamma function
• Two Algorithmic Results for the Traveling Salesman Problem
• Majorization and the time complexity of linear optical networks
• Probability Inequalities for Sums of Bounded Random Variables
• ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS
• Mathematical Foundations of Computer Science 2005

This page was built for publication: On the classical complexity of sampling from quantum interference of indistinguishable bosons