18 citations · 35 across the 5 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
quant-ph2003
Quantum NP and a Quantum Hierarchy
Tomoyuki Yamakami
The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define "Quantum NP," the quantum analogue of NP…
quant-ph2003
Computational Complexity Measures of Multipartite Quantum Entanglement
Tomoyuki Yamakami
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar n…
quant-ph2003
Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
This paper introduces quantum ``multiple-Merlin''-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical mul…