Work

Quantum-Merlin-Arthur Problems Have Perfect Completeness with an Infinite Counter

Year: 2026

Type: article

Source: Physical Review Letters

DOI: 10.1103/pwdd-htbf

Authors: Stacey Jeffery, Freek Witteveen

Institutions: Centrum Wiskunde & Informatica, QuSoft, University of Amsterdam

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funders: European Commission, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, European Research Council

Awards: G5218813830, G6913368049

OpenAlex ID: W7148462499

FWCI:

Cites: 8

Cited by:

Related to: 10