Pith. sign in

REVIEW 3 cited by

Efficient Verification of Pure Quantum States in the Adversarial Scenario

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1909.01900 v2 pith:CJJRIPWU submitted 2019-09-04 quant-ph math-phmath.MP

Efficient Verification of Pure Quantum States in the Adversarial Scenario

classification quant-ph math-phmath.MP
keywords scenarioquantumadversarialstatespureefficientverificationgeneral
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Efficient verification of pure quantum states in the adversarial scenario is crucial to many applications in quantum information processing, such as blind measurement-based quantum computation and quantum networks. However, little is known about this topic so far. Here we establish a general framework for verifying pure quantum states in the adversarial scenario and clarify the resource cost. Moreover, we propose a simple and general recipe to constructing efficient verification protocols for the adversarial scenario from protocols for the nonadversarial scenario. With this recipe, arbitrary pure states can be verified in the adversarial scenario with almost the same efficiency as in the nonadversarial scenario. Many important quantum states can be verified in the adversarial scenario using local projective measurements with unprecedented high efficiencies.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Verifying random matrix product states with autoregressive local measurements

    quant-ph 2026-04 unverdicted novelty 7.0

    An autoregressive sampler draws Pauli strings sequentially from computable conditionals to enable linear-cost fidelity estimation for random matrix product states, with a grouped commuting extension to lower variance.

  2. Device-Independent Self-Testing of the Three-Qubit CCZ Hypergraph State

    quant-ph 2026-07 accept novelty 6.0

    The CCZ hypergraph state and its Pauli measurements can be device-independently self-tested from twenty correlators, and also from maximal violation of a specially constructed Bell inequality.

  3. Efficient certification of intractable quantum states with few Pauli measurements

    quant-ph 2025-11 reject novelty 6.0

    The paper claims Clifford-enhanced product states can be certified with O(n^2/epsilon^2) Pauli measurements in the i.i.d. setting and polynomially many in the adversarial setting, but the central estimator is derived ...