Authorized quantum computation

Simple item page
dc.creatorTanaka, Yu
dc.creatorMurao, Mio
dc.date2009-03-12
dc.date.accessioned2026-07-07T12:51:50Z
dc.date.available2026-07-07T12:51:50Z
dc.descriptionWe present authorized quantum computation, where only a user with a non-cloneable quantum authorization key can perform a unitary operation created by an authenticated programmer. The security of our authorized quantum computation is based on the quantum computational complexity problem of forging the keys from an obfuscated quantum gate sequence. Under the assumption of the existence of a \textit{sufficiently-random gate shuffling algorithm}, the problem is shown to be in the NQP (Non-deterministic Quantum Polynomial)-hard class by reducing it to a NQP-Complete problem, the exact non-identity check problem. Therefore, our authorized quantum computation can be computationally secure against attacks using quantum computers.
dc.identifierhttps://arxiv.org/abs/0903.2088
dc.identifierhttp://arxiv.org/abs/0903.2088
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223116
dc.subjectQuantum Physics
dc.titleAuthorized quantum computation
dc.typetext

Files

Collections

arXiv