SearcharxivSearch

arXiv subjects

A. Hosoya

Publications and source records attributed to A. Hosoya.

9 recordsLinked to original sources

Time-optimal CNOT between indirectly coupled qubits in a linear Ising chain

We give analytical solutions for the time-optimal synthesis of entangling gates between indirectly coupled qubits 1 and 3 in a linear spin chain of three qubits subject to an Ising Hamiltonian interaction with equal coupling $J$ plus a local magnetic field acting on the intermediate qubit. The energy available is fixed, but we relax the standard assumption of instantaneous unitary operations acting on single qubits. The time required for performing an entangling gate which is equivalent, modulo local unitary operations, to the $\mathrm{CNOT}(1, 3)$ between the indirectly coupled qubits 1 and 3 is $T=\sqrt{3/2} J^{-1}$, i.e. faster than a previous estimate based on a similar Hamiltonian and the assumption of local unitaries with zero time cost. Furthermore, performing a simple Walsh-Hadamard rotation in the Hlibert space of qubit 3 shows that the time-optimal synthesis of the $\mathrm{CNOT}^{\pm}(1, 3)$ (which acts as the identity when the control qubit 1 is in the state $\ket{0}$, while if the control qubit is in the state $\ket{1}$ the target qubit 3 is flipped as $\ket{\pm}\rightarrow \ket{\mp}$) also requires the same time $T$.

quant-ph

Quantum Brachistochrone for Mixed States

We present a general formalism based on the variational principle for finding the time-optimal quantum evolution of mixed states governed by a master equation, when the Hamiltonian and the Lindblad operators are subject to certain constraints. The problem reduces to solving first a fundamental equation (the {\it quantum brachistochrone}) for the Hamiltonian, which can be written down once the constraints are specified, and then solving the constraints and the master equation for the Lindblad and the density operators. As an application of our formalism, we study a simple one-qubit model where the optimal Lindblad operators control decoherence and can be simulated by a tunable coupling with an ancillary qubit. It is found that the evolution through mixed states can be more efficient than the unitary evolution between given pure states. We also discuss the mixed state evolution as a finite time unitary evolution of the system plus an environment followed by a single measurement. For the simplest choice of the constraints, the optimal duration time for the evolution is an exponentially decreasing function of the environment's degrees of freedom.

quant-ph

Complementarity of Entanglement and Interference

A complementarity relation is shown between the visibility of interference and bipartite entanglement in a two qubit interferometric system when the parameters of the quantum operation change for a given input state. The entanglement measure is a decreasing function of the visibility of interference. The implications for quantum computation are briefly discussed.

quant-ph

Quantum Entropy Bound by Information in Black Hole Spacetime

We show that the increase of the generalized entropy by a quantum process outside the horizon of a black hole is more than the Holevo bound of the classical information lost into the black hole and which could be obtained by further observations outside the horizon. In the optimal case, the prepared information can be completely retrieved.

quant-ph

Quantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State

Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum subroutines, when the computational qubits and the environment are coupled, and in general when the control over the quantum system is partial.

quant-ph

Generalized Second Law of Black Hole Thermodynamics and Quantum Information Theory

We propose a quantum version of a gedanken experiment which supports the generalized second law of black hole thermodynamics. A quantum measurement of particles in the region outside of the event horizon decreases the entropy of the outside matter due to the entanglement of the inside and outside particle states. This decrease is compensated, however, by the increase in the detector entropy. If the detector is conditionally dropped into the black hole depending on the experimental outcome, the decrease of the matter entropy is more than compensated by the increase of the black hole entropy via the increase of the black hole mass which is ultimately attributed to the work done by the measurement.

gr-qc

Quantum Probabilistic Subroutines and Problems in Number Theory

We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for extracting the periodicity of a function, and their combined use in the counting algorithm originally introduced by Brassard et al. One of the main features of our quantum probabilistic algorithm is its full unitarity and reversibility, which would make its use possible as part of larger and more complicated networks in quantum computers. As an example of this we describe polynomial time algorithms for studying some important problems in number theory, such as the test of the primality of an integer, the so called 'prime number theorem' and Hardy and Littlewood's conjecture about the asymptotic number of representations of an even integer as a sum of two primes.

quant-ph

Carmichael Numbers on a Quantum Computer

We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by Pomerance, Selfridge and Wagstaff concerning the asymptotic distribution of Carmichael numbers smaller than a given integer.

quant-ph