Towards optimization of quantum circuits

Any unitary operation in quantum information processing can be implemented via a sequence of simpler steps - quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, seeking for a short sequence of gates - efficient quantum circuit for a given operation, is an important task. We contribute to this issue by proposing optimization of the well-known universal procedure proposed by Barenco et.al [1]. We also created a computer program which realizes both Barenco's decomposition and the proposed optimization. Furthermore, our optimization can be applied to any quantum circuit containing generalized Toffoli gates, including basic quantum gate circuits.Comment: 10 pages, 11 figures, minor changes+typo

Collective and static properties of model two-component plasmas

Classical MD data on the charge-charge dynamic structure factor of two-component plasmas (TCP) modeled in Phys. Rev. A 23, 2041 (1981) are analyzed using the sum rules and other exact relations. The convergent power moments of the imaginary part of the model system dielectric function are expressed in terms of its partial static structure factors, which are computed by the method of hypernetted chains using the Deutsch effective potential. High-frequency asymptotic behavior of the dielectric function is specified to include the effects of inverse bremsstrahlung. The agreement with the MD data is improved, and important statistical characteristics of the model TCP, such as the probability to find both electron and ion at one point, are determined.Comment: 25 pages, 6 figures, 5 tables. Published in Physical Review E http://link.aps.org/abstract/PRE/v76/e02640

Recognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates

This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulae, written in terms of matrix coefficients, characterizing operators implementable with exactly zero, one, or two controlled-not (CNOT) gates and all other gates being one-qubit. We give an algorithm for synthesizing two-qubit circuits with optimal number of CNOT gates, and illustrate it on operators appearing in quantum algorithms by Deutsch-Josza, Shor and Grover. In another application, our explicit numerical tests allow timing a given Hamiltonian to compute a CNOT modulo one-qubit gates, when this is possible.Comment: 4 pages, circuit examples, an algorithm and a new application (v3

Non-adiabatic Arbitary Geometric Gates in 2-qubit NMR Model

We study a 2-qubit nuclear spin system for realizing an arbitrary geometric quantum phase gate by means of non-adiabatic operation. A single magnetic pulse with multi harmonic frequencies is applied to manipulate the quantum states of 2-qubit instantly. Using resonant transition approximation, the time dependent Hamiltonian of two nuclear spins can be solved analytically. The time evolution of the wave function is obtained without adiabatic approximation. The parameters of magnetic pulse, such as the frequency, amplitude, phase of each harmonic part as well as the time duration of the pulse, are determined for achieving an arbitrary non-adiabatic geometric phase gate. The derivation of non-adiabatic geometric controlled phase gates and A-A phase are also addressed.Comment: 7 pages, 1 figur

Scalable quantum computing with Josephson charge qubits

A goal of quantum information technology is to control the quantum state of a system, including its preparation, manipulation, and measurement. However, scalability to many qubits and controlled connectivity between any selected qubits are two of the major stumbling blocks to achieve quantum computing (QC). Here we propose an experimental method, using Josephson charge qubits, to efficiently solve these two central problems. The proposed QC architecture is scalable since any two charge qubits can be effectively coupled by an experimentally accessible inductance. More importantly, we formulate an efficient and realizable QC scheme that requires only one (instead of two or more) two-bit operation to implement conditional gates.Comment: 4 pages, 2 figure

Optimized design of universal two-qubit gates

We construct optimized implementations of the CNOT and other universal two-qubit gates that, unlike many of the previously proposed protocols, are carried out in a single step. The new protocols require tunable inter-qubit couplings but, in return, show a significant improvements in the quality of gate operations. Our optimization procedure can be further extended to the combinations of elementary two-qubit as well as irreducible many-qubit gates.Comment: 6 pages, 2 figure

Mechanism for nonequilibrium symmetry breaking and pattern formation in magnetic films

Magnetic thin films exhibit a strong variation in properties depending on their degree of disorder. Recent coherent x-ray speckle experiments on magnetic films have measured the loss of correlation between configurations at opposite fields and at the same field, upon repeated field cycling. We perform finite temperature numerical simulations on these systems that provide a comprehensive explanation for the experimental results. The simulations demonstrate, in accordance with experiments, that the memory of configurations increases with film disorder. We find that non-trivial microscopic differences exist between the zero field spin configuration obtained by starting from a large positive field and the zero field configuration starting at a large negative field. This seemingly paradoxical beahvior is due to the nature of the vector spin dynamics and is also seen in the experiments. For low disorder, there is an instability which causes the spontaneous growth of line-like domains at a critical field, also in accord with experiments. It is this unstable growth, which is highly sensitive to thermal noise, that is responsible for the small correlation between patterns under repeated cycling. The domain patterns, hysteresis loops, and memory properties of our simulated systems match remarkably well with the real experimental systems.Comment: 12 pages, 10 figures Added comparison of results with cond-mat/0412461 and some more discussio

General-Purpose Parallel Simulator for Quantum Computing

With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, the simulation methods using parallel processing are required. We have developed a general-purpose simulator for quantum computing on the parallel computer (Sun, Enterprise4500). It can deal with up-to 30 qubits. We have performed Shor's factorization and Grover's database search by using the simulator, and we analyzed robustness of the corresponding quantum circuits in the presence of decoherence and operational errors. The corresponding results, statistics and analyses are presented.Comment: 15 pages, 15 figure

Conditional Quantum Dynamics and Logic Gates

Quantum logic gates provide fundamental examples of conditional quantum dynamics. They could form the building blocks of general quantum information processing systems which have recently been shown to have many interesting non--classical properties. We describe a simple quantum logic gate, the quantum controlled--NOT, and analyse some of its applications. We discuss two possible physical realisations of the gate; one based on Ramsey atomic interferometry and the other on the selective driving of optical resonances of two subsystems undergoing a dipole--dipole interaction.Comment: 5 pages, RevTeX, two figures in a uuencoded, compressed fil