Single photon quantum non-demolition in the presence of inhomogeneous broadening

Electromagnetically induced transparency (EIT) has been often proposed for generating nonlinear optical effects at the single photon level; in particular, as a means to effect a quantum non-demolition measurement of a single photon field. Previous treatments have usually considered homogeneously broadened samples, but realisations in any medium will have to contend with inhomogeneous broadening. Here we reappraise an earlier scheme [Munro \textit{et al.} Phys. Rev. A \textbf{71}, 033819 (2005)] with respect to inhomogeneities and show an alternative mode of operation that is preferred in an inhomogeneous environment. We further show the implications of these results on a potential implementation in diamond containing nitrogen-vacancy colour centres. Our modelling shows that single mode waveguide structures of length $200 \mu\mathrm{m}$ in single-crystal diamond containing a dilute ensemble of NV$^-$ of only 200 centres are sufficient for quantum non-demolition measurements using EIT-based weak nonlinear interactions.Comment: 21 pages, 9 figures (some in colour) at low resolution for arXiv purpose

Normal, Abby Normal, Prefix Normal

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number $pnw(n)$ of prefix normal words of length $n$, showing that $pnw(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)$ for some $c$ and $pnw(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)$. We introduce efficient algorithms for testing the prefix normal property and a "mechanical algorithm" for computing prefix normal forms. We also include games which can be played with prefix normal words. In these games Alice wishes to stay normal but Bob wants to drive her "abnormal" -- we discuss which parameter settings allow Alice to succeed.Comment: Accepted at FUN '1

Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation

In this paper we introduce a design for an optical topological cluster state computer constructed exclusively from a single quantum component. Unlike previous efforts we eliminate the need for on demand, high fidelity photon sources and detectors and replace them with the same device utilised to create photon/photon entanglement. This introduces highly probabilistic elements into the optical architecture while maintaining complete specificity of the structure and operation for a large scale computer. Photons in this system are continually recycled back into the preparation network, allowing for a arbitrarily deep 3D cluster to be prepared using a comparatively small number of photonic qubits and consequently the elimination of high frequency, deterministic photon sources.Comment: 19 pages, 13 Figs (2 Appendices with additional Figs.). Comments welcom

Ancilla-based quantum simulation

We consider simulating the BCS Hamiltonian, a model of low temperature superconductivity, on a quantum computer. In particular we consider conducting the simulation on the qubus quantum computer, which uses a continuous variable ancilla to generate interactions between qubits. We demonstrate an O(N^3) improvement over previous work conducted on an NMR computer [PRL 89 057904 (2002) & PRL 97 050504 (2006)] for the nearest neighbour and completely general cases. We then go on to show methods to minimise the number of operations needed per time step using the qubus in three cases; a completely general case, a case of exponentially decaying interactions and the case of fixed range interactions. We make these results controlled on an ancilla qubit so that we can apply the phase estimation algorithm, and hence show that when N \geq 5, our qubus simulation requires significantly less operations that a similar simulation conducted on an NMR computer.Comment: 20 pages, 10 figures: V2 added section on phase estimation and performing controlled unitaries, V3 corrected minor typo

Quantum Computation by Communication

We present a new approach to scalable quantum computing--a ``qubus computer''--which realises qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be ``static'' matter qubits or ``flying'' optical qubits, but the scheme we focus on here is particularly suited to matter qubits. There is no requirement for direct interaction between the qubits. Universal two-qubit quantum gates may be effected by schemes which involve measurement of the bus mode, or by schemes where the bus disentangles automatically and no measurement is needed. In effect, the approach integrates together qubit degrees of freedom for computation with quantum continuous variables for communication and interaction.Comment: final published versio

Limits in the characteristic function description of non-Lindblad-type open quantum systems

In this paper I investigate the usability of the characteristic functions for the description of the dynamics of open quantum systems focussing on non-Lindblad-type master equations. I consider, as an example, a non-Markovian generalized master equation containing a memory kernel which may lead to nonphysical time evolutions characterized by negative values of the density matrix diagonal elements [S.M. Barnett and S. Stenholm, Phys. Rev. A {\bf 64}, 033808 (2001)]. The main result of the paper is to demonstrate that there exist situations in which the symmetrically ordered characteristic function is perfectly well defined while the corresponding density matrix loses positivity. Therefore nonphysical situations may not show up in the characteristic function. As a consequence, the characteristic function cannot be considered an {\it alternative complete} description of the non-Lindblad dynamics.Comment: Revised version. 4 pages, 1 figur

A Time-Space Tradeoff for Triangulations of Points in the Plane

In this paper, we consider time-space trade-offs for reporting a triangulation of points in the plane. The goal is to minimize the amount of working space while keeping the total running time small. We present the first multi-pass algorithm on the problem that returns the edges of a triangulation with their adjacency information. This even improves the previously best known random-access algorithm

Using decision analysis: connecting "classroom" and "field"

This paper reports on the findings of a small-scale research project investigating the views of social work students on the use of decision analysis. After giving the context of the research, the article reports on what was found when students, who had just completed a Decision Making and Risk module, were asked for their opinions on the component parts of decision analysis, its use as a practice tool and their attitudes to using it on placement. The research found that the respondents in general took a critical and supportive stance towards the use of decision analysis in social work and, with extra teaching and a positive approach from their practice assessor, would be happy to use decision analysis. When the same group of students completed a follow-up questionnaire on a placement recall day, half of them had thought about using decision analysis but only three had gone on to discuss this with their practice assessors. Some issues in relation to connecting 'classroom' and 'field' are identified and the paper concludes that a number of further steps would be necessary to realise the potential of decision analysis to help students be more systematic and analytical in their approach to decision makin

Proposal for the Measurement of Bell-like Correlations from Continuous Variables

We show theoretically that Bell-type correlations can be observed between continuous variable measurements performed on a parametric source. An auxiliary measurement, performed on the detection environment, negates the possibility of constructing a local realistic description of these correlations