Information-theoretic temporal Bell inequality and quantum computation
classification
🪐 quant-ph
keywords
inequalityquantumcomputationtemporalbellclassicalinformation-theoreticalgorithm
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.