NIST · ИТ · 210a781a1387513773a5
BQP-completeness of Scattering in Scalar Quantum Field Theory
Recent work has shown that quantum computers can in polynomial time compute scattering probabilities in massive quantum field theories. One can translate this task into a corresponding formal problem in computational complexity theory. Here, we establish
NIST · ИТОфициальный источник · 2014-09-01
{
"title_en": "BQP-completeness of Scattering in Scalar Quantum Field Theory",
"designation": "",
"series": "",
"status": "",
"date": "2014-09-01",
"date_original": "September 1, 2014",
"url": "https://www.nist.gov/publications/bqp-completeness-scattering-scalar-quantum-field-theory",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Stephen P. Jordan , Keith S. Lee, John Preskill",
"abstract_excerpt_en": "Recent work has shown that quantum computers can in polynomial time compute scattering probabilities in massive quantum field theories. One can translate this task into a corresponding formal problem in computational complexity theory. Here, we establish",
"id": "210a781a1387513773a5",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "BQP-completeness of Scattering in Scalar Quantum Field Theory",
"designation": "",
"series": "",
"status": "",
"date": "2014-09-01",
"date_original": "September 1, 2014",
"url": "https://www.nist.gov/publications/bqp-completeness-scattering-scalar-quantum-field-theory",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Stephen P. Jordan , Keith S. Lee, John Preskill",
"abstract_excerpt_en": "Recent work has shown that quantum computers can in polynomial time compute scattering probabilities in massive quantum field theories. One can translate this task into a corresponding formal problem in computational complexity theory. Here, we establish"
}
],
"translation_state": "none"
}