arXiv subjects

Alastair Kay

Publications and source records attributed to Alastair Kay.

72 records · Page 4Linked to original sources

arXiv2008

Many body effects and cluster state quantum computation in strongly interacting systems of photons

We discuss the basic properties of a recently proposed hybrid light-matter system of strongly interacting photons in an array of coupled cavities each doped with a single two level system. Using the non-linearity generated from the photon blockade effect, we predict strong correlations between the hopping photons in the array, and show the possibility of observing a phase transition from a polaritonic insulator to a superfluid of photons. In the Mott phase, this interaction can be mapped to an array of spins. We show how the remaining Hamiltonian, in conjunction with individual spin manipulation, can thus be used for simulating spin chains (useful for state transfer protocols) and cluster state quantum computation.

quant-ph↗

arXiv2008

A Witness of Multipartite Entanglement Strata

We describe an entanglement witness for $N$-qubit mixed states based on the properties of $N$-point correlation functions. Depending on the degree of violation, this witness can guarantee that no more than $M$ qubits are separable from the rest of the state for any $M\leq N$, or that there is some genuine $M$-party or greater multipartite entanglement present. We illustrate the use our criterion by investigating the existence of entanglement in thermal stabilizer states, where we demonstrate that the witness is capable of witnessing bound-entangled states. Intriguingly, this entanglement can be shown to persist in the thermodynamic limit at arbitrary temperature.

quant-ph↗

arXiv2007

Implementing universal quantum gates in coupled cavities

We study a linear array of coupled cavities interacting with two level systems and show how to construct individually addressable qubits in this system from the long-lived atom-photon excitations (polaritons) at each site. We derive the system dynamics and show that is described by an XY Hamiltonian. We proceed by showing how to implement non-local quantum gates and show that combined with the inherent ability for individual addressing, universal quantum computation is possible in this system. We finally discuss the prospects for experimental implementation using various technologies involving dopants as atoms, quantum dots or Cooper pair boxes.

quant-ph↗

arXiv2007

Cluster state quantum computation in coupled cavity arrays

Measurement-based quantum computation has revolutionized quantum information processing, and the physical systems with which it can be implemented. One simply needs the ability to prepare a particular state, known as the cluster state, and subsequently to perform single-qubit measurements on it. Nevertheless, a scalable implementation is yet to be realized. Here we propose a hybrid light-matter system comprised of coupled cavities interacting with two level systems. Utilising the stable, individually addressable, qubits resulting from the localised long-lived atom-photon excitations, we demonstrate how to use the natural system dynamics to `weave' these qubits into a cluster state and propose the implementation of quantum algorithms employing just two rows of qubits. Finally, we briefly discuss the prospects for experimental implementation using atoms, quantum dots or Cooper pair boxes.

quant-ph↗

arXiv2007

Multipartite purification protocols: upper and optimal bounds

A method for producing an upper bound for all multipartite purification protocols is devised, based on knowing the optimal protocol for purifying bipartite states. When applied to a range of noise models, both local and correlated, the optimality of certain protocols can be demonstrated for a variety of graph and valence bond states.

quant-ph↗

arXiv2007

A QMA-Complete Translationally Invariant Hamiltonian Problem and the Complexity of Finding Ground State Energies in Physical Systems

Here we present a problem related to the local Hamiltonian problem (identifying whether the ground state energy falls within one of two ranges) which is restricted to being translationally invariant. We prove that for problems with a fixed local dimension and O(\log(N))-body local terms, or local dimension N and 2-body terms, there are instances of the problem which are QMA-complete. We discuss the implications for the computational complexity of finding ground states of these systems, and hence for any classical approximation techniques that one could apply including DMRG, Matrix Product States and MERA. One important example is a 1D lattice of bosons with nearest-neighbor hopping at constant filling fraction i.e. a generalization of the Bose-Hubbard model.

quant-ph↗

arXiv2007

Deriving a Fault-Tolerant Threshold for a Global Control Scheme

In this paper, adapted from the author's PhD thesis, we present otherwise unpublished results relating to global control schemes, culminating in the calculation of a fault-tolerant threshold for one such scheme. As with early fault-tolerant threshold results, the aim is to calculate a positive number, not to optimise it. We also discuss how the results might affect other related schemes, such as those based on cellular automata.

quant-ph↗

arXiv2007

The Impossibility of Quantum State Mirroring on Square Lattices

We discuss the possibility of engineering a Hamiltonian that can perfectly mirror a state of many excitations stored on a square lattice. In comparison to the well-studied case of a chain, there is potential for a speed-up of information transfer. However, we prove that in a large class of cases, perfect state mirroring on a square lattice is impossible.

quant-ph↗

arXiv2006

Optimal purification of thermal graph states

In this paper, a purification protocol is presented and its performance is proven to be optimal when applied to a particular subset of graph states that are subject to local Z-noise. Such mixed states can be produced by bringing a system into thermal equilibrium, when it is described by a Hamiltonian which has a particular graph state as its unique ground state. From this protocol, we derive the exact value of the critical temperature above which purification is impossible, as well as the related optimal purification rates. A possible simulation of graph Hamiltonians is proposed, which requires only bipartite interactions and local magnetic fields, enabling the tuning of the system temperature.

quant-ph↗

arXiv2006

Perfect State Transfer: Beyond Nearest-Neighbor Couplings

In this paper we build on the ideas presented in previous works for perfectly transferring a quantum state between opposite ends of a spin chain using a fixed Hamiltonian. While all previous studies have concentrated on nearest-neighbor couplings, we demonstrate how to incorporate additional terms in the Hamiltonian by solving an Inverse Eigenvalue Problem. We also explore issues relating to the choice of the eigenvalue spectrum of the Hamiltonian, such as the tolerance to errors and the rate of information transfer.

quant-ph↗

arXiv2005

Local Cloning of Arbitrarily Entangled Multipartite States

We examine the perfect cloning of non-local, orthogonal states with only local operations and classical communication. We provide a complete characterisation of the states that can be cloned under these restrictions, and their relation to distinguishability. We also consider the case of catalytic cloning, which we show provides no enhancement to the set of clonable states.

quant-ph↗

arXiv2005

Error Correcting the Control Unit in Global Control Schemes

Recent studies of globally controlled structures have culminated in a theoretical demonstration that fault-tolerant quantum computation can be carried out on a one--dimensional chain with control over two global fields only. This required some patterns of classical states to localise operations, which were stabilised with the Zeno effect. However, it is impossible to achieve perfect stabilisation using this method, so error correction of these states is desirable, and is the focus this paper.

quant-ph↗

arXiv2005

Geometric Effects and Computation in Spin Networks

When initially introduced, a Hamiltonian that realises perfect transfer of a quantum state was found to be analogous to an x-rotation of a large spin. In this paper we extend the analogy further to demonstrate geometric effects by performing rotations on the spin. Such effects can be used to determine properties of the chain, such as its length, in a robust manner. Alternatively, they can form the basis of a spin network quantum computer. We demonstrate a universal set of gates in such a system by both dynamical and geometrical means.

quant-ph↗

arXiv2005

Graph State Preparation and Cluster Computation with Global Addressing of Optical Lattices

We present a novel way to manipulate ultra-cold atoms where four atomic levels are trapped by appropriately tuned optical lattices. When employed to perform quantum computation via global control, this unique structure dramatically reduces the number of steps involved in the control procedures, either for the standard, network, model, or for one-way quantum computation. The use of a far-blue detuned lattice and a magnetically insensitive computational basis makes the scheme robust against decoherence. The present scheme is a promising candidate for experimental implementation of quantum computation and for graph state preparation in one, two or three spatial dimensions.

quant-ph↗

arXiv2004

Perfect Transfer of Arbitrary States in Quantum Spin Networks

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to $N$-qubit spin networks of identical qubit couplings, we show that $2\log_3 N$ is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done in PRL 92, 187902.

quant-ph↗

arXiv2004

Quantum error correction in globally controlled arrays

An interesting concept in quantum computation is that of global control (GC), where there is no need to manipulate qubits individually. One can implement a universal set of quantum gates on a one-dimensional array purely via signals that target the entire structure indiscriminately. But large-scale quantum computation imposes several requirements in terms of noise level, time, space (scaling) and in particular parallelism. Keeping in mind these requirements, we prove GC can support error-correction, by implementing two simple codes. This opens the way to fault-tolerant computation with this type of architecture.

quant-ph↗

arXiv2004

Quantum computation in optical lattices via global laser addressing

A scheme for globally addressing a quantum computer is presented along with its realisation in an optical lattice setup of one, two or three dimensions. The required resources are mainly those necessary for performing quantum simulations of spin systems with optical lattices, circumventing the necessity for single qubit addressing. We present the control procedures, in terms of laser manipulations, required to realise universal quantum computation. Error avoidance with the help of the quantum Zeno effect is presented and a scheme for globally addressed error correction is given. The latter does not require measurements during the computation, facilitating its experimental implementation. As an illustrative example, the pulse sequence for the factorisation of the number fifteen is given.

quant-ph↗

arXiv2004

Quantum information and triangular optical lattices

The regular structures obtained by optical lattice technology and their behaviour are analysed from the quantum information perspective. Initially, we demonstrate that a triangular optical lattice of two atomic species, bosonic or fermionic, can be employed to generate a variety of novel spin-1/2 models that include effective three-spin interactions. Such interactions can be employed to simulate specific one or two dimensional physical systems that are of particular interest for their condensed matter and entanglement properties. In particular, connections between the scaling behaviour of entanglement and the entanglement properties of closely spaced spins are drawn. Moreover, three-spin interactions are well suited to support quantum computing without the need to manipulate individual qubits. By employing Raman transitions or the interaction of the atomic electric dipole moment with magnetic field gradients, one can generate Hamiltonians that can be used for the physical implementation of geometrical or topological objects. This work serves as a review article that also includes many new results.

quant-ph↗