Large Time Behavior and Convergence Rate for Quantum Filters Under Standard Non Demolition Conditions

A quantum system \({\mathcal S}\) undergoing continuous time measurement is usually described by a jump-diffusion stochastic differential equation. Such an equation is called a quantum filtering equation (or quantum stochastic master equation) and its solution is called a quantum filter (or quantum trajectory). This solution describes the evolution of the state of \({\mathcal S}\) . In the context of quantum non demolition measurement, we investigate the large time behavior of this solution. It is rigorously shown that, for large time, this solution behaves as if a direct Von Neumann measurement has been performed at time 0. In particular the solution converges to a random pure state which can be directly linked to the wave packet reduction postulate. Using the theory of Girsanov transformation, we obtain the explicit rate of convergence towards this random state. The problem of state estimation (used in experiment) is also investigated.     

Quantum Adder for Superposition States

Quantum superposition is one of the essential features that make quantum computation surpass classical computation in space complexity and time complexity. However, it is a double-edged sword. For example, it is troublesome to add all the numbers stored in a superposition state. The usual solution is taking out and adding the numbers one by one. If there are \(2^{n}\) numbers, the complexity of this scheme is \(O(2^{n})\) which is the same as the complexity of the classical scheme \(O(2^{n})\). Moreover, taking account to the current physical computing speed, quantum computers will have no advantage. In order to solve this problem, a new method for summing all numbers in a quantum superposition state is proposed in this paper, whose main idea is that circularly shifting the superposition state and summing the new one with the original superposition state. Our scheme can effectively reduce the time complexity to \(O(n)\).     

Bidirectional Controlled Teleportation by Using 5-Qubit States: A Generalized View

Recently bidirectional controlled perfect teleportation using 5-qubit states are reported in Int. J. Theor. Phys. (2013), doi:10.1007/s10773-013-1484-8 and ibid (2012), doi:10.1007/s10773-012-1208-5. In this paper we have shown that there exists a class of 5-qubit quantum states that can be used for bidirectional controlled teleportation. Two out of the three reported cases are the special cases of the proposed class of 5-qubit quantum states and one of them is not strictly a case of controlled bidirectional quantum teleportation. Further, we have shown that one can in principle, construct infinitely many 5-qubit quantum states for this purpose. We have also shown that the idea can be extended to bidirectional controlled probabilistic teleportation. Some potential applications of the proposed scheme and its modified versions are also discussed in relation with the implementation of quantum remote control and quantum cryptography.     

Quantum Image Encryption Algorithm Based on NASS

This paper proposes a quantum image encryption algorithm based on n-qubit normal arbitrary superposition state (NASS) by using the basic scheme of quantum transformation and random phase transformation. According to theoretical analysis and experimental simulation on MATLAB system, we find that key space is an important factor of encryption and decryption algorithm. When the secret key space is large, it is difficult for the attacker to crack the encrypted information. Based on this finding, we perform 2ⁿ +?4 times phase transformation in the encryption process. And each transformation is random, which increases the difficulty of decryption. So there are a total of 2ⁿ +?4 randomly transformed keys. In this paper, we design the implementation circuit of random phase transformation, and because the real quantum computer is not in our grasp, now we use MATLAB software to simulate grayscale image and color image encryption algorithm in classic computer, respectively. And the histogram, complexity and correlation are analyzed. Study shows that the proposed encryption algorithm is valid.     

Implementation of the quantum order-finding algorithm on two qudits

A quantum circuit has been proposed for the algorithm for finding the permutation order on two qudits with the number of levels d ₁ and d ₂. The sequence of the RF pulses for implementing the algorithm on two quadrupole nuclei I ₁ = 7/2 (d ₁ = 8) and I ₂ = 3/2 (d ₂ = 4) has been calculated and the algorithm has been numerically simulated. A method for preparing pseudopure states has been presented. A comparison with the implementation of the algorithm by NMR methods on five qubits has been performed.     

Quantum Cryptography,Quantum Communication,and Quantum Computer in a Noisy Environment

First, we study several information theories based on quantum computing in a desirable noiseless situation. (1) We present quantum key distribution based on Deutsch’s algorithm using an entangled state. (2) We discuss the fact that the Bernstein-Vazirani algorithm can be used for quantum communication including an error correction. Finally, we discuss the main result. We study the Bernstein-Vazirani algorithm in a noisy environment. The original algorithm determines a noiseless function. Here we consider the case that the function has an environmental noise. We introduce a noise term into the function f(x). So we have another noisy function g(x). The relation between them is g(x) = f(x) ± O(??). Here O(??) ? 1 is the noise term. The goal is to determine the noisy function g(x) with a success probability. The algorithm overcomes classical counterpart by a factor of N in a noisy environment.     

Creating Very True Quantum Algorithms for Quantum Energy Based Computing

An interpretation of quantum mechanics is discussed. It is assumed that quantum is energy. An algorithm by means of the energy interpretation is discussed. An algorithm, based on the energy interpretation, for fast determining a homogeneous linear function f(x) := s.x = s ₁ x ₁ + s ₂ x ₂ + ? + s _N x _N is proposed. Here x = (x ₁, … , x _N ), x _j ∈ R and the coefficients s = (s ₁, … , s _N ), s _j ∈ N. Given the interpolation values \((f(1), f(2),...,f(N))=\vec {y}\), the unknown coefficients \(s = (s_{1}(\vec {y}),\dots , s_{N}(\vec {y}))\) of the linear function shall be determined, simultaneously. The speed of determining the values is shown to outperform the classical case by a factor of N. Our method is based on the generalized Bernstein-Vazirani algorithm to qudit systems. Next, by using M parallel quantum systems, M homogeneous linear functions are determined, simultaneously. The speed of obtaining the set of M homogeneous linear functions is shown to outperform the classical case by a factor of N × M.     

Quantum Image Encryption Based on Iterative Framework of Frequency-Spatial Domain Transforms

A novel quantum image encryption and decryption algorithm based on iteration framework of frequency-spatial domain transforms is proposed. In this paper, the images are represented in the flexible representation for quantum images (FRQI). Previous quantum image encryption algorithms are realized by spatial domain transform to scramble the position information of original images and frequency domain transform to encode the color information of images. But there are some problems such as the periodicity of spatial domain transform, which will make it easy to recover the original images. Hence, we present the iterative framework of frequency-spatial domain transforms. Based on the iterative framework, the novel encryption algorithm uses Fibonacci transform and geometric transform for many times to scramble the position information of the original images and double random-phase encoding to encode the color information of the images. The encryption keys include the iterative time t of the Fibonacci transform, the iterative time l of the geometric transform, the geometric transform matrix G i which is n × n matrix, the classical binary sequences K (\(k_{0}k_{1}{\ldots } k_{2^{2n}-1}\)) and \(D(d_{0}d_{1}{\ldots } d_{2^{2n}-1}\)). Here the key space of Fibonacci transform and geometric transform are both estimated to be 2²⁶. The key space of binary sequences is (2 ^n×n ) × (2 ^n×n ). Then the key space of the entire algorithm is about \(2^{2{n^{2}}+52}\). Since all quantum operations are invertible, the quantum image decryption algorithm is the inverse of the encryption algorithm. The results of numerical simulation and analysis indicate that the proposed algorithm has high security and high sensitivity.     

Interferometric Computation Beyond Quantum Theory

There are quantum solutions for computational problems that make use of interference at some stage in the algorithm. These stages can be mapped into the physical setting of a single particle travelling through a many-armed interferometer. There has been recent foundational interest in theories beyond quantum theory. Here, we present a generalized formulation of computation in the context of a many-armed interferometer, and explore how theories can differ from quantum theory and still perform distributed calculations in this set-up. We shall see that quaternionic quantum theory proves a suitable candidate, whereas box-world does not. We also find that a classical hidden variable model first presented by Spekkens (Phys Rev A 75(3): 32100, 2007) can also be used for this type of computation due to the epistemic restriction placed on the hidden variable.     

New insights into quantum and classical correlations in XY spin models

We compute quantum dissonance Q (non-entangled quantum correlation), entanglement E, quantum discord D (total quantum correlation) and classical correlation C for spin pairs at any distance in the infinite XY spin-1/2 chains, i.e., the anisotropic XY model and the isotropic XY model with three-spin interactions. We obtain two simple dominance relations: C ≥ E and D ≥ E + Q Except this, there are no other simple ordering relations between them. We also show that Q can detect the special points of the system where the entanglement just appears or completely disappears. In addition, it is worthwhile to mention that dissonance and classical correlation can also clearly spotlight the critical points of quantum phase transitions in XY spin-1/2 chains.     

Large Violation of Bell Inequalities with Low Entanglement

In this paper we obtain violations of general bipartite Bell inequalities of order \({\frac{\sqrt{n}}{\log n}}\) with n inputs, n outputs and n-dimensional Hilbert spaces. Moreover, we construct explicitly, up to a random choice of signs, all the elements involved in such violations: the coefficients of the Bell inequalities, POVMs measurements and quantum states. Analyzing this construction we find that, even though entanglement is necessary to obtain violation of Bell inequalities, the entropy of entanglement of the underlying state is essentially irrelevant in obtaining large violation. We also indicate why the maximally entangled state is a rather poor candidate in producing large violations with arbitrary coefficients. However, we also show that for Bell inequalities with positive coefficients (in particular, games) the maximally entangled state achieves the largest violation up to a logarithmic factor.     

Elliptic quantum group , Hopf algebroid structure and elliptic hypergeometric series

We propose a new realization of the elliptic quantum group equipped with the H-Hopf algebroid structure on the basis of the elliptic algebra . The algebra has a constructive definition in terms of the Drinfeld generators of the quantum affine algebra and a Heisenberg algebra. This yields a systematic construction of both finite- and infinite-dimensional dynamical representations and their parallel structures to . In particular we give a classification theorem of the finite-dimensional irreducible pseudo-highest weight representations stated in terms of an elliptic analogue of the Drinfeld polynomials. We also investigate a structure of the tensor product of two evaluation representations and derive an elliptic analogue of the Clebsch–Gordan coefficients. We show that it is expressed by using the very-well-poised balanced elliptic hypergeometric series .     

Efficient Quantum Algorithm for the Parity Problem of a Certain Function

Based on a particular mathematical structure of a certain function f(x) under our attention, we present a novel quantum algorithm. The algorithm allows one to determine the property of a certain function. In our study, it is f(x) = f(?x). Therefore, there would be a question here, “How fast can we succeed in this?” All we need to do is only the evaluation of a single quantum state \(|\overbrace {0,0,\ldots ,0,1}^{N}\rangle \) (N ≥?2). Only using that with a little amount of information, we can derive the global property f(x) = f(?x). Our quantum algorithm overcomes a classical counterpart by a factor of the order of 2^N.     

On the Chirality Quantum Phase Transition of the Dirac Oscillator

Dirac oscillator subjects to an external magnetic field is re-examined. We show that this model can be mapped onto different quantum optics models if one insists to introduce two kinds of phonons which associate with the excitations of Dirac oscillator and magnetic field respectively. The conclusion about chirality quantum phase transition in the paper “Chirality quantum phase transition in the Dirac oscillator” (Bermudez et al. Phys. Rev. A, 77, 063815 2008) is only valid for a specific mapped quantum optics models rather than the Dirac oscillator itself. Thus, the conclusions about chirality quantum phase transitions in this paper are not universal.     

Physics Without Physics

David Finkelstein was very fond of the new information-theoretic paradigm of physics advocated by John Archibald Wheeler and Richard Feynman. Only recently, however, the paradigm has concretely shown its full power, with the derivation of quantum theory (Chiribella et al., Phys. Rev. A 84:012311, 2011; D’Ariano et al., 2017) and of free quantum field theory (D’Ariano and Perinotti, Phys. Rev. A 90:062106, 2014; Bisio et al., Phys. Rev. A 88:032301, 2013; Bisio et al., Ann. Phys. 354:244, 2015; Bisio et al., Ann. Phys. 368:177, 2016) from informational principles. The paradigm has opened for the first time the possibility of avoiding physical primitives in the axioms of the physical theory, allowing a re-foundation of the whole physics over logically solid grounds. In addition to such methodological value, the new information-theoretic derivation of quantum field theory is particularly interesting for establishing a theoretical framework for quantum gravity, with the idea of obtaining gravity itself as emergent from the quantum information processing, as also suggested by the role played by information in the holographic principle (Susskind, J. Math. Phys. 36:6377, 1995; Bousso, Rev. Mod. Phys. 74:825, 2002). In this paper I review how free quantum field theory is derived without using mechanical primitives, including space-time, special relativity, Hamiltonians, and quantization rules. The theory is simply provided by the simplest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the three following simple principles: homogeneity, locality, and isotropy. The inherent discrete nature of the informational derivation leads to an extension of quantum field theory in terms of a quantum cellular automata and quantum walks. A simple heuristic argument sets the scale to the Planck one, and the currently observed regime where discreteness is not visible is the so-called “relativistic regime” of small wavevectors, which holds for all energies ever tested (and even much larger), where the usual free quantum field theory is perfectly recovered. In the present quantum discrete theory Einstein relativity principle can be restated without using space-time in terms of invariance of the eigenvalue equation of the automaton/walk under change of representations. Distortions of the Poincaré group emerge at the Planck scale, whereas special relativity is perfectly recovered in the relativistic regime. Discreteness, on the other hand, has some plus compared to the continuum theory: 1) it contains it as a special regime; 2) it leads to some additional features with GR flavor: the existence of an upper bound for the particle mass (with physical interpretation as the Planck mass), and a global De Sitter invariance; 3) it provides its own physical standards for space, time, and mass within a purely mathematical adimensional context. The paper ends with the future perspectives of this project, and with an Appendix containing biographic notes about my friendship with David Finkelstein, to whom this paper is dedicated.     

Quantum spin chains: Simple models with complex dynamics

The present study highlights some of the complexities observed in the dynamical properties of one-dimensional quantum spin systems. Exact results for zero-temperature dynamic correlation functions are presented for two contrasting situations:

1. a system with a fully ordered ferromagnetic ground state;
2. a system at aT _c=0 critical point.

For both situations it is found that the exact results are considerably more complex than has been anticipated on the basis of approximate approaches which are considered to be appropriate and reliable for such situations. A still higher degree of complexity is expected for the dynamics of quantum spin systems which are nonintegrable. The paper concludes with some observations concerning nonintegrability effects and quantum chaos in spin systems.     

Quantum Authenticated Direct Communication Using Bell States

Two protocols of quantum direct communication with authentication [Phys. Rev. A 73:042305, 2006] were recently proposed by Lee, Lim and Yang, based on the correlation of Greenberger-Horne-Zeilinger (GHZ) states. However, Zhang et al. showed that in the two protocols the authenticator Trent can eavesdrop the secret message by subtle strategies [Phys. Rev. A 75:026301, 2007]. In this paper, we propose two authenticated quantum direct communication (AQDC) protocols using Bell states. Users can identify each other by checking the correlation of Bell states. Alice can directly send a secret message to Bob without any previously shared secret using the remaining Bell states after authentication. The two proposed AQDC protocols are implemented under the condition that there is a quantum link between Alice and Bob and that there is no quantum link between Alice and Bob respectively, similar to the ones proposed by Lee, Lim and Yang [Phys. Rev. A 73:042305, 2006]. The proposed AQDC protocols not only fix the leaks in the AQDC protocols proposed by Lee, Lim and Yang, but also economize the quantum resource.     

Vector correlations in the F + HD reaction

A theoretical study of the orientation of product rotational angular momenta for two chemical reaction channels: F + HD(ν _r = 0, j _r = 0) → HF(ν, j) + D and F + HD(ν _r = 0, j _r = 0) → DF(ν, j) + H at a E _coll = 78.54 meV collision energy was performed. Angular momentum orientation was described on the basis of irreducible tensor operators (state multipoles) expressed through anisotropy transfer coefficients, which contained quantum-mechanical scattering T matrices determined on the basis of exact solutions to quantum scattering equations obtained using the hyperquantization algorithm. The possibility of the existence of substantial orientation of the angular momentum of reaction products j in the direction perpendicular to the scattering plane was demonstrated. The dependences of differential reaction cross sections and state multi-poles on the ν and j quantum numbers were calculated and analyzed. A experimental scheme based on the multiphoton ionization method was suggested. The scheme can be used to detect predicted reaction product angular momentum orientation.     

Possibility of the use of the magnetic field for creating a quantum filter on the <Emphasis Type="Italic">D</Emphasis><Subscript>1</Subscript><Superscript>87</Superscript>Rb line

The possibility of the use of the F = 2?F = 1 transition of the D ₁ absorption line of the ⁸⁷Rb atom for creating of a single-photon quantum filter based on coherent population trapping (CPT) has been analyzed. It has been shown that the external magnetic field is necessary for ensuring the creation of the quantum filter on boson isotopes of alkali atoms. The field strength should be enough for the manifestation of the splitting of the Zeeman CPT resonances that is much larger than their spectral widths. The splittings of the CPT resonances, which characterize the nonlinearity of the Zeeman effect, have been measured for the ⁸⁷Rb atom and the possibility of the use of this system for the quantum filter is concluded.