Results 1 -
2 of
2
4,1)-quantum random access coding does not exist
- New J. Phys
"... Abstract. An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak, ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
Abstract. An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak,
c §
, 2008
"... This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are obviously equivalent to classical single-proof systems (i.e., usual Merlin-Arthur proof systems), it ..."
Abstract
- Add to MetaCart
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are obviously equivalent to classical single-proof systems (i.e., usual Merlin-Arthur proof systems), it is unclear whether or not quantum multi-proof systems collapse to quantum single-proof systems (i.e., usual quantum Merlin-Arthur proof systems). This paper presents a necessary and sufficient condition under which the number of quantum proofs is reducible to two. It is also proved that, in the case of perfect soundness, using multiple quantum proofs
