Optimal state encoding for quantum walks and quantum communication over spin systems

Recent work has shown that a simple chain of interacting spins can be used as a medium for high-fidelity quantum communication. We describe a scheme for quantum communication using a spin system that conserves z-spin, but otherwise is arbitrary. The sender and receiver are assumed to directly control several spins each, with the sender encoding the message state onto the larger state-space of her control spins. We show how to find the encoding that maximises the fidelity of communication, using a simple method based on the singular-value decomposition. Also, we show that this solution can be used to increase communication fidelity in a rather different circumstance: where no encoding of initial states is used, but where the sender and receiver control exactly two spins each and vary the interactions on those spins over time. The methods presented are computationally efficient, and numerical examples are given for systems having up to 300 spins.Comment: 10 pages, LaTeX, 7 EPS figures. Corrected an error in the definition and interpretation of C_B(T

Noise thresholds for optical quantum computers

In this Letter we numerically investigate the fault-tolerant threshold for optical cluster-state quantum computing. We allow both photon loss noise and depolarizing noise (as a general proxy for all local noise), and obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible for photon loss probabilities < 3x10(-3), and for depolarization probabilities < 10(-4)

Quantum states far from the energy eigenstates of any local Hamiltonian

What quantum states are possible energy eigenstates of a many-body Hamiltonian? Suppose the Hamiltonian is non-trivial, i.e., not a multiple of the identity, and L-local, in the sense of containing interaction terms involving at most L bodies, for some fixed L. We construct quantum states \psi which are ``far away'' from all the eigenstates E of any non-trivial L-local Hamiltonian, in the sense that |\psi-E| is greater than some constant lower bound, independent of the form of the Hamiltonian.Comment: 4 page

Noise thresholds for optical cluster-state quantum computation

In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local noise other than photon loss noise. We obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible for photon loss probabilities less than 0.003, and for depolarization probabilities less than 0.0001. Our fault-tolerant protocol involves a number of innovations, including a method for syndrome extraction known as telecorrection, whereby repeated syndrome measurements are guaranteed to agree. This paper is an extended version of [Dawson et al., Phys. Rev. Lett. 96, 020501].Comment: 28 pages. Corrections made to Table I

On the practicality of time-optimal two-qubit Hamiltonian simulation

What is the time-optimal way of using a set of control Hamiltonians to obtain a desired interaction? Vidal, Hammerer and Cirac [Phys. Rev. Lett. 88 (2002) 237902] have obtained a set of powerful results characterizing the time-optimal simulation of a two-qubit quantum gate using a fixed interaction Hamiltonian and fast local control over the individual qubits. How practically useful are these results? We prove that there are two-qubit Hamiltonians such that time-optimal simulation requires infinitely many steps of evolution, each infinitesimally small, and thus is physically impractical. A procedure is given to determine which two-qubit Hamiltonians have this property, and we show that almost all Hamiltonians do. Finally, we determine some bounds on the penalty that must be paid in the simulation time if the number of steps is fixed at a finite number, and show that the cost in simulation time is not too great.Comment: 9 pages, 2 figure

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.Comment: 6 page