scientific article

zbMath1234.81056arXiv0705.1180MaRDI QIDQ3172430

Dominik Janzing, Paweł Wocjan

Publication date: 5 October 2011

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

promiseBQPpromiseBQP-complete problems

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Complexity classes of equivalence problems revisited

This page was built for publication: