arXiv subjects

B. P. Lanyon

Publications and source records attributed to B. P. Lanyon.

29 records · Page 2Linked to original sources

arXiv2013

Generation of quantum discord between ionic qubits via noisy processes

Quantum systems in mixed states can be unentangled and yet still correlated in a way that is not possible for classical systems. These correlations can be quantified by the quantum discord and might provide a resource for certain mixed-state quantum information processing tasks. Here we report on the generation of discordant states of two trapped atomic ions via Markovian decoherence processes. While entanglement is strictly non-increasing under such operations, discord can be generated in various forms. Firstly we show that, starting from two classically correlated qubits, it is possible to generate discord by applying decoherence to just one of them. Secondly, even when starting with completely uncorrelated systems, we show that discord can be generated via classically correlated decoherence processes. Finally, the Werner states are created. The generated states can be used as a resource state for quantum information transmission and could be readily extended to more ions.

quant-ph↗

arXiv2013

Deterministic generation of arbitrary symmetric states and entanglement classes

We propose a method to generate arbitrary symmetric states of N qubits, which can be easily associated with their entanglement classes. It is particularly suited to quantum optics systems like trapped ions or superconducting circuits. We encode each qubit in two metastable levels of the system and use a bosonic quantum bus for creating the states. The method is deterministic and relies on a sequence of selective unitary gates upon the qubits within the system coherence time.

quant-ph↗

arXiv2011

Universal digital quantum simulation with trapped ions

A digital quantum simulator is an envisioned quantum device that can be pro- grammed to efficiently simulate any other local system. We demonstrate and investigate the digital approach to quantum simulation in a system of trapped ions. Using sequences of up to 100 gates and 6 qubits, the full time dynamics of a range of spin systems are digitally simulated. Interactions beyond those naturally present in our simulator are accurately reproduced and quantitative bounds are provided for the overall simulation quality. Our results demon- strate the key principles of digital quantum simulation and provide evidence that the level of control required for a full-scale device is within reach.

quant-ph↗

arXiv2010

Discrete single-photon quantum walks with tunable decoherence

Quantum walks have a host of applications, ranging from quantum computing to the simulation of biological systems. We present an intrinsically stable, deterministic implementation of discrete quantum walks with single photons in space. The number of optical elements required scales linearly with the number of steps. We measure walks with up to 6 steps and explore the quantum-to-classical transition by introducing tunable decoherence. Finally, we also investigate the effect of absorbing boundaries and show that decoherence significantly affects the probability of absorption.

quant-ph↗

arXiv2010

Experimental feedback control of quantum systems using weak measurements

A goal of the emerging field of quantum control is to develop methods for quantum technologies to function robustly in the presence of noise. Central issues are the fundamental limitations on the available information about quantum systems and the disturbance they suffer in the process of measurement. In the context of a simple quantum control scenario--the stabilization of non-orthogonal states of a qubit against dephasing--we experimentally explore the use of weak measurements in feedback control. We find that, despite the intrinsic difficultly of implementing them, weak measurements allow us to control the qubit better in practice than is even theoretically possible without them. Our work shows that these more general quantum measurements can play an important role for feedback control of quantum systems.

quant-ph↗

arXiv2009

Violation of the Leggett-Garg inequality with weak measurements of photons

By weakly measuring the polarization of a photon between two strong polarization measurements, we experimentally investigate the correlation between the appearance of anomalous values in quantum weak measurements, and the violation of realism and non-intrusiveness of measurements. A quantitative formulation of the latter concept is expressed in terms of a Leggett-Garg inequality for the outcomes of subsequent measurements of an individual quantum system. We experimentally violate the Leggett-Garg inequality for several measurement strengths. Furthermore, we experimentally demonstrate that there is a one-to-one correlation between achieving strange weak values and violating the Leggett-Garg inequality.

quant-ph↗

arXiv2008

Experimental quantum computing without entanglement

Entanglement is widely believed to lie at the heart of the advantages offered by a quantum computer. This belief is supported by the discovery that a noiseless (pure) state quantum computer must generate a large amount of entanglement in order to offer any speed up over a classical computer. However, deterministic quantum computation with one pure qubit (DQC1), which employs noisy (mixed) states, is an efficient model that generates at most a marginal amount of entanglement. Although this model cannot implement any arbitrary algorithm it can efficiently solve a range of problems of significant importance to the scientific community. Here we experimentally implement a first-order case of a key DQC1 algorithm and explicitly characterise the non-classical correlations generated. Our results show that while there is no entanglement the algorithm does give rise to other non-classical correlations, which we quantify using the quantum discord - a stronger measure of non-classical correlations that includes entanglement as a subset. Our results suggest that discord could replace entanglement as a necessary resource for a quantum computational speed-up. Furthermore, DQC1 is far less resource intensive than universal quantum computing and our implementation in a scalable architecture highlights the model as a practical short-term goal.

quant-ph↗

arXiv2008

Quantum computing using shortcuts through higher dimensions

Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have been demonstrated in several physical architectures. A serious obstacle to a full-scale implementation is the sheer number of these gates required to implement even small quantum algorithms. Here we present and demonstrate a general technique that harnesses higher dimensions of quantum systems to significantly reduce this number, allowing the construction of key quantum circuits with existing technology. We are thereby able to present the first implementation of two key quantum circuits: the three-qubit Toffoli and the two-qubit controlled-unitary. The gates are realised in a linear optical architecture, which would otherwise be absolutely infeasible with current technology.

quant-ph↗

arXiv2008

Experimentally generating and tuning robust entanglement between photonic qubits

We generate and study the entanglement properties of novel states composed of three polarisation-encoded photonic qubits. By varying a single experimental parameter we can coherently move from a fully separable state to a maximally robust W state, while at all times preserving an optimally robust, symmetric entanglement configuration. We achieve a high fidelity with these configurations experimentally, including the highest reported W state fidelity.

quant-ph↗

arXiv2007

Manipulating biphotonic qutrits

Quantum information carriers with higher dimension than the canonical qubit offer significant advantages. However, manipulating such systems is extremely difficult. We show how measurement induced non-linearities can be employed to dramatically extend the range of possible transforms on biphotonic qutrits; the three level quantum systems formed by the polarisation of two photons in the same spatio-temporal mode. We fully characterise the biphoton-photon entanglement that underpins our technique, thereby realising the first instance of qubit-qutrit entanglement. We discuss an extension of our technique to generate qutrit-qutrit entanglement and to manipulate any bosonic encoding of quantum information.

quant-ph↗

arXiv2007

Experimental demonstration of Shor's algorithm with quantum entanglement

Shor's powerful quantum algorithm for factoring represents a major challenge in quantum computation and its full realization will have a large impact on modern cryptography. Here we implement a compiled version of Shor's algorithm in a photonic system using single photons and employing the non-linearity induced by measurement. For the first time we demonstrate the core processes, coherent control, and resultant entangled states that are required in a full-scale implementation of Shor's algorithm. Demonstration of these processes is a necessary step on the path towards a full implementation of Shor's algorithm and scalable quantum computing. Our results highlight that the performance of a quantum algorithm is not the same as performance of the underlying quantum circuit, and stress the importance of developing techniques for characterising quantum algorithms.

quant-ph↗