NIST · ИТ · e0fd4beb8a21f5d72140
QCMA with One-sided Error Equals QCMA with Two-sided Error
QCMA is the set of decision problems such that if the answer is yes, there exists a classical bitstring, or proof, that can be efficiently verified by a quantum computer. The verifier is allowed a small probability of rejecting a valid proof or accepting
NIST · ИТОфициальный источник · 2011-11-30
{
"title_en": "QCMA with One-sided Error Equals QCMA with Two-sided Error",
"designation": "",
"series": "",
"status": "",
"date": "2011-11-30",
"date_original": "November 30, 2011",
"url": "https://www.nist.gov/publications/qcma-one-sided-error-equals-qcma-two-sided-error",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Stephen P. Jordan , Daniel Nagaj",
"abstract_excerpt_en": "QCMA is the set of decision problems such that if the answer is yes, there exists a classical bitstring, or proof, that can be efficiently verified by a quantum computer. The verifier is allowed a small probability of rejecting a valid proof or accepting",
"id": "e0fd4beb8a21f5d72140",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "QCMA with One-sided Error Equals QCMA with Two-sided Error",
"designation": "",
"series": "",
"status": "",
"date": "2011-11-30",
"date_original": "November 30, 2011",
"url": "https://www.nist.gov/publications/qcma-one-sided-error-equals-qcma-two-sided-error",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Stephen P. Jordan , Daniel Nagaj",
"abstract_excerpt_en": "QCMA is the set of decision problems such that if the answer is yes, there exists a classical bitstring, or proof, that can be efficiently verified by a quantum computer. The verifier is allowed a small probability of rejecting a valid proof or accepting"
}
],
"translation_state": "none"
}