Bosonic quantum computational complexity

DOI10.4230/LIPICS.ITCS.2025.33MaRDI QIDQ7296669zbMATH OpenFDO

Authors Ulysse Chabaud, Michael Joseph, Saeed Mehraban, Arsalan Motamedi

Publication date 14 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2025.33

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Eliminating intermediate measurements in space-bounded Quantum computation
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 19766 (Why is no real title available?)
• Inverting well conditioned matrices in quantum logspace
• MIP* = RE
• Multiplication, division, and shift instructions in parallel random access machines
• On the problem of quantum control in infinite dimensions
• Quantum algorithm for Hilbert's tenth problem
• Quantum computation and quantum information. 10th anniversary edition
• Quantum Computation over Continuous Variables
• Quantum computations: algorithms and error correction
• Semidefinite programming relaxations for semialgebraic problems
• Some NP-complete problems in quadratic and nonlinear programming
• The Bose-Hubbard model is QMA-complete
• The computational complexity of linear optics
• Three universal representations of recursively enumerable sets

This page was built for publication: Bosonic quantum computational complexity

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