Optimal Dynamical Decoherence Control of a Qubit

A theory of dynamical control by modulation for optimal decoherence reduction is developed. It is based on the non-Markovian Euler-Lagrange equation for the energy-constrained field that minimizes the average dephasing rate of a qubit for any given dephasing spectrum.Comment: 6 pages, including 2 figures and an appendi

Rare top decay t-> c l+l- as a probe of new physics

The rare top decay t-> c l+l-, which involves flavor violation, is studied as a possible probe of new physics. This decay is analyzed with the simplest Standard Model extensions with additional gauge symmetry formalism. The considered extension is the Left-Right Symmetric Model, including a new neutral gauge boson Z' that allows to obtain the decay at tree level through Flavor Changing Neutral Currents (FCNC) couplings. The neutral gauge boson couplings are considered diagonal but family non-universal in order to induce these FCNC. We find the $BR(t-> c l+l-)~10^{-13} for a range 1 TeV < M_{Z'} < 3 TeV.Comment: 9 pages, 6 figure

Ramsey numbers and adiabatic quantum computing

The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers $R(m,n)$ with $m,n\geq 3$, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers $R(m,n)$. We show how the computation of $R(m,n)$ can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for $5\leq s\leq 7$. We then discuss the algorithm's experimental implementation, and close by showing that Ramsey number computation belongs to the quantum complexity class QMA.Comment: 4 pages, 1 table, no figures, published versio

Minimal and Robust Composite Two-Qubit Gates with Ising-Type Interaction

We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number (N=3) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust SWAP gate cannot be constructed with N=3, but requires N=6 elementary two-qubit gates.Comment: 7 pages, 2 figure

Designing Robust Unitary Gates: Application to Concatenated Composite Pulse

We propose a simple formalism to design unitary gates robust against given systematic errors. This formalism generalizes our previous observation [Y. Kondo and M. Bando, J. Phys. Soc. Jpn. 80, 054002 (2011)] that vanishing dynamical phase in some composite gates is essential to suppress amplitude errors. By employing our formalism, we naturally derive a new composite unitary gate which can be seen as a concatenation of two known composite unitary operations. The obtained unitary gate has high fidelity over a wider range of the error strengths compared to existing composite gates.Comment: 7 pages, 4 figures. Major revision: improved presentation in Sec. 3, references and appendix adde