Quantum computational complexity with photons and linear optics

DOI10.1007/978-3-031-17523-7_6MaRDI QIDQ6547618zbMATH OpenFDO

Authors Jian-Wei Pan

Publication date 30 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-17523-7_6

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68) Quantum optics (81V80)

Recommendations

• Complexity and control in quantum photonics
• Quantum advantage with shallow circuits
• Boson sampling with non-identical single photons
• The road to quantum computational supremacy
• The computational complexity of linear optics

Cites work

• Complexity-theoretic foundations of quantum supremacy experiments
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• On quantum field theory — I: explicit solution of Dyson’s equation in electrodynamics without use of feynman graphs
• The complexity of computing the permanent
• The computational complexity of linear optics

This page was built for publication: Quantum computational complexity with photons and linear optics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547618)