International Journal of Quantum Information

In this work, we consider a family of sure-success quantum algorithms, which is grouped into even and odd members for solving a generalized Grover search problem. We prove the matching conditions for both groups and give the corresponding formulae for evaluating the iterations or oracle calls required in the search computation. We also present how to adjust the phase angles in the generalized Grover operator to ensure the sure-success if minimal oracle calls are demanded in the search.

It has long been known that the Schrodinger equation provides a description of a certain kind of statistical Markov process. We show here that as a consequence, one can view quantum mechanics as an extension of the Helmholtz machine approach to pattern recognition. Not only does this observation throw new light on the relationship between quantum mechanics and computing theory, but it suggests that mathematical techniques developed for inverse scattering problems might provide an alternative to conventional pattern recognition algorithms.

We study a possible realization of the position- and momentum-correlated atomic pairs that are confined to adjacent sites of two mutually shifted optical lattices and are entangled via laser-induced dipole–dipole interactions. The Einstein–Podolsky–Rosen (EPR) "paradox"¹ with translational variables is then modified by lattice-diffraction effects. This "paradox" can be verified to a high degree of accuracy in this scheme.

The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features. (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitude and to model a 1000-qubit full adder. (We add a 1000-bit number using 2001 spins.) (ii) We construct the full adder gates directly as sequences of radio-frequency pulses, rather than breaking them down into generalized logical gates, such as Control-Not and one qubit gates. This substantially reduces the number of pulses needed to implement the full adder. (The maximum number of pulses required to add one bit (F-gate) is 15.) (iii) Full adder is realized in a homogeneous spin chain. (iv) The phase error is minimized: the F-gates generate approximately the same phase for different states of the superposition. (v) Modeling of the full adder is performed using quantum maps instead of differential equations. This allows us to reduce the calculation time to a reasonable value.

Alice communicates with words drawn uniformly amongst {|j>}_j=1…n, the canonical orthonormal basis. Sometimes however, Alice interleaves quantum decoys between her messages. Such pairwise superpositions of possible words cannot be distinguished from the message words. Thus as malevolent Eve observes the quantum channel, she runs the risk of damaging the superpositions (by causing a collapse). At the receiving end honest Bob, whom we assume is warned of the quantum decoys' distribution, checks upon their integrity with a measurement. The present work establishes, in the case of individual attacks, the tradeoff between Eve's information gain (her chances, if a message word was sent, of guessing which) and the disturbance she induces (Bob's chances, if a quantum decoy was sent, to detect tampering). Whilst not directly applicable to secure channel protocols, quantum decoys seem a powerful primitive for constructing other n-dimensional quantum cryptographic applications. Moreover, the methods employed in this article should be of strong interest to anyone concerned with the old but fundamental problem of how much information may be gained about a system, versus how much this will disturb the system, in quantum mechanics.

Each platonic solid defines a single-qubit positive operator-valued measure (POVM) by interpreting its vertices as points on the Bloch sphere. We construct simple circuits for implementing these kinds of measurements and other simple types of symmetric POVMs on one qubit. Each implementation consists of a discrete Fourier transform and some elementary quantum operations followed by an orthogonal measurement in the computational basis.

The errors caused by the transitions with large frequency offsets (nonresonant transitions) are calculated analytically for a scalable solid-state quantum computer based on a one-dimensional spin chain with Ising interactions between neighboring spins. Selective excitations of the spins are enabled by a uniform gradient of the external magnetic field. We calculate the probabilities of all unwanted nonresonant transitions associated with the flip of each spin with nonresonant frequency and with flips of two spins: one with resonant and one with nonresonant frequencies. It is shown that these errors oscillate with changing gradient of the external magnetic field. Choosing the optimal values of this gradient allows us to decrease these errors by 50%.

We study the entanglement of a two-qubit one-dimensional XYZ Heisenberg chain in thermal equilibrium at temperature T. We obtain an analytical expression for the concurrence of this system in terms of the parameters of the Hamiltonian and T. We show that depending on the relation among the coupling constants, it is possible to increase the amount of entanglement of the system by increasing its anisotropy. We also show numerically that for all sets of the coupling constants entanglement is a monotonically decreasing function of the temperature T, proving that we must have at least an external magnetic field in the z-direction to obtain a behavior where entanglement increases with T.

A thought experiment, proposed by Karl Popper, which has been experimentally realized recently, is critically examined. A basic flaw in Popper's argument which has also been prevailing in subsequent debates, is pointed out. It is shown that Popper's experiment can be understood easily within the Copenhagen interpretation of quantum mechanics. An alternate experiment, based on discrete variables, is proposed, which constitutes Popper's test in a clearer way. It refutes the argument of absence of nonlocality in quantum mechanics.

In his paper,¹ Razmi derives a Bell-like inequality without imposing the locality condition. Then he shows violation of this inequality by certain quantum predictions. Here we point at a loophole in Razmi's proof, which invalidates his inequality.