Fault-tolerant linear optical quantum computing with small-amplitude coherent states

Quantum computing using two optical coherent states as qubit basis states has been suggested as an interesting alternative to single photon optical quantum computing with lower physical resource overheads. These proposals have been questioned as a practical way of performing quantum computing in the short term due to the requirement of generating fragile diagonal states with large coherent amplitudes. Here we show that by using a fault-tolerant error correction scheme, one need only use relatively small coherent state amplitudes ($\alpha > 1.2$) to achieve universal quantum computing. We study the effects of small coherent state amplitude and photon loss on fault tolerance within the error correction scheme using a Monte Carlo simulation and show the quantity of resources used for the first level of encoding is orders of magnitude lower than the best known single photon scheme. %We study this reigem using a Monte Carlo simulation and incorporate %the effects of photon loss in this simulation

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

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 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)

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

Fault Tolerance in Parity-State Linear Optical Quantum Computing

We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude in resources when compared to a previous scheme, at a cost of a somewhat reduced noise threshold.Comment: LaTeX, 10 pages, introduction updated for journal submissio

Efficient and perfect state transfer in quantum chains

We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number chains employed in the scheme. The system consists of $M$ uncoupled identical quantum chains. Local control (gates, measurements) is only allowed at the sending/receiving end of the chains. Under a quite general hypothesis on the interaction Hamiltonian of the qubits a theorem is proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits.Comment: 6 pages, 2 figures; new material adde