Vlatko Vedral

Modern computation relies crucially on modular architectures, breaking a complex algorithm into self-contained subroutines. A client can then call upon a remote server to implement parts of the computation independently via an application programming interface (API). Present APIs relay only classical information. Here we implement a quantum API that enables a client to estimate the absolute value of the trace of a server-provided unitary $U$. We demonstrate that the algorithm functions correctly irrespective of what unitary $U$ the server implements or how the server specifically realizes $U$. Our experiment involves pioneering techniques to coherently swap qubits encoded within the motional states of a trapped \Yb ion, controlled on its hyperfine state. This constitutes the first demonstration of modular computation in the quantum regime, providing a step towards scalable, parallelization of quantum computation.

The NOT gate that flips a classical bit is ubiquitous in classical information processing. However its quantum analogue, the universal NOT (UNOT) gate that flips a quantum spin in any alignment into its antipodal counterpart is strictly forbidden. Here we explore the connection between this discrepancy and how UNOT gates affect classical and quantum correlations. We show that while a UNOT gate always preserves classical correlations between two spins, it can non-locally increase or decrease their shared discord in ways that allow violation of the data processing inequality. We experimentally illustrate this using a multi-level trapped \Yb ion that allows simulation of anti-unitary operations.

The entanglement properties of the phase transition in a two dimensional harmonic lattice, similar to the one observed in recent ion trap experiments, are discussed both, for finite number of particles and thermodynamical limit. We show that for the ground state at the critical value of the trapping potential two entanglement measures, the negativity between two neighbouring sites and the block entropy for blocks of size 1, 2 and 3, change abruptly. Entanglement thus indicates quantum phase transitions in general; not only in the finite dimensional case considered in [Phys. Rev. Lett. {\bf 93}, 250404 (2004)]. Finally, we consider the thermal state and compare its exact entanglement with a temperature entanglement witness introduced in [Phys. Rev. A {\bf 77} 062102 (2008)].

We show that bosonic fields may present anyonic behavior when interacting with a fermion in a Jaynes-Cummings-like model. The proposal is accomplished via the interaction of a two-level system with two quantized modes of a harmonic oscillator; under suitable conditions, the system acquires a fractional geometric phase. A crucial role is played by the entanglement of the system eigenstates, which provides a two-dimensional confinement in the effective evolution of the system, leading to the anyonic behavior. For a particular choice of parameters, we show that it is possible to transmute the statistics of the system continually from fermions to bosons. We also present an experimental proposal, in an ion-trap setup, in which fractional statistical features can be generated, controlled, and measured.

Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counter-part. In this review we explain the basic principles of quantum computation, including the construction of basic gates, and networks. We illustrate the power of quantum algorithms using the simple problem of Deutsch, and explain, again in very simple terms, the well known algorithm of Shor for factorisation of large numbers into primes. We then describe physical implementations of quantum computers, focusing on one in particular, the linear ion-trap realization. We explain that the main obstacle to building an actual quantum computer is the problem of decoherence, which we show may be circumvented using the methods of quantum error correction.