Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
We define a general formulation of quantum PCPs, which captures adaptivity and multiple unentangled provers, and give a detailed construction of the quantum reduction to a local Hamiltonian with a constant promise gap. The reduction turns out to be a versatile subroutine to prove properties of quant...
Saved in:
| Main Authors: | Harry Buhrman, Jonas Helsen, Jordi Weggemans |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2025-07-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2025-07-11-1791/pdf/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
PCPS – an R-package for exploring phylogenetic eigenvectors across metacommunities
by: Vanderlei Julio Debastiani, et al.
Published: (2014-09-01) -
Reinforcement Learning for Guiding the E Theorem Prover
by: Jack McKeown, et al.
Published: (2023-05-01) -
«Jeg prøver å fremstå så mandig som jeg kan»
by: Henning Kaiser Klatran
Published: (2019-01-01) -
Variational quantum Hamiltonian engineering
by: Benchi Zhao, et al.
Published: (2025-05-01) -
Robustly learning the Hamiltonian dynamics of a superconducting quantum processor
by: Dominik Hangleiter, et al.
Published: (2024-11-01)