Searcharxiv⌕ Search

arXiv subjects

Hiroo Azuma

Publications and source records attributed to Hiroo Azuma.

At least 37 records · Page 2Linked to original sources

An entangling-probe attack on Shor's algorithm for factorization

We investigate how to attack Shor's quantum algorithm for factorization with an entangling probe. We show that an attacker can steal an exact solution of Shor's algorithm outside an institute where the quantum computer is installed if he replaces its initialized quantum register with entangled qubits, namely the entangling probe. He can apply arbitrary local operations to his own probe. Moreover, we assume that there is an unauthorized person who helps the attacker to commit a crime inside the institute. He tells garbage data obtained from measurements of the quantum register to the attacker secretly behind a legitimate user's back. If the attacker succeeds in cracking Shor's algorithm, the legitimate user obtains a random answer and does not notice the attacker's illegal acts. We discuss how to detect the attacker. Finally we estimate a probability that the quantum algorithm inevitably makes an error, of which the attacker can take advantage.

quant-ph↗

Decoherence of the quantum logic gate implemented with the Jaynes-Cummings model: A semiclassical approach

In this paper, we investigate decoherence of Knill, Laflamme, and Milburn's nonlinear sign-shift gate that is implemented with the Jaynes-Cummings model. Introducing a stochastic variable as an external electric field, we let it couple with a dipole moment of a two-level atom. We examine this model using a semiclassical theory. Results of the Monte Carlo simulations under the semiclassical approximation correspond well with those obtained with the quantum mechanical perturbation theory for the stochastic process. In the results of the simulations, we observe both the $\mbox{T}_{1}$ and $\mbox{T}_{2}$ decays. This paper is a sequel to the reference [H.~Azuma, Prog. Theor. Phys. {\bf 126}, 369 (2011)].

quant-ph↗

Equivalence of a compressible inviscid flow and the Bloch vector under the thermal Jaynes-Cummings model

In this paper, we show that the time evolution of the Bloch vector governed by the thermal Jaynes-Cummings model is equivalent to a compressible inviscid flow with zero vorticity. Because of its quasiperiodicity, the dynamics of the Bloch vector includes countably infinite angular momenta as integrals of motion. Moreover, to derive the Bloch vector, we trace out the Hilbert space of the cavity field and remove entanglement between the single atom and the cavity mode. These facts indicate that the dynamics of the Bloch vector can be described with a hidden-variable model that has local determinism and a countably infinite number of degrees of freedom. Our results fit these considerations.

quant-ph↗

A thermal coherent state defined with the Lie-Trotter product formula

In this paper, we investigate a thermal coherent state defined with the Lie-Trotter product formula under the formalism of the thermo field dynamics. In the definition of our thermal coherent state, we treat the thermalizing operator and the displacement operator symmetrically. We examine its uncertainty relation and quasiprobability distributions. Although this thermal coherent state is equivalent to the conventional ones except for different parameterizations and a phase factor, it is convenient for describing an experimental setup of the optical parametric oscillator laser.

quant-ph↗

Quasiperiodicity in time evolution of the Bloch vector under the thermal Jaynes-Cummings model

We study a quasiperiodic structure in the time evolution of the Bloch vector, whose dynamics is governed by the thermal Jaynes-Cummings model (JCM). Putting the two-level atom into a certain pure state and the cavity field into a mixed state in thermal equilibrium at initial time, we let the whole system evolve according to the JCM Hamiltonian. During this time evolution, motion of the Bloch vector seems to be in disorder. Because of the thermal photon distribution, both a norm and a direction of the Bloch vector change hard at random. In this paper, taking a different viewpoint compared with ones that we have been used to, we investigate quasiperiodicity of the Bloch vector's trajectories. Introducing the concept of the quasiperiodic motion, we can explain the confused behaviour of the system as an intermediate state between periodic and chaotic motions. More specifically, we discuss the following two facts: (1) If we adjust the time interval $Δt$ properly, figures consisting of plotted dots at the constant time interval acquire scale invariance under replacement of $Δt$ by $sΔt$, where $s(>1)$ is an arbitrary real but not transcendental number. (2) We can compute values of the time variable $t$, which let $|S_{z}(t)|$ (the absolute value of the $z$-component of the Bloch vector) be very small, with the Diophantine approximation (a rational approximation of an irrational number).

quant-ph↗

Thermal effects in Jaynes-Cummings model derived with low-temperature expansion

In this paper, we investigate thermal effects of the Jaynes-Cummings model (JCM) at finite temperature with a perturbative approach. We assume a single two-level atom and a single cavity mode to be initially in the thermal equilibrium state and the thermal coherent state, respectively, at a certain finite low temperature. Describing this system with Thermo Field Dynamics formalism, we obtain a low-temperature expansion of the atomic population inversion in a systematic manner. Letting the system evolve in time with the JCM Hamiltonian, we examine thermal effects of the collapse and the revival of the Rabi oscillations by means of the third-order perturbation theory under the low-temperature limit, that is to say, using the low-temperature expansion up to the third order terms. From an intuitive discussion, we can expect that the period of the revival of the Rabi oscillations becomes longer as the temperature rises. Numerical results obtained with the perturbation theory reproduce well this temperature dependence of the period.

quant-ph↗

Quantum computation with the Jaynes-Cummings model

In this paper, we propose a method for building a two-qubit gate with the Jaynes-Cummings model (JCM). In our scheme, we construct a qubit from a pair of optical paths where a photon is running. Generating Knill, Laflamme and Milburn's nonlinear sign-shift gate by the JCM, we construct the conditional sign-flip gate, which works with small error probability in principle. We also discuss two experimental setups for realizing our scheme. In the first experimental setup, we make use of coherent lights to examine whether or not our scheme works. In the second experimental setup, an optical loop circuit made out of the polarizing beam splitter and the Pockels cell takes an important role in the cavity.

quant-ph↗

Application of Abel-Plana formula for collapse and revival of Rabi oscillations in Jaynes-Cummings model

In this paper, we give an analytical treatment to study the behavior of the collapse and the revival of the Rabi oscillations in the Jaynes-Cummings model (JCM). The JCM is an exactly soluble quantum mechanical model, which describes the interaction between a two-level atom and a single cavity mode of the electromagnetic field. If we prepare the atom in the ground state and the cavity mode in a coherent state initially, the JCM causes the collapse and the revival of the Rabi oscillations many times in a complicated pattern in its time-evolution. In this phenomenon, the atomic population inversion is described with an intractable infinite series. (When the electromagnetic field is resonant with the atom, the $n$th term of this infinite series is given by a trigonometric function for $\sqrt{n}t$, where $t$ is a variable of the time.) According to Klimov and Chumakov's method, using the Abel-Plana formula, we rewrite this infinite series as a sum of two integrals. We examine the physical meanings of these two integrals and find that the first one represents the initial collapse (the semi-classical limit) and the second one represents the revival (the quantum correction) in the JCM. Furthermore, we evaluate the first and second-order perturbations for the time-evolution of the JCM with an initial thermal coherent state for the cavity mode at low temperature, and write down their correction terms as sums of integrals by making use of the Abel-Plana formula.

quant-ph↗

Direct derivation of the Peres-Horodecki criterion for the two-qubit states from the Hill-Wootters formula for the entanglement of formation

In this paper, we show a direct method of deriving the Peres-Horodecki criterion for the two-qubit states from the Hill-Wootters formula for the entanglement of formation. Although the Peres-Horodecki criterion and the Hill-Wootters formula are established results in the field of quantum information theory, they are proved independently and connections between them are not discussed precisely. In this paper, we clarify these connections. First, we replace the original Peres-Horodecki criterion with its another equivalent statement found by Augusiak et al. Second, we obtain an analytical form of the concurrence of an arbitrary two-qubit state $ρ$, using Ferrari's method to solve a quartic equation for eigenvalues $ρ\tildeρ$. Finally, with the above preparations, we accomplish the direct derivation of the Peres-Horodecki criterion from the Hill-Wootters formula.

quant-ph↗

Dynamics of Bloch vector in thermal Jaynes-Cummings model

In this paper, we investigate the dynamics of the Bloch vector of a single two-level atom which interacts with a single quantized electromagnetic field mode according to the Jaynes-Cummings model, where the field is initially prepared in a thermal state. The time evolution of the Bloch vector S(t) seems to be in complete disorder because of the thermal distribution of the initial state of the field. Both the norm and the direction of S(t) oscillate hard and their periods seem infinite. We observe that the trajectory of the time evolution of S(t) in the two- or three-dimensional space does not form a closed path. To remove the fast frequency oscillation from the trajectory, we take the time-average of the Bloch vector S(t). We examine the histogram of {S_{z}(nΔt)|n=0,1,...,N} for small Δt and large N. It represents an absolute value of a derivative of the inverse function of S_{z}(t). (When the inverse function of y=S_{z}(t) is a multi-valued function, the histogram represents a summation of the absolute values of its derivatives at points whose real parts are equal to y on the Riemann surface.) We examine the dependence of the variance of the histogram on the temperature of the field. We estimate the lower bound of the entanglement between the atom and the field.

quant-ph↗

Quantum computation with Kerr-nonlinear photonic crystals

In this paper, we consider a method for implementing a quantum logic gate with photons whose wave function propagates in a one-dimensional Kerr-nonlinear photonic crystal. The photonic crystal causes the incident photons to undergo Bragg reflection by its periodic structure of dielectric materials and forms the photonic band structure, namely, the light dispersion relation. This dispersion relation reduces the group velocity of the wave function of the photons, so that it enhances nonlinear interaction of the photons. (Because variation of the group velocity against the wave vector is very steep, we have to tune up the wavelength of injected photons precisely, however.) If the photonic crystal includes layers of a Kerr medium, we can rotate the phase of the wave function of the incident photons by a large angle efficiently. We show that we can construct the nonlinear sign-shift (NS) gate proposed by Knill, Laflamme, and Milburn (KLM) by this method. Thus, we can construct the conditional sign-flip gate for two qubits, which is crucial for quantum computation. Our NS gate works with probability unity in principle while KLM's original one is a nondeterministic gate conditioned on the detection of an auxiliary photon.

quant-ph↗

Interaction-free measurement with an imperfect absorber

In this paper, we consider interaction-free measurement (IFM) with imperfect interaction. In the IFM proposed by Kwiat et al., we assume that interaction between an absorbing object and a probe photon is imperfect, so that the photon is absorbed with probability 1-η(0\leqη\leq 1) and it passes by the object without being absorbed with probability ηwhen it approaches close to the object. We derive the success probability P that we can find the object without the photon absorbed under the imperfect interaction as a power series in 1/N, and show the following result: Even if the interaction between the object and the photon is imperfect, we can let the success probability P of the IFM get close to unity arbitrarily by making the reflectivity of the beam splitter larger and increasing the number of the beam splitters. Moreover, we obtain an approximating equation of P for large N from the derived power series in 1/N.

quant-ph↗

Another convex combination of product states for the separable Werner state

In this paper, we write down the separable Werner state in a two-qubit system explicitly as a convex combination of product states, which is different from the convex combination obtained by Wootters' method. The Werner state in a two-qubit system has a single real parameter and varies from inseparable state to separable state according to the value of its parameter. We derive a hidden variable model that is induced by our decomposed form for the separable Werner state. From our explicit form of the convex combination of product states, we understand the following: The critical point of the parameter for separability of the Werner state comes from positivity of local density operators of the qubits.

quant-ph↗

Higher order perturbation theory for decoherence in Grover's algorithm

In this paper, we study decoherence in Grover's quantum search algorithm using a perturbative method. We assume that each two-state system (qubit) that belongs to a register suffers a phase flip error (σ_{z} error) with probability p independently at every step in the algorithm, where $0\leq p\leq 1$. Considering an n-qubit density operator to which Grover's iterative operation is applied M times, we expand it in powers of 2Mnp and derive its matrix element order by order under the large-n limit. [In this large-n limit, we assume p is small enough, so that 2Mnp can take any real positive value or zero. We regard $x\equiv 2Mnp(\geq 0)$ as a perturbative parameter.] We obtain recurrence relations between terms in the perturbative expansion. By these relations, we compute higher orders of the perturbation efficiently, so that we extend the range of the perturbative parameter that provides a reliable analysis. Calculating the matrix element numerically by this method, we derive the maximum value of the perturbative parameter x at which the algorithm finds a correct item with a given threshold of probability P_{th} or more. (We refer to this maximum value of x as x_{c}, a critical point of x.) We obtain a curve of x_{c} as a function of P_{th} by repeating this numerical calculation for many points of P_{th} and find the following facts: a tangent of the obtained curve at P_{th}=1 is given by x=(8/5)(1-P_{th}), and we have x_{c}>-(8/5)\log_{e}P_{th} near P_{th}=0.

quant-ph↗

A quantum algorithm for examining oracles

In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$ by querying the oracle.'' We compare the efficiency of our quantum algorithm with that of classical algorithms by evaluating the expected number of queries for each algorithm. We show that our quantum algorithm is more efficient than any classical algorithm in some cases. However, our quantum algorithm does not exhibit an exponential speedup in the size of an input, compared with the best classical algorithm. Our algorithm extracts a global property of $f$ (that is, invariance of $f$) while it neglects local properties of $f$ (that is, outputs of $f$). We can regard our algorithm as an application of Simon's algorithm.

quant-ph↗

Interaction-free quantum computation

In this paper, we study the quantum computation realized by an interaction-free measurement (IFM). Using Kwiat et al.'s interferometer, we construct a two-qubit quantum gate that changes one particle's trajectory according to whether or not the other particle exists in the interferometer. We propose a method for distinguishing Bell-basis vectors, each of which consists of a pair of an electron and a positron, by this gate. (This is called the Bell-basis measurement.) This method succeeds with probability 1 in the limit of $N \to \infty$, where N is the number of beam splitters in the interferometer. Moreover, we can carry out a controlled-NOT gate operation by the above Bell-basis measurement and the method proposed by Gottesman and Chuang. Therefore, we can prepare a universal set of quantum gates by the IFM. This means that we can execute any quantum algorithm by the IFM.

quant-ph↗

Interaction-free generation of entanglement

In this paper, we study how to generate entanglement by interaction-free measurement. Using Kwiat et al.'s interferometer, we construct a two-qubit quantum gate that changes a particle's trajectory according to the other particle's trajectory. We propose methods for generating the Bell state from an electron and a positron and from a pair of photons by this gate. We also show that using this gate, we can carry out the Bell measurement with the probability of 3/4 at the maximum and execute a controlled-NOT operation by the method proposed by Gottesman and Chuang with the probability of 9/16 at the maximum. We estimate the success probability for generating the Bell state by our procedure under imperfect interaction.

quant-ph↗

Decoherence on Grover's quantum algorithm: perturbative approach

In this paper, we study decoherence on Grover's quantum searching algorithm using a perturbative method. We assume that each two-state system (qubit) suffers σ_{z} error with probability p (0\leq p\leq 1) independently at every step in the algorithm. Considering an n-qubit density operator to which Grover's operation is applied M times, we expand it in powers of 2Mnp and derive its matrix element order by order under the n\to \infty limit. (In this large n limit, we assume p is small enough, so that 2Mnp(\geq 0) can take any real positive value or 0.) This approach gives us an interpretation about creation of new modes caused by σ_{z} error and an asymptotic form of an arbitrary order correction. Calculating the matrix element up to the fifth order term numerically, we investigate a region of 2Mnp (perturbative parameter) where the algorithm finds the correct item with a threshold of probability P_{th} or more. It satisfies 2Mnp<(8/5)(1-P_{th}) around 2Mnp\simeq 0 and P_{th}\simeq 1, and this linear relation is applied to a wide range of P_{th} approximately. This observation is similar to a result obtained by E. Bernstein and U. Vazirani concerning accuracy of quantum gates for general algorithms. We cannot investigate a quantum to classical phase transition of the algorithm, because it is outside the reliable domain of our perturbation theory.

quant-ph↗