Pith. sign in

REVIEW 1 cited by

Efficiently verifiable quantum advantage on near-term analog quantum simulators

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 2403.08195 v1 pith:MPL6A67N submitted 2024-03-13 quant-ph cs.CC

classification quant-phcs.CC
keywords quantumadvantageanaloglambdaexperimentalnear-termneedonly
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on single-step Feynman-Kitaev verification of an analog quantum simulation, in which the verifier need only run an $O(\lambda^2)$-time classical computation, and the prover need only prepare $O(1)$ samples of a history state and perform $O(\lambda^2)$ single-qubit measurements, for a security parameter $\lambda$. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. CoTasks: Chain-of-Thought based Video Instruction Tuning Tasks

    cs.CV 2025-07 reject novelty 4.0 of 10

    Adding ground-truth object localization, tracking, and relation annotations as context improves VideoLLM answers, but the models never generate these steps themselves in the experiments.

Pith tools