Alexei Gilchrist

Distance measures to compare real and ideal quantum processes

With growing success in experimental implementations it is critical to identify a gold standard for quantum information processing, a single measure of distance that can be used to compare and contrast different experiments. We enumerate a set of criteria that such a distance measure must satisfy to be both experimentally and theoretically meaningful. We then assess a wide range of possible measures against these criteria, before making a recommendation as to the best measures to use in characterizing quantum information processing.

Measuring entangled qutrits and their use for quantum bit commitment.

We produce and holographically measure entangled qudits encoded in transverse spatial modes of single photons. With the novel use of a quantum state tomography method that only requires two-state superpositions, we achieve the most complete characterization of entangled qutrits to date. Ideally, entangled qutrits provide better security than qubits in quantum bit commitment: we model the sensitivity of this to mixture and show experimentally and theoretically that qutrits with even a small amount of decoherence cannot offer increased security over qubits.

Quantum Process Tomography of a Controlled-NOT Gate

We demonstrate complete characterization of a two-qubit entangling process--a linear optics controlled-NOT gate operating with coincident detection--by quantum process tomography. We use a maximum-likelihood estimation to convert the experimental data into a physical process matrix. The process matrix allows an accurate prediction of the operation of the gate for arbitrary input states and a calculation of gate performance measures such as the average gate fidelity, average purity, and entangling capability of our gate, which are 0.90, 0.83, and 0.73, respectively.

Experimental Demonstration of a Compiled Version of Shor's Algorithm with Quantum Entanglement

Shors powerful quantum algorithm for factoring represents a major challenge in quantum computation. Here, we implement a compiled version in a photonic system. For the first time, we demonstrate the core processes, coherent control, and resultant entangled states required in a full-scale implementation. These are necessary steps on the path towards scalable quantum computing. Our results highlight that the algorithm performance is not the same as that of the underlying quantum circuit and stress the importance of developing techniques for characterizing quantum algorithms.

Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.

Time-Reversal and Super-Resolving Phase Measurements

We demonstrate phase super-resolution in the absence of entangled states. The key insight is to use the inherent time-reversal symmetry of quantum mechanics: our theory shows that it is possible to measure, as opposed to prepare, entangled states. Our approach is robust, requiring only photons that exhibit classical interference: we experimentally demonstrate high-visibility phase super-resolution with three, four, and six photons using a standard laser and photon counters. Our six-photon experiment demonstrates the best phase super-resolution yet reported with high visibility and resolution.

Efficient Toffoli gates using qudits

The simplest decomposition of a Toffoli gate acting on three qubits requires five 2-qubit gates. If we restrict ourselves to controlled-sign (or controlled-NOT) gates this number climbs to six. We show that the number of controlled-sign gates required to implement a Toffoli gate can be reduced to just three if one of the three quantum systems has a third state that is accessible during the computation, i.e. is actually a qutrit. Such a requirement is not unreasonable or even atypical since we often artificially enforce a qubit structure on multilevel quantums systems (eg. atoms, photonic polarization and spatial modes). We explore the implementation of these techniques in optical quantum processing and show that linear optical circuits could operate with much higher probabilities of success.

Quantum dynamics as a physical resource

How useful is a quantum dynamical operation for quantum information processing? Motivated by this question, we investigate several strength measures quantifying the resources intrinsic to a quantum operation. We develop a general theory of such strength measures, based on axiomatic considerations independent of state-based resources. The power of this theory is demonstrated with applications to quantum communication complexity, quantum computational complexity, and entanglement generation by unitary operations.

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 nonlinearities can dramatically extend the range of possible transforms on biphotonic qutrits-three-level quantum systems formed by the polarization of two photons in the same spatiotemporal mode. We fully characterize the biphoton-photon entanglement that underpins our technique, thereby realizing 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.

Loss-tolerant optical qubits

We present a linear optics quantum computation scheme that employs a new encoding approach that incrementally adds qubits and is tolerant to photon loss errors. The scheme employs a circuit model but uses techniques from cluster-state computation and achieves comparable resource usage. To illustrate our techniques we describe a quantum memory which is fault tolerant to photon loss.