Error models for mode mismatch in linear optics quantum computing

One of the most significant challenges facing the development of linear optics quantum computing (LOQC) is mode mismatch, whereby photon distinguishability is introduced within circuits, undermining quantum interference effects. We examine the effects of mode mismatch on the parity (or fusion) gate, the fundamental building block in several recent LOQC schemes. We derive simple error models for the effects of mode mismatch on its operation, and relate these error models to current fault-tolerant-threshold estimates.

Micro-Fabricated Surface Trap and Cavity Integration for Trapped Ion Quantum Computing

Atomic ions trapped in micro-fabricated surface traps can be utilized as a physical platform with which to build a quantum computer. They possess many of the desirable qualities of such a device, including high fidelity state preparation and readout, universal logic gates, long coherence times, and can be readily entangled with each other through photonic interconnects. The use of optical cavities integrated with trapped ion qubits as a photonic interface presents the possibility for order of magnitude improvements in performance in several key areas of their use in quantum computation. The first part of this thesis describes the design and fabrication of a novel surface trap for integration with an optical cavity. The trap is custom made on a highly reflective mirror surface and includes the capability of moving the ion trap location along all three trap axes with nanometer scale precision. The second part of this thesis demonstrates the suitability of small micro-cavities formed from laser ablated fused silica substrates with radii of curvature in the 300-500 micron range for use with the mirror trap as part of an integrated ion trap cavity system. Quantum computing applications for such a system include dramatic improvements in the photonic entanglement rate up to 10 kHz, the qubit measurement time down to 1 microsecond, and the measurement error rates down to the 10e-5 range. The final part of this thesis details a performance simulator for exploring the physical resource requirements and performance demands to scale such a quantum computer to sizes capable of performing quantum algorithms beyond the limits of classical computation.

Quantum error correction with biased noise

Quantum computing offers powerful new techniques for speeding up the calculation of many classically intractable problems. Quantum algorithms can allow for the efficient simulation of physical systems, with applications to basic research, chemical modeling, and drug discovery; other algorithms have important implications for cryptography and internet security.

At the same time, building a quantum computer is a daunting task, requiring the coherent manipulation of systems with many quantum degrees of freedom while preventing environmental noise from interacting too strongly with the system. Fortunately, we know that, under reasonable assumptions, we can use the techniques of quantum error correction and fault tolerance to achieve an arbitrary reduction in the noise level.

In this thesis, we look at how additional information about the structure of noise, or "noise bias," can improve or alter the performance of techniques in quantum error correction and fault tolerance. In Chapter 2, we explore the possibility of designing certain quantum gates to be extremely robust with respect to errors in their operation. This naturally leads to structured noise where certain gates can be implemented in a protected manner, allowing the user to focus their protection on the noisier unprotected operations.

In Chapter 3, we examine how to tailor error-correcting codes and fault-tolerant quantum circuits in the presence of dephasing biased noise, where dephasing errors are far more common than bit-flip errors. By using an appropriately asymmetric code, we demonstrate the ability to improve the amount of error reduction and decrease the physical resources required for error correction.

In Chapter 4, we analyze a variety of protocols for distilling magic states, which enable universal quantum computation, in the presence of faulty Clifford operations. Here again there is a hierarchy of noise levels, with a fixed error rate for faulty gates, and a second rate for errors in the distilled states which decreases as the states are distilled to better quality. The interplay of of these different rates sets limits on the achievable distillation and how quickly states converge to that limit.

The power of quantum Fourier sampling

How powerful are Quantum Computers? Despite the prevailing belief that Quantum Computers are more powerful than their classical counterparts, this remains a conjecture backed by little formal evidence. Shor's famous factoring algorithm [Shor97] gives an example of a problem that can be solved efficiently on a quantum computer with no known efficient classical algorithm. Factoring, however, is unlikely to be NP-Hard, meaning that few unexpected formal consequences would arise, should such a classical algorithm be discovered. Could it then be the case that any quantum algorithm can be simulated efficiently classically? Likewise, could it be the case that Quantum Computers can quickly solve problems much harder than factoring? If so, where does this power come from, and what classical computational resources do we need to solve the hardest problems for which there exist efficient quantum algorithms?

We make progress toward understanding these questions through studying the relationship between classical nondeterminism and quantum computing. In particular, is there a problem that can be solved efficiently on a Quantum Computer that cannot be efficiently solved using nondeterminism? In this thesis we address this problem from the perspective of sampling problems. Namely, we give evidence that approximately sampling the Quantum Fourier Transform of an efficiently computable function, while easy quantumly, is hard for any classical machine in the Polynomial Time Hierarchy. In particular, we prove the existence of a class of distributions that can be sampled efficiently by a Quantum Computer, that likely cannot be approximately sampled in randomized polynomial time with an oracle for the Polynomial Time Hierarchy.

Our work complements and generalizes the evidence given in Aaronson and Arkhipov's work [AA2013] where a different distribution with the same computational properties was given. Our result is more general than theirs, but requires a more powerful quantum sampler.

Scalable quantum memory in the ultrastrong coupling regime

Circuit quantum electrodynamics, consisting of superconducting artificial atoms coupled to on-chip resonators, represents a prime candidate to implement the scalable quantum computing architecture because of the presence of good tunability and controllability. Furthermore, recent advances have pushed the technology towards the ultrastrong coupling regime of light-matter interaction, where the qubit-resonator coupling strength reaches a considerable fraction of the resonator frequency. Here, we propose a qubit-resonator system operating in that regime, as a quantum memory device and study the storage and retrieval of quantum information in and from the Z(2) parity-protected quantum memory, within experimentally feasible schemes. We are also convinced that our proposal might pave a way to realize a scalable quantum random-access memory due to its fast storage and readout performances.

Electrically controllable RKKY interaction in semiconductor quantum wires

We demonstrate in theory that it is possible to all-electrically manipulate the RKKY interaction in a quasi-one-dimensional electron gas embedded in a semiconductor heterostructure, in the presence of Rashba and Dresselhaus spin-orbit interaction. In an undoped semiconductor quantum wire where intermediate excitations are gapped, the interaction becomes the short-ranged Bloembergen-Rowland superexchange interaction. Owing to the interplay of different types of spin-orbit interaction, the interaction can be controlled to realize various spin models, e.g., isotropic and anisotropic Heisenberg-like models, Ising-like models with additional Dzyaloshinsky-Moriya terms, by tuning the external electric field and designing the crystallographic directions. Such controllable interaction forms a basis for quantum computing with localized spins and quantum matters in spin lattices.

Quantum measurement of a solid-state qubit: A unified quantum master equation approach

Quantum measurement of a solid-state qubit by a mesoscopic detector is of fundamental interest in quantum physics and an essential issue in quantum computing. In this work, by employing a unified quantum master equation approach constructed in our recent publications, we study the measurement-induced relaxation and dephasing of the coupled-quantum-dot states measured by a quantum-point contact. Our treatment pays particular attention on the detailed-balance relation, which is a consequence of properly accounting for the energy exchange between the qubit and detector during the measurement process. As a result, our theory is applicable to measurement at arbitrary voltage and temperature. Both numerical and analytical results for the qubit relaxation and dephasing are carried out, and important features are highlighted in concern with their possible relevance to future experiments.

Quantum information processing with superconducting qubits in a microwave field

We investigate the quantum dynamics of a Cooper-pair box with a superconducting loop in the presence of a nonclassical microwave field. We demonstrate the existence of Rabi oscillations for both single- and multiphoton processes and, moreover, we propose a new quantum computing scheme (including one-bit and conditional two-bit gates) based on Josephson qubits coupled through microwaves.

Dephasing rate in an InAs/GaAs single-electron quantum dot qubit

We have obtained the parameter-phase diagram, which unambiguously defines the parameter region for the use of InAs/GaAs quantum dot as two-level quantum system in quantum computation in the framework of the effective-mass envelope function theory. Moreover, static electric field is found to efficiently prolong decoherence time. As a result, decoherence time may reach the order of magnitude of milli-seconds as external static electric field goes beyond 20 kV/cm if only vacuum fluctuation is taken as the main source for decoherence. Our calculated results are useful for guiding the solid-state implementation of quantum computing.

InAs/GaAs single-electron quantum dot qubit

The time evolution of the quantum mechanical state of an electron is calculated in the framework of the effective-mass envelope function theory for an InAs/GaAs quantum dot. The results indicate that the superposition state electron density oscillates in the quantum dot, with a period on the order of femtoseconds. The interaction energy E-ij between two electrons located in different quantum dots is calculated for one electron in the ith pure quantum state and another in the jth pure quantum state. We find that E-11]E-12]E-22, and E-ij decreases as the distance between the two quantum dots increases. We present a parameter-phase diagram which defines the parameter region for the use of an InAs/GaAs quantum dot as a two-level quantum system in quantum computation. A static electric field is found to efficiently prolong the decoherence time. Our results should be useful for designing the solid-state implementation of quantum computing. (C) 2001 American Institute of Physics.

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP of Adleman, Demarrais, and Huang, a quantum analog of NP, is equal to the counting class coC=P.

Gapped Two-Body Hamiltonian for Continuous-Variable Quantum Computation

We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv) possess a constant energy gap proportional to the squared inverse of the squeezing. Their ground states are the celebrated Gaussian graph states, which are universal resources for quantum computation in the limit of infinite squeezing. These Hamiltonians constitute the basic ingredient for the adiabatic preparation of graph states and thus open new venues for the physical realization of continuous-variable quantum computing beyond the standard optical approaches. We characterize the correlations in these systems at thermal equilibrium. In particular, we prove that the correlations across any multipartition are contained exactly in its boundary, automatically yielding a correlation area law. © 2011 American Physical Society.

Quantum nonlocality, cryptography and complexity

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal

Quantum control of electromagnetically induced transparency dispersion via atomic tunneling in a double-well Bose-Einstein condensate

Electromagnetically induced transparency (EIT) is an important tool for controlling light propagation and nonlinear wave mixing in atomic gases with potential applications ranging from quantum computing to table top tests of general relativity. Here we consider EIT in an atomic Bose-Einstein condensate (BEC) trapped in a double-well potential. A weak probe laser propagates through one of the wells and interacts with atoms in a three-level Lambda configuration. The well through which the probe propagates is dressed by a strong control laser with Rabi frequency Omega(mu), as in standard EIT systems. Tunneling between the wells at the frequency g provides a coherent coupling between identical electronic states in the two wells, which leads to the formation of interwell dressed states. The macroscopic interwell coherence of the BEC wave function results in the formation of two ultranarrow absorption resonances for the probe field that are inside of the ordinary EIT transparency window. We show that these new resonances can be interpreted in terms of the interwell dressed states and the formation of a type of dark state involving the control laser and the interwell tunneling. To either side of these ultranarrow resonances there is normal dispersion with very large slope controlled by g. We discuss prospects for observing these ultranarrow resonances and the corresponding regions of high dispersion experimentally.

Experimental requirements for Grover's algorithm in optical quantum computation

The field of linear optical quantum computation (LOQC) will soon need a repertoire of experimental milestones. We make progress in this direction by describing several experiments based on Grover's algorithm. These experiments range from a relatively simple implementation using only a single nonscalable controlled- NOT (CNOT) gate to the most complex, requiring two concatenated scalable CNOT gates, and thus form a useful set of early milestones for LOQC. We also give a complete description of basic LOQC using polarization-encoded qubits, making use of many simplifications to the original scheme of Knill, Laflamme, and Milburn [E. Knill, R. Laflamme, and G. J. Milburn, Nature (London) 409, 46 (2001)].