Stefan Filipp, Karl Svozil
Bounds on quantum probabilities and expectation values are derived for experimental setups associated with Bell-type inequalities. In analogy to the classical bounds, the quantum limits are experimentally testable and therefore serve as criteria for the validity of quantum mechanics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The correct laws of thermodynamics, either classical or quantum without probabilities of statistical quantum mechanics are valid for all systems, large or small, including systems of one spin or one particle only. So no violations can occur in nanoscale electric circuits.
In Mod. Phys. Lett. A 9, 3119 (1994), one of us (R.D.S) investigated a formulation of quantum mechanics as a generalized measure theory. Quantum mechanics computes probabilities from the absolute squares of complex amplitudes, and the resulting interference violates the (Kolmogorov) sum rule expressing the additivity of probabilities of mutually exclusive events. However, there is a higher order sum rule that quantum mechanics does obey, involving the probabilities of three mutually exclusive possibilities. We could imagine a yet more general theory by assuming that it violates the next higher…
In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and its pinching. Concerning the error exponents, the upper bounds lead to a noncommutative analogue of the Hoeffding bound, which is identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. The upper bounds also provide a simple proof of the direct part of the quantum Stein's lemma.
Quantum Algorithms for Testing Hamiltonian Symmetry
本文提出量子算法测试哈密顿量相对于群的对称性，证明其与接受概率对应，并在量子计算机上验证了对称与非对称案例。
We prove that a quantum circuit together with measurement apparatuses and EPR sources can be fully verified without any reference to some other trusted set of quantum devices. Our main assumption is that the physical system we are working with consists of several identifiable sub-systems, on which we can apply some given gates locally. To achieve our goal we define the notions of simulation and equivalence. The concept of simulation refers to producing the correct probabilities when measuring physical systems. To enable the efficient testing of the composition of quantum operations, we introdu…
In this article, we propose a resolution to the paradox of apparent superluminal velocities for tunneling particles, by a careful treatment of temporal observables in quantum theory and through a precise application of the duality between particles and waves. To this end, we employ a new method for constructing probabilities associated to quantum time measurements that provides an explicit link between the tunneling time of particles and the associated quantum fields. We demonstrate that the idea of faster-than-light speeds in tunneling follows from an inadmissible use of classical reasoning i…
Recoverability of quantum channels via hypothesis testing
本文利用相对熵的新积分表示，通过假设检验中最优成功概率和 $L_1$ 距离的保持，给出了充分量子信道及其可恢复性的简易证明。
For two given bipartite-entangled pure states, an expression is obtained for the least upper bound of conversion probabilities using catalysis. The attainability of the upper bound can also be decided if that bound is less than one.
Although quantum key distribution is regarded as promising secure communication, security of Y00 protocol proposed by Yuen in 2000 for the affinity to conventional optical communication is not well-understood yet; its security has been evaluated only by the eavesdropper's error probabilities of detecting individual signals or masking size, the number of hidden signal levels under quantum and classical noise. Our study is the first challenge of evaluating the guessing probabilities on shared secret keys for pseudorandom number generators in a simplified Y00 communication system based on quantum…
Contextuality provides a unifying paradigm for nonclassical aspects of quantum probabilities and resources of quantum information. Unfortunately, most forms of quantum contextuality remain experimentally unexplored due to the difficulty of performing sequences of projective measurements on individual quantum systems. Here we show that two-point correlations between binary compatible observables are sufficient to reveal any form of contextuality. This allows us to design simple experiments that are more robust against imperfections and easier to analyze, thus opening the door for observing inte…
The Klyachko inequality is an inequality for the probabiities of the values of five observables of a spin-1 particle, which is satisfied by any noncontextual assignment of values to this set of observables, but is violated by the probabilities defined by a certain quantum state. We describe an experiment between two entangled spin-1 particles to test contextuality via a related inequality. We point out that a test of contextuality by measurements on a single particle to confirm the Klyachko inequality requires an assumption of non-disturbance by the measuring instrument, which is avoided in th…
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain speed-ups over the best known quantum algorithms for identity testing, equivalence testing and uniformity testing of probability distributions; (b) study the power of these oracles for testing properties of boolean functions, and obtain an algorithm for checking whether an $n$-input $m$-output boolean function is balanced or $ε$-far from balanced; and (c) give a sub-lin…
Beyond Hoeffding and Chernoff: Trading conclusiveness for advantages in quantum hypothesis testing
本研究通过允许不明确结果的概率，超越了传统量子假设检验中的误差指数限制，提供了更优的性能和更稳健的改进。
We investigate the properties of a discrete-time martingale $\{X_m\}_{m\in \mathbb Z_{\geq 0}}$, where all differences between adjacent random variables are limited to be not more than a constant as a promise. In this situation, it is known that the Azuma-Hoeffding inequality holds, which gives an upper bound of a probability for exceptional events. The inequality gives a simple form of the upper bound, and it has been utilized for many investigations. However, the inequality is not tight. We give an explicit expression of a tight upper bound, and we show that it and the bound obtained from th…
We develop some new analytic bounds on transmission probabilities (and the related reflection probabilities and Bogoliubov coefficients) for generic one-dimensional scattering problems. To do so we rewrite the Schrodinger equation for some complicated potential whose properties we are trying to investigate in terms of some simpler potential whose properties are assumed known, plus a (possibly large) "shift" in the potential. Doing so permits us to extract considerable useful information without having to exactly solve the full scattering problem.
We give an introductory account of the general boundary formulation of quantum theory. We refine its probability interpretation and emphasize a conceptual and historical perspective. We give motivations from quantum gravity and illustrate them with a scenario for describing gravitons in quantum gravity.
In this work, we study the tradeoffs between the error probabilities of classical-quantum channels and the blocklength $n$ when the transmission rates approach the channel capacity at a rate slower than $1/\sqrt{n}$, a research topic known as moderate deviation analysis. We show that the optimal error probability vanishes under this rate convergence. Our main technical contributions are a tight quantum sphere-packing bound, obtained via Chaganty and Sethuraman's concentration inequality in strong large deviation theory, and asymptotic expansions of error-exponent functions. Moderate deviation …
Postselected quantum hypothesis testing
本文研究允许弃权（不执行）的后选择量子假设检验，给出单次与渐近情形下最优错误概率的精确刻画，并证明渐近错误指数由希尔伯特投影度量和汤普森度量给出，同时将结果推广到复合假设检验、量子信道及一般概率理论。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。