Temporal inequalities for sequential multi-time actions in quantum information processing
- 110 Downloads
A new kind of temporal inequalities are discussed, which apply to algorithmic processes, involving a finite memory processing unit. They are an alternative to the Leggett-Grag ones, as well as to the modified ones by Brukner et al. If one considers comparison of quantum and classical processes involving systems of finite memory (of the same capacity in both cases), the inequalities give a clear message why we can expect quantum speed-up. In a classical process one always has clearly defined values of possible measurements, or in terms of the information processing language, if we have a sequential computations of some function depending on data arriving at each step on an algorithm, the function always has a clearly defined value. In the quantum case only the final value, after the end of the algorithm, is defined. All intermediate values, in agreement with Bohr’s complementarity, cannot be ascribed a definite value.
Keywordstemporal inequalities quantum information
Unable to display preview. Download preview PDF.
References and notes
- 1.Č. Brukner, S. Taylor, S. Cheung, and V. Vedral, Quantum entanglement in time, arXiv: quant-ph/0402127, 2004Google Scholar
- 5.M. Żukowski, Quantum Speedup and Temporal Inequalities for Sequential Actions, in: Computable Universe, edited by H. Zenil, World Scientific/Imperial College, Singapore, London, 2012Google Scholar
- 13.J. Kofler, Quantum violation of macroscopic realism and the transition to classical physics, Ph. D. Thesis, arXiv: 0812.0238, 2008Google Scholar
- 15.J. Kofler, N. Buric, and Č. Brukner, Macroscopic realism and spatiotemporal continuity, arXiv: 0906.4465, 2009Google Scholar