Optical force field mapping in microdevices

We present a method for characterizing microscopic optical force fields. Two dimensional vector force maps are generated by measuring the optical force applied to a probe particle for a grid of particle positions. The method is used to map Out the force field created by the beam from a lensed fiber inside a liquid filled microdevice. We find transverse gradient forces and axial scattering forces on the order of 2 pN per 10 mW laser power which are constant over a considerable axial range (> 35 mu m). These findings suggest Future useful applications of lensed fibers for particle guiding/sorting. The propulsion of a small particle at a constant velocity of 200 mu m s(-1) is shown.

Comparison of linear optics quantum-computation control-sign gates with ancilla inefficiency and an improvement to functionality under these conditions

We compare three proposals for nondeterministic control-sign gates implemented using linear optics and conditional measurements with nonideal ancilla mode production and detection. The simplified Knill-Laflamme-Milburn gate [Ralph , Phys. Rev. A 65, 012314 (2001)] appears to be the most resilient under these conditions. We also find that the operation of this gate can be improved by adjusting the beam splitter ratios to compensate to some extent for the effects of the imperfect ancilla.

Scaling of multiple postselected quantum gates in optics

We show that interesting multigate circuits can be constructed using a postselected controlled-sign gate that works with a probability (1/3)(n), where n-1 is the number of controlled-sign gates in the circuit, rather than (1/9)(n-1), as would be expected from a sequence of such gates. We suggest some quantum information tasks which could be demonstrated using these circuits, such as parity checking and cluster-state computation.

Scaling of decoherence effects in quantum computers

The scaling of decoherence rates with qubit number N is studied for a simple model of a quantum computer in the situation where N is large. The two state qubits are localized around well-separated positions via trapping potentials and vibrational centre of mass motion of the qubits occurs. Coherent one and two qubit gating processes are controlled by external classical fields and facilitated by a cavity mode ancilla. Decoherence due to qubit coupling to a bath of spontaneous modes, cavity decay modes and to the vibrational modes is treated. A non-Markovian treatment of the short time behaviour of the fidelity is presented, and expressions for the characteristic decoherence time scales obtained for the case where the qubit/cavity mode ancilla is in a pure state and the baths are in thermal states. Specific results are given for the case where the cavity mode is in the vacuum state and gating processes are absent and the qubits are in (a) the Hadamard state (b) the GHZ state.

Quantum dynamics as a physical resource

How useful is a quantum dynamical operation for quantum information processing? Motivated by this question, we investigate several strength measures quantifying the resources intrinsic to a quantum operation. We develop a general theory of such strength measures, based on axiomatic considerations independent of state-based resources. The power of this theory is demonstrated with applications to quantum communication complexity, quantum computational complexity, and entanglement generation by unitary operations.

Robustness of quantum gates in the presence of noise

We define several quantitative measures of the robustness of a quantum gate against noise. Exact analytic expressions for the robustness against depolarizing noise are obtained for all bipartite unitary quantum gates, and it is found that the controlled-NOT gate is the most robust two-qubit quantum gate, in the sense that it is the quantum gate which can tolerate the most depolarizing noise and still generate entanglement. Our results enable us to place several analytic upper bounds on the value of the threshold for quantum computation, with the best bound in the most pessimistic error model being p(th)less than or equal to0.5.

Lower bounds on the complexity of simulating quantum gates

We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.

Experimental requirements for Grover's algorithm in optical quantum computation

The field of linear optical quantum computation (LOQC) will soon need a repertoire of experimental milestones. We make progress in this direction by describing several experiments based on Grover's algorithm. These experiments range from a relatively simple implementation using only a single nonscalable controlled- NOT (CNOT) gate to the most complex, requiring two concatenated scalable CNOT gates, and thus form a useful set of early milestones for LOQC. We also give a complete description of basic LOQC using polarization-encoded qubits, making use of many simplifications to the original scheme of Knill, Laflamme, and Milburn [E. Knill, R. Laflamme, and G. J. Milburn, Nature (London) 409, 46 (2001)].

Gaussian quantum operator representation for bosons

We introduce a Gaussian quantum operator representation, using the most general possible multimode Gaussian operator basis. The representation unifies and substantially extends existing phase-space representations of density matrices for Bose systems and also includes generalized squeezed-state and thermal bases. It enables first-principles dynamical or equilibrium calculations in quantum many-body systems, with quantum uncertainties appearing as dynamical objects. Any quadratic Liouville equation for the density operator results in a purely deterministic time evolution. Any cubic or quartic master equation can be treated using stochastic methods.

Fast nonadiabatic two-qubit gates for the Kane quantum computer

In this paper, we apply the canonical decomposition of two-qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the controlled-NOT, swap, square root of swap, and controlled Z rotations. We analyze the speed and fidelity of these gates, both of which compare favorably to existing schemes. The pulse sequences presented in this paper are theoretically faster, with higher fidelity, and simpler. Any two-qubit gate may be easily found and implemented using similar pulse sequences. Numerical simulation is used to verify the accuracy of each pulse scheme.