Equivalence of a Bit Pixel Image to a Quantum Pixel Image

We propose a new method to transform a pixel image to the corresponding quantum-pixel using a qubit per pixel to represent each pixels classical weight in a quantum image matrix weight. All qubits are linear superposition, changing the coefficients level by level to the entire longitude of the gray scale with respect to the base states of the qubit. Classically, these states are just bytes represented in a binary matrix, having code combinations of 1 or 0 at all pixel locations. This method introduces a qubit-pixel image representation of images captured by classical optoelectronic methods.     

The Quantum Bit Commitment Theorem

Unconditionally secure two-party bit commitment based solely on the principles of quantum mechanics (without exploiting special relativistic signalling constraints, or principles of general relativity or thermodynamics) has been shown to be impossible, but the claim is repeatedly challenged. The quantum bit commitment theorem is reviewed here and the central conceptual point, that an Einstein–Podolsky–Rosen attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative. There is, indeed, no loophole in the theorem.     

量子密码通信中量子比特率理论分析

在量子密钥分配中,量子比特率是一个重要的系统参数。通过引入测量因子和筛选因子,建立了基于理想单光子源和泊松分布单光子源的量子比特率理论模型,给出了量子比特率的表达式,并对两种单光子源进行了比较分析。结果表明,当平均光子数大于1时,泊松分布单光子源能被优化。在发射机脉冲重复率一定的条件下,采用泊松分布单光子源无法达到理想单光子源的量子比特率,这是为保密通信所必须付出的代价。     

量子态的等价类与量子逻辑门

在量子力学中,态的演化是一个幺正演化过程,态的演化过程可以用演化算子对态的作用来表示,幺正演化过程是时间可逆的.基于这一基本事实,Gerard't Hoofl引进了量子态的等价类概念,并用两组等价类之间的变换来描述量子态的幺正演化.本文利用等价类的概念及其变换来探究构建量子信息论中常用的通用量子门,给出通用量子门的推广形式.最后说明这些通用量子门可以基于双qubit体系内在的相互作用Hamilton量得以实现.     

Theoretical Study of Quantum Bit Rate in Free-Space Quantum Cryptography

The quantum bit rate is an important operating parameter in free-space quantum key distribution. We introduce the measuring factor and the sifting factor, and present the expressions of the quantum bit rate based on the ideal single-photon sources and the single-photon sources with Poisson distribution. The quantum bit rate is studied in the numerical simulation for the laser links between a ground station and a satellite in a low earth orbit. The results show that it is feasible to implement quantum key distribution between a ground station and a satellite in a low earth orbit.     

Quantum Bit Commitment and the Reality of the Quantum State

Quantum bit commitment is insecure in the standard non-relativistic quantum cryptographic framework, essentially because Alice can exploit quantum steering to defer making her commitment. Two assumptions in this framework are that: (a) Alice knows the ensembles of evidence E corresponding to either commitment; and (b) system E is quantum rather than classical. Here, we show how relaxing assumption (a) or (b) can render her malicious steering operation indeterminable or inexistent, respectively. Finally, we present a secure protocol that relaxes both assumptions in a quantum teleportation setting. Without appeal to an ontological framework, we argue that the protocol’s security entails the reality of the quantum state, provided retrocausality is excluded.     

量子环中量子比特内的电子概率密度分布

通过较精确地求解能量本征方程获得量子环中量子比特内的电子概率密度分布。对InAs量子环的数值计算表明:电子概率密度分布与电子的坐标(半径、高度,角度)及时间有关。当其中三个变量给定时,电子概率密度随另一个变量的变化规律分别为:随半径的增大做非周期性振荡;随高度的变化而变化,在半高处出现的概率最大;随角度作周期变化,在角度等于π处出现的概率最大;随时间作周期性振荡。     

Equivalence Postulate and Quantum Origin of Gravitation

We suggest that quantum mechanics and gravity are intimately related. In particular, we investigate the quantum Hamilton–Jacobi equation in the case of two free particles and show that the quantum potential, which is attractive, may generate the gravitational potential. The investigation, related to the formulation of quantum mechanics based on the equivalence postulate, is based on the analysis of the reduced action. A consequence of this approach is that the quantum potential is always non-trivial even in the case of the free particle. It plays the role of intrinsic energy and may in fact be at the origin of fundamental interactions. We pursue this idea, by making a preliminary investigation of whether there exists a set of solutions for which the quantum potential can be expressed with a gravitational potential leading term which alone would remain in the limit 0. A number of questions are raised for further investigation.     

Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm

We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of L gates we can construct a quantum adiabatic algorithm with time complexity of O(L). Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path.     

Quantum Image Encryption Based on Quantum Image Decomposition

Aiming at the slow processing speed of classic image encryption algorithms and the security analysis of existing quantum image encryption algorithms, this paper combines the representation method of quantum images and proposes a quantum image encryption algorithm based on image correlation decomposition. Using the principle of quantum state superposition and measurement, the association between image pixels is established, the image is decomposed into a series of feature sub-images and stored in a complete binary tree set, and different sub-images are operated and encrypted by random phase operation and quantum rotation operation. Then superimpose all the sub-images to obtain the ciphertext image. The algorithm has a larger key space so that it can resist brute force attacks. At the same time, the quantum encryption algorithm has lower computational complexity than classic encryption algorithms. In addition, because the ciphertext image is transmitted in the communication channel in the form of a quantum state, the security of quantum image encryption also surpasses the security of classical image encryption.

     

Equivalence of Additivity Questions in Quantum Information Theory

We reduce the number of open additivity problems in quantum information theory by showing that four of them are equivalent. Namely, we show that the conjectures of additivity of the minimum output entropy of a quantum channel, additivity of the Holevo expression for the classical capacity of a quantum channel, additivity of the entanglement of formation, and strong superadditivity of the entanglement of formation, are either all true or all false.An erratum to this article can be found at     

Pseudo-invariant Eigen-Operator for Deriving Energy-Level Gap for Quantum Bit in Quantum Circuit

Based on the method of pseudo invariant eigenoperator (PIEO), a fully quantum mechanical scheme is investigated for the coupling between a rf SQUID qubit and an off-resonance quantized single-mode electromagnetic field in the strong coupling regime. In order to derive the systematic energy-level gap obtained by the pseudo-invariant operator of the quantum system, we give operation props for corresponding quantum manipulation. In comparison with the solution of stationary Schrödinger equation, the PIEO method could be quite concise and effective to obtain energy-level gap for the given system.     

Quantum Image Location

Quantum image processing has been a hot topic as a consequence of the development of quantum computation. Many quantum image processing algorithms have been proposed, whose efficiency are theoretically higher than their corresponding classical algorithms. However, most of the quantum schemes do not consider the problem of measurement. If users want to get the results, they must measure the final state many times to get all the pixels’ values. Moreover, executing the algorithm one time, users can only measure the final state one time. In order to measure it many times, users must execute the algorithms many times. If the measurement process is taken into account, whether or not the algorithms are really efficient needs to be reconsidered. In this paper, we try to solve the problem of measurement and give a quantum image location algorithm. This scheme modifies the probability of pixels to make the target pixel to be measured with higher probability. Furthermore, it only has linear complexity.     

Quantum Image Encryption Algorithm Based on Quantum Image XOR Operations

A novel encryption algorithm for quantum images based on quantum image XOR operations is designed. The quantum image XOR operations are designed by using the hyper-chaotic sequences generated with the Chen’s hyper-chaotic system to control the control-NOT operation, which is used to encode gray-level information. The initial conditions of the Chen’s hyper-chaotic system are the keys, which guarantee the security of the proposed quantum image encryption algorithm. Numerical simulations and theoretical analyses demonstrate that the proposed quantum image encryption algorithm has larger key space, higher key sensitivity, stronger resistance of statistical analysis and lower computational complexity than its classical counterparts.     

Testing the Equivalence Principle in the Quantum Regime

We consider possible tests of the Einstein Equivalence Principle for physical systems in which quantum-mechanical vacuum energies cannot be neglected. Specific tests include a search for the manifestation of non-metric effects in Lamb-shift transitions of hydrogenic atoms and in anomalous magnetic moments of massive leptons. We discuss how current experiments already set bounds on the violation of the equivalence principle in this sector and how new (high-precision) measurements of these quantities could provide further information to this end.