Searcharxiv⌕ Search

arXiv subjects

Peter P. Rohde

Publications and source records attributed to Peter P. Rohde.

70 records · Page 4Linked to original sources

Trade-off between the tolerance of located and unlocated errors in nondegenerate quantum error-correcting codes

In a recent study [Rohde et al., quant-ph/0603130 (2006)] of several quantum error correcting protocols designed for tolerance against qubit loss, it was shown that these protocols have the undesirable effect of magnifying the effects of depolarization noise. This raises the question of which general properties of quantum error-correcting codes might explain such an apparent trade-off between tolerance to located and unlocated error types. We extend the counting argument behind the well-known quantum Hamming bound to derive a bound on the weights of combinations of located and unlocated errors which are correctable by nondegenerate quantum codes. Numerical results show that the bound gives an excellent prediction to which combinations of unlocated and located errors can be corrected with high probability by certain large degenerate codes. The numerical results are explained partly by showing that the generalized bound, like the original, is closely connected to the information-theoretic quantity the quantum coherent information. However, we also show that as a measure of the exact performance of quantum codes, our generalized Hamming bound is provably far from tight.

quant-ph↗

Practical effects in the preparation of cluster states using weak non-linearities

We discuss experimental effects in the implementation of a recent scheme for performing bus mediated entangling operations between qubits. Here a bus mode, a strong coherent state, successively undergoes weak Kerr-type non-linear interactions with qubits. A quadrature measurement on the bus then projects the qubits into an entangled state. This approach has the benefit that entangling gates are non-destructive, may be performed non-locally, and there is no need for efficient single photon detection. In this paper we examine practical issues affecting its experimental implementation. In particular, we analyze the effects of post-selection errors, qubit loss, bus loss, mismatched coupling rates and mode-mismatch. We derive error models for these effects and relate them to realistic fault-tolerant thresholds, providing insight into realistic experimental requirements.

quant-ph↗

Comparison of architectures for approximating number-resolving photo-detection using non-number-resolving detectors

Number-resolving photo-detection is necessary for many quantum optics experiments, especially in the application of entangled state preparation. Several schemes have been proposed for approximating number-resolving photo-detection using non-number-resolving detectors. Such techniques include multi-port detection and time-division multiplexing. We provide a detailed analysis and comparison of different number-resolving detection schemes, with a view to creating a useful reference for experimentalists. We show that the ideal architecture for projective measurements is a function of the detector's dark count and efficiency parameters. We also describe a process for selecting an appropriate topology given actual experimental component parameters.

quant-ph↗

Noise thresholds for entanglement purification

We consider the effects of gate noise on the operation of an entanglement purification protocol. We characterize the performance of the protocol by two measures, the minimum purifiable input state fidelity, and the maximum output state fidelity. Both these measures are a function of gate error rate. For sufficiently large gate error rate these two measures converge, defining a threshold on gate error rates. Numerically, we estimate this threshold to be $9.2\times 10^{-2}$, which is achievable with many present day experimental architectures. (This paper is written in an experimental rapid communication format).

quant-ph↗

Practical effects in cat state breeding

A cat state is a superposition of macroscopically distinct states. In quantum optics one such type of state is a superposition of distinct coherent states. Recently, a protocol has been proposed for preparing large optical cat states from a resource of smaller ones. We consider the effects of mode-mismatch and loss in the preparation of large cat states using this protocol with a view to understand experimental limitations. (This paper is written in an experimental rapid communication format).

quant-ph↗

Error propagation in loss- and failure-tolerant quantum computation schemes

Qubit loss and gate failure are significant obstacles for the implementation of scalable quantum computation. Recently there have been several proposals for overcoming these problems, including schemes based on parity and cluster states. While effective at dealing with loss and gate failure, these schemes typically lead to a blow-out in effective depolarizing noise rates. In this supplementary paper we present a detailed analysis of this problem and techniques for minimizing it.

quant-ph↗

Strategies for the preparation of large cluster states using non-deterministic gates

The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using non-deterministic gates. A key question in this context is the relative efficiencies of different `strategies', i.e. in what order should the non-deterministic gates be applied, in order to maximize the size of the resulting cluster states? In this paper we consider this issue in the context of `large' cluster states. Specifically, we assume an unlimited resource of qubits and ask what the steady state rate at which `large' clusters are prepared from this resource is, given an entangling gate with particular characteristics. We measure this rate in terms of the number of entangling gate operations that are applied. Our approach works for a variety of different entangling gate types, with arbitrary failure probability. Our results indicate that strategies whereby one preferentially bonds together identical qubits are considerably more efficient than those in which one does not. Additionally, compared to earlier analytic results, our numerical study offers substantially improved resource scaling.

quant-ph↗

Error tolerance and tradeoffs in loss- and failure-tolerant quantum computing schemes

Qubit loss and gate failure are significant problems for the development of scalable quantum computing. Recently various schemes have been proposed for tolerating qubit loss and gate failure. These include schemes based on cluster and parity states. We show that by designing such schemes specifically to tolerate these error types we cause an exponential blow-out in depolarizing noise. We discuss several examples and propose techniques for minimizing this problem. In general this introduces a tradeoff with other undesirable effects. In some cases this is physical resource requirements, while in others it is noise rates.

quant-ph↗

Quantum state tomography of single photons in the spectral degree of freedom

Quantum State Tomography (QST) of optical states is typically performed in the photon number degree of freedom, a procedure which is well understood and has been experimentally demonstrated. However, optical states have other degrees of freedom than just photon number, such as the spatial and temporal/spectral ones. Full characterization of photonic states requires state reconstruction in these additional degrees of freedom. In this paper we present a technique for performing QST of single photon states in the spectral degree of freedom. This is of importance, for example, in quantum information processing applications, which typically impose strict requirements on the purity and distinguishability of independently produced single photons. The described technique allows for full reconstruction of the spectral density matrix, allowing the purity and distinguishability of different sources to be readily calculated.

quant-ph↗

Error models for mode-mismatch in linear optics quantum computing

One of the most significant challenges facing the development of linear optics quantum computing (LOQC) is mode-mismatch, whereby photon distinguishability is introduced within circuits, undermining quantum interference effects. We examine the effects of mode-mismatch on the parity (or fusion) gate, the fundamental building block in several recent LOQC schemes. We derive simple error models for the effects of mode-mismatch on its operation, and relate these error models to current fault tolerant threshold estimates.

quant-ph↗

Practical limitations in optical entanglement purification

Entanglement purification protocols play an important role in the distribution of entangled systems, which is necessary for various quantum information processing applications. We consider the effects of photo-detector efficiency and bandwidth, channel loss and mode-mismatch on the operation of an optical entanglement purification protocol. We derive necessary detector and mode-matching requirements to facilitate practical operation of such a scheme, without having to resort to destructive coincidence type demonstrations.

quant-ph↗

Modeling photo-detectors in quantum optics

Photo-detection plays a fundamental role in experimental quantum optics and is of particular importance in the emerging field of linear optics quantum computing. Present theoretical treatment of photo-detectors is highly idealized and fails to consider many important physical effects. We present a physically motivated model for photo-detectors which accommodates for the effects of finite resolution, bandwidth and efficiency, as well as dark-counts and dead-time. We apply our model to two simple well known applications, which illustrates the significance of these characteristics.

quant-ph↗

Quantum gate characterization in an extended Hilbert space

We describe an approach for characterizing the process of quantum gates using quantum process tomography, by first modeling them in an extended Hilbert space, which includes non-qubit degrees of freedom. To prevent unphysical processes from being predicted, present quantum process tomography procedures incorporate mathematical constraints, which make no assumptions as to the actual physical nature of the system being described. By contrast, the procedure presented here ensures physicality by placing physical constraints on the nature of quantum processes. This allows quantum process tomography to be performed using a smaller experimental data set, and produces parameters with a direct physical interpretation. The approach is demonstrated by example of mode-matching in an all-optical controlled-NOT gate. The techniques described are non-specific and could be applied to other optical circuits or quantum computing architectures.

quant-ph↗

Optimal photons for quantum information processing

Photonic quantum information processing schemes, such as linear optics quantum computing, and other experiments relying on single-photon interference, inherently require complete photon indistinguishability to enable the desired photonic interactions to take place. Mode-mismatch is the dominant cause of photon distinguishability in optical circuits. Here we study the effects of photon wave-packet shape on tolerance against the effects of mode-mismatch in linear optical circuits, and show that Gaussian distributed photons with large bandwidth are optimal. The result is general and holds for arbitrary linear optical circuits, including ones which allow for post-selection and classical feed-forward.

quant-ph↗

Frequency and temporal effects in linear optical quantum computing

Typically linear optical quantum computing (LOQC) models assume that all input photons are completely indistinguishable. In practice there will inevitably be non-idealities associated with the photons and the experimental setup which will introduce a degree of distinguishability between photons. We consider a non-deterministic optical controlled-NOT gate, a fundamental LOQC gate, and examine the effect of temporal and spectral distinguishability on its operation. We also consider the effect of utilizing non-ideal photon counters, which have finite bandwidth and time response.

quant-ph↗

Non-deterministic approximation of photon number discriminating detectors using non-discriminating detectors

We present a scheme for non-deterministically approximating photon number resolving detectors using non-discriminating detectors. The model is simple in construction and employs very few physical resources. Despite its non-determinism, the proposal may nonetheless be suitable for use in some quantum optics experiments in which non-determinism can be tolerated. We analyze the detection scheme in the context of an optical implementation of the controlled-NOT gate, an inherently non-deterministic device. This allows the gate's success probability to be traded away for improved gate fidelity, assuming high efficiency detectors. The scheme is compared to two other proposals, both deterministic, for approximating discriminating detectors using non-discriminating detectors: the cascade and time division multiplexing schemes.

quant-ph↗