Foundations of Probability and Physics, Round table

What are Quantum Fluctuations? Round Table of the Third Conference on Quantum Theory: Reconsideration of Foundations

This is a transcript of the round table that took place during the conference Quantum Theory: Reconsideration of Foundations - 3, June 2005, Vaxjo, Sweden. There are presented opinions of leading experts in quantum foundations on such fundamental problems as the origin of quantum fluctuations and completeness of quantum mechanics.

Foundations of Probability and Physics-3: Preface of Proceedings and Round Table on Quantum Foundations and Computing

This preprint contains a detailed Preface to Proceedinngs of the International Conference ``Foundations of Probability and Physics-3'' held in Växjö, Sweden, 7-12 June 2004; table of contents and round table. The main theme of the round table was {\it ``Fundamental problems in quantum mechanics, probabilistic description of reality, and quantum information.''} The topics that were specifically discussed were that of Quantum Cryptography, Quantum computing, and Quantum Macroscopic Structures. For each of these topics, the participants were asked to discuss which are the crucial Quantum features…

Quantum Meet-in-the-Middle Attack on Feistel Construction

Inspired by Hosoyamada et al.'s work [14], we propose a new quantum meet-in-the-middle (QMITM) attack on $r$-round ($r \ge 7$) Feistel construction to reduce the time complexity. Similar to Hosoyamada et al.'s work, our attack on 7-round Feistel is also based on Guo et al.'s classical meet-in-the-middle (MITM) attack [13]. The classic MITM attack consumes a lot of time mainly in three aspects: construct the lookup table, query data and find a match. Therefore, parallel Grover search processors are used to reduce the time of constructing the lookup table. And we adjust the truncated differentia…

Probability tables

The idea of writing a table of probabilistic data for a quantum or classical system, and of decomposing this table in a compact way, leads to a shortcut for Hardy's formalism, and gives new perspectives on foundational issues.

制表者的量子搜索

The table maker's quantum search

提出用量子搜索计算初等函数舍入难度，即确定在给定区间内所有n位浮点输入下正确舍入到n位精度所需的最小工作精度，对指数相关函数时间复杂度为Õ(2^{n/2} log(1/δ))，在大区间周期函数上渐近加速，但双精度sin/cos所需量子比特相干时间过长。

通过Scramblons区分多轮时间反演动力学中的相干与非相干误差

Distinguishing Coherent and Incoherent Errors in Multi-Round Time-Reversed Dynamics via Scramblons

通过scramblon理论研究多轮时间反演动力学中相干与非相干误差的区分，验证了误差累积特性，为核磁共振系统中的误差校准提供理论依据。