scientific article

zbMath1187.81065arXivquant-ph/0106017MaRDI QIDQ3522362

No author found.

Publication date: 3 September 2008

Full work available at URL: https://arxiv.org/abs/quant-ph/0106017

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Related Items (8)

Unnamed Item ⋮ Collapse of the hierarchy of constant-depth exact quantum circuits ⋮ Optimal parallel quantum query algorithms ⋮ Power of uninitialized qubits in shallow quantum circuits ⋮ Unnamed Item ⋮ Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families ⋮ Parallelizing quantum circuits ⋮ Quantum neural networks

This page was built for publication: