Algorithms and Computation

DOI10.1007/b94771zbMath1205.68159arXivquant-ph/0306051OpenAlexW1769833081MaRDI QIDQ5191647

Keiji Matsumoto, Tomoyuki Yamakami, Hirotada Kobayashi

Publication date: 7 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (7)

Quantum de Finetti theorems under local measurements with applications ⋮ Weak multiplicativity for random quantum channels ⋮ Equality, Revisited ⋮ The SWITCH test for discriminating quantum evolutions ⋮ Unbounded-Error Classical and Quantum Communication Complexity ⋮ Faithful squashed entanglement ⋮ An application of quantum finite automata to interactive proof systems

This page was built for publication: Algorithms and Computation