Fault-tolerant quantum computation by anyons

A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in pairs and observing the result of fusion. Such computation is fault-tolerant by its physical nature.     

Fault-tolerant quantum computation with long-range correlated noise

We prove a new version of the quantum accuracy threshold theorem that applies to non-Markovian noise with algebraically decaying spatial correlations. We consider noise in a quantum computer arising from a perturbation that acts collectively on pairs of qubits and on the environment, and we show that an arbitrarily long quantum computation can be executed with high reliability in D spatial dimensions, if the perturbation is sufficiently weak and decays with the distance r between the qubits faster than 1/r(D).     

Fault-tolerant quantum computation with high threshold in two dimensions

We present a scheme of fault-tolerant quantum computation for a local architecture in two spatial dimensions. The error threshold is 0.75% for each source in an error model with preparation, gate, storage, and measurement errors.     

Fault-tolerant topological one-way quantum computation with probabilistic two-qubit gates

We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be performed with the success probability of the two-qubit gate such as 0.5 (0.1) provided that the unheralded error probability of the two-qubit gate is less than 0.040% (0.016%). Furthermore, the resource usage is considerably suppressed compared to the conventional fault-tolerant schemes with probabilistic two-qubit gates.     

Pauli exchange errors in quantum computation

In many physically realistic models of quantum computation, Pauli exchange interactions cause a subset of 2-qubit errors to occur as a first-order effect of couplings within the computer, even in the absence of interactions with the computer's environment. We give an explicit 9-qubit code that corrects both Pauli exchange errors and all 1-qubit errors.     

Distributed quantum computation via optical fibers

We investigate the possibility of realizing effective quantum gates between two atoms in distant cavities coupled by an optical fiber. We show that highly reliable swap and entangling gates are achievable. We exactly study the stability of these gates in the presence of imperfections in coupling strengths and interaction times and prove them to be robust. Moreover, we analyze the effect of spontaneous emission and losses and show that such gates are very promising in view of the high level of coherent control currently achievable in optical cavities.     

Scalable photonic quantum computation through cavity-assisted interactions

We propose a scheme for scalable photonic quantum computation based on cavity-assisted interaction between single-photon pulses. The prototypical quantum controlled phase-flip gate between the single-photon pulses is achieved by successively reflecting them from an optical cavity with a single-trapped atom. Our proposed protocol is shown to be robust to practical noise and experimental imperfections in current cavity-QED setups.     

Measurement-only topological quantum computation via anyonic interferometry

We describe measurement-only topological quantum computation using both projective and interferometrical measurement of topological charge. We demonstrate how anyonic teleportation can be achieved using “forced measurement” protocols for both types of measurement. Using this, it is shown how topological charge measurements can be used to generate the braiding transformations used in topological quantum computation, and hence that the physical transportation of computational anyons is unnecessary. We give a detailed discussion of the anyonics for implementation of topological quantum computation (particularly, using the measurement-only approach) in fractional quantum Hall systems.     

Fault-tolerant quantum dynamical decoupling

Dynamical decoupling pulse sequences have been used to extend coherence times in quantum systems ever since the discovery of the spin-echo effect. Here we introduce a method of recursively concatenated dynamical decoupling pulses, designed to overcome both decoherence and operational errors. This is important for coherent control of quantum systems such as quantum computers. For bounded-strength, non-Markovian environments, such as for the spin-bath that arises in electron- and nuclear-spin based solid-state quantum computer proposals, we show that it is strictly advantageous to use concatenated pulses, as opposed to standard periodic dynamical decoupling pulse sequences. Namely, the concatenated scheme is both fault tolerant and superpolynomially more efficient, at equal cost. We derive a condition on the pulse noise level below which concatenation is guaranteed to reduce decoherence.     

Efficient refocusing of one-spin and two-spin interactions for NMR quantum computation

The use of spin echoes to refocus one-spin interactions (chemical shifts) and two-spin interactions (spin-spin couplings) plays a central role in both conventional NMR experiments and NMR quantum computation. Here we describe schemes for efficient refocusing of such interactions in both fully and partially coupled spin systems.     

Thermal states as universal resources for quantum computation with always-on interactions

Measurement-based quantum computation utilizes an initial entangled resource state and proceeds with subsequent single-qubit measurements. It is implicitly assumed that the interactions between qubits can be switched off so that the dynamics of the measured qubits do not affect the computation. By proposing a model spin Hamiltonian, we demonstrate that measurement-based quantum computation can be achieved on a thermal state with always-on interactions. Moreover, computational errors induced by thermal fluctuations can be corrected and thus the computation can be executed fault tolerantly if the temperature is below a threshold value.     

Loss tolerance in one-way quantum computation via counterfactual error correction

We introduce a scheme for fault tolerantly dealing with losses (or other "leakage" errors) in cluster state computation that can tolerate up to 50% qubit loss. This is achieved passively using an adaptive strategy of measurement--no coherent measurements or coherent correction is required. Since the scheme relies on inferring information about what would have been the outcome of a measurement had one been able to carry it out, we call this counterfactual error correction.     

Universal quantum computation with spin-1/2 pairs and Heisenberg exchange

An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only two Heisenberg gate operations are required to produce a controlled pi-phase shift, compared to nineteen for exchange-only proposals employing three spins. Evolved from well-studied decoherence-free subspaces, this architecture inherits immunity from collective decoherence mechanisms. The simplicity and adaptability of this approach should make it attractive for spin-based quantum computing architectures.     

几何量子计算

实现可集成的量子计算的关键步骤是实现保真度足够高的一组普适量子逻辑门，最近几年发展的几何量子计算使用几何位相来实现量子逻辑门，其特点是利用几何位相的整体几何性质来避免某些局域的无规噪声的影响，从而实现较高保真度的量子门，文章先简要介绍常规几何量子逻辑门的概念，然后重点介绍最近提出的非常规几何量子计算：量子计算中使用的逻辑门的总位相既包含有几何位相，又包含有动力学位相，但它仅依赖于一些几何特征，而且，对于任意的量子位输入态，在量子门操作过程中积累的位相要么是零，要么是仅依赖几何特征的位相。     

Intrinsic quantum computation

We introduce ways to measure information storage in quantum systems, using a recently introduced computation-theoretic model that accounts for measurement effects. The first, the quantum excess entropy, quantifies the shared information between a quantum process's past and its future. The second, the quantum transient information, determines the difficulty with which an observer comes to know the internal state of a quantum process through measurements. We contrast these with von Neumann entropy and quantum entropy rate and provide a closed-form expression for the latter for the class of deterministic quantum processes.     

Generation of entanglement in finite spin systems via adiabatic quantum computation

For a finite XY chain and a finite two-dimensional Ising lattice, it is shown that the paramagnetic ground state is adiabatically transformed to the Greenberger-Horne-Zeilinger state in the ferromagnetic phase by changing slowly the external magnetic field. It is found that the fidelity between the Greenberger-Horne-Zeilinger state and an adiabatically evolved state depends on the interpolation schemes as well as the energy gap between the ground and exited states. A possibility whether quantum phase transitions can be simulated on adiabatic quantum computation is discussed.     

Magnetic exchange interactions in quantum dots containing electrons and magnetic ions

We present a theory of magnetic exchange interactions in quantum dots containing electrons and magnetic ions. We find the interaction between the electron and Mn ion to depend strongly on the number of electrons. It can be switched off for closed shell configurations and maximized for partially filled shells. However, unlike the total electron spin S which is maximized for half-filled shells, we predict the exchange interaction to be independent of the filling of the electronic shell. We show how this unusual effect manifests itself in quantum dot addition and excitation spectrum.