Theorem · T-KLPR22-THM2
Kent et al. 2022 · Theorem 2
P03 · npj Quantum Inf. 8, 28 (published 2022-03-11); equations transcribed from the article HTML TeX source
- Status
- VERIFIED FROM SOURCEField read in the primary source at the anchor given.
- Game
- S2
- Anchor
- Theorem 2, eq.(11), main text PDF p.7; proof Supplementary Note VIII
- Source file
- research/THEOREM_REGISTRY_SEED.yaml
Statement summary
For any integer M >= 1 there exist schemes QT1^M, QT2^M (2^M presentation points, Bob sends NM states) that, under constraints (2), (4), (7) with f > 0, have the parameters below.
Citations
Record
Every field of the source record, in file order.
- Proof obligationproof_obligation
- P-S2
- Gamegame
S2
- Source paper idsource_paper_id
- P03
- Source urlsource_url
https://doi.org/10.1038/s41534-022-00524-4
- Anchoranchor
Theorem 2, eq.(11), main text PDF p.7; proof Supplementary Note VIII
- Statusstatus
VERIFIED_FROM_SOURCE
- Bound latexbound_latex
rob: \epsilon^{M}_{\mathrm{rob}}=M\epsilon_{\mathrm{rob}} cor: \epsilon^{M}_{\mathrm{cor}}=M\epsilon_{\mathrm{cor}} priv: \epsilon^{M}_{\mathrm{priv}}=\frac{1}{2^{M}}\left[(1+2\epsilon_{\mathrm{priv}})^{M}-1\right] unf: \epsilon^{M}_{\mathrm{unf}}=C\epsilon_{\mathrm{unf}}- Variablesvariables
M: 2^M presentation points C: number of pairs of spacelike-separated presentation points (NOT an arbitrary factor)
- Verificationverification
statement_summary: VERIFIED_FROM_SOURCE bound_latex: VERIFIED_FROM_SOURCE