Pith. sign in

REVIEW 1 cited by

Information-theoretic temporal Bell inequality and quantum computation

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 quant-ph/0602011 v3 pith:CSHWK5M5 submitted 2006-02-01 quant-ph

classification quant-ph
keywords inequalityquantumcomputationtemporalbellclassicalinformation-theoreticalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

An information-theoretic temporal Bell inequality is formulated to contrast classical and quantum computations. Any classical algorithm satisfies the inequality, while quantum ones can violate it. Therefore, the violation of the inequality is an immediate consequence of the quantumness in the computation. Furthermore, this approach suggests a notion of temporal nonlocality in quantum computation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Bounding Large-Scale Bell Inequalities

    quant-ph 2024-12 conditional novelty 6.0 of 10

    An L-BFGS-accelerated alternating projections method on the NPA dual gives quick, slightly loose upper bounds for large Bell inequalities.

Pith tools