Universal resources for measurement-based quantum computation

We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess the universality of graph states by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal nongraph state.     

Universal quantum computation with continuous-variable cluster states

We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quantum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multimode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.     

Active one-way quantum computation with two-photon four-qubit cluster states

By using 2-photon 4-qubit cluster states we demonstrate deterministic one-way quantum computation in a single qubit rotation algorithm. In this operation feed-forward measurements are automatically implemented by properly choosing the measurement basis of the qubits, while Pauli error corrections are realized by using two fast driven Pockels cells. We realized also a C-NOT gate for equatorial qubits and a C-PHASE gate for a generic target qubit. Our results demonstrate that 2-photon cluster states can be used for rapid and efficient deterministic one-way quantum computing.     

Fault-tolerant quantum computation via exchange interactions

Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and control of effective exchange interactions and possibly a global magnetic field. This "encoded universality" paradigm offers potential simplifications in quantum computer design since it does away with the need to control physical qubits individually. Here we show how encoded universality schemes can be combined with fault-tolerant quantum error correction, thus establishing the scalability of such schemes.     

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.     

On quantum operations as quantum states

We formalize Jamiolkowski’s correspondence between quantum states and quantum operations isometrically, and harness its consequences. This correspondence was already implicit in Choi’s proof of the operator sum representation of Completely Positive-preserving linear maps; we go further and show that all of the important theorems concerning quantum operations can be derived directly from those concerning quantum states. As we do so the discussion first provides an elegant and original review of the main features of quantum operations. Next (in the second half of the paper) we find more results stemming from our formulation of the correspondence. Thus, we provide a factorizability condition for quantum operations, and give two novel Schmidt-type decompositions of bipartite pure states. By translating the composition law of quantum operations, we define a group structure upon the set of totally entangled states. The question whether the correspondence is merely mathematical or can be given a physical interpretation is addressed throughout the text: we provide formulae which suggest quantum states inherently define a quantum operation between two of their subsystems, and which turn out to have applications in quantum cryptography.     

光子两自由度超并行量子计算与超纠缠态操控

光子系统在量子信息处理和传输过程中有非常重要的应用. 譬如, 利用光子与原子(或人工原子)之间的相互作用, 可以完成信息的安全传输、存储和快速的并行计算处理等任务. 光子系统具有多个自由度, 如极化、空间模式、轨道角动量、时间-能量、频率等自由度. 光子系统的多个自由度可以同时应用于量子信息处理过程. 超并行量子计算利用光子系统多个自由度的光量子态同时进行量子并行计算, 使量子计算具有更强的并行性, 且需要的量子资源少, 更能抵抗光子数损耗等噪声的影响. 多个自由度同时存在纠缠的光子系统量子态称为超纠缠态, 它能够提高量子通信的容量与安全性, 辅助完成一些重要的量子通信任务. 在本综述中, 我们简要介绍了光子系统两自由度量子态在量子信息中的一些新应用, 包括超并行量子计算、超纠缠态分析、超纠缠浓缩和纯化三个部分.     

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.     

Knill-laflamme-milburn linear optics quantum computation as a measurement-based computation

We show that the Knill Lafllame Milburn method of quantum computation with linear optics gates can be interpreted as a one-way, measurement-based quantum computation of the type introduced by Briegel and Raussendorf. We also show that the permanent state of n n-dimensional systems is a universal state for quantum computation.     

Bound states and equation of state for nondegenerate quantum systems with short-range interactions

The influence of bound states on the second virial coefficient for systems with short-range interactions is investigated, and the equation of state is determined by different methods. The dissociation equilibrium between bound and free particles is discussed.     

Completeness of the classical 2D Ising model and universal quantum computation

We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with complex inhomogeneous couplings and external fields. In the case where the original model is an Ising or Potts-type model, we find that the corresponding 2D square lattice requires only polynomially more spins with respect to the original one, and we give a constructive method to map such models to the 2D Ising model. For more general models the overhead in system size may be exponential. The results are established by connecting classical spin models with measurement-based quantum computation and invoking the universality of the 2D cluster states.     

Cat-qubits for quantum computation

The development of quantum Josephson circuits has created a strong expectation for reliable processing of quantum information. While this progress has already led to various proof-of-principle experiments on small-scale quantum systems, a major scaling step is required towards many-qubit protocols. Fault-tolerant computation with protected logical qubits usually comes at the expense of a significant overhead in the hardware. Each of the involved physical qubits still needs to satisfy the best achieved properties (coherence times, coupling strengths and tunability). Here, and in the aim of addressing alternative approaches to deal with these obstacles, I overview a series of recent theoretical proposals, and the experimental developments following these proposals, to enable a hardware-efficient paradigm for quantum memory protection and universal quantum computation.     

Efficient quantum computation with probabilistic quantum gates

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability 1-p far beyond any threshold requirement.     

Squeezed vacuum as a universal quantum probe

We address local quantum estimation of bilinear Hamiltonians probed by Gaussian states. We evaluate the relevant quantum Fisher information (QFI) and derive the ultimate bound on precision. Upon maximizing the QFI we found that single- and two-mode squeezed vacuum represent an optimal and universal class of probe states, achieving the so-called Heisenberg limit to precision in terms of the overall energy of the probe. We explicitly obtain the optimal observable based on the symmetric logarithmic derivative and also found that homodyne detection assisted by Bayesian analysis may achieve estimation of squeezing with near-optimal sensitivity in any working regime.     

Distributed quantum computation with superconducting qubit via LC circuit using dressed states

A scheme is proposed where two superconducting qubits driven by a classical field interacting separately with two distant LC circuits connected by another LC circuit through mutual inductance,are used for implementing quantum gates.By using dressed states,quantum state transfer and quantum entangling gate can be implemented.With the help of the time-dependent electromagnetic field,any two dressed qubits can be selectively coupled to the data bus (the last LC circuit),then quantum state can be transferred from one dressed qubit to another and multi-mode entangled state can also be formed.As a result,the promising perspectives for quantum information processing of mesoscopic superconducting qubits are obtained and the distributed and scalable quantum computation can be implemented in this scheme.     

Universal quantum computation with qudits

Quantum circuit model has been widely explored for various quantum applications such as Shors algorithm and Grovers searching algorithm. Most of previous algorithms are based on the qubit systems. Herein a proposal for a universal circuit is given based on the qudit system, which is larger and can store more information. In order to prove its universality for quantum applications, an explicit set of one-qudit and two-qudit gates is provided for the universal qudit computation. The one-qudit gates are general rotation for each two-dimensional subspace while the two-qudit gates are their controlled extensions. In comparison to previous quantum qudit logical gates, each primitive qudit gate is only dependent on two free parameters and may be easily implemented. In experimental implementation, multilevel ions with the linear ion trap model are used to build the qudit systems and use the coupling of neighbored levels for qudit gates. The controlled qudit gates may be realized with the interactions of internal and external coordinates of the ion.     

Composite pulses for quantum computation with trapped electrons

In a scalable quantum computer, based on trapped electrons in vacuum, qubits are encoded in the external (cyclotron motion) and internal (spin) degrees of freedom. We show how to extend the technique of composite pulses to manipulate the cyclotron oscillator without leaving the computational subspace. In particular, we describe and discuss how to implement the explicit pulse sequence which operates the conditional phase shift between the cyclotron and the spin qubits.     

Gibbs measure as quantum ground states

We study certain quantum spin systems which are equivalent to stochastic Ising models. We show that any translationally invariant quantum ground state is given by integration of Gibbs measure. The existence of mass gap is shown to be the same as exponentially fast convergence of stochastic models to invariant states.     

Entanglement purification for quantum computation

We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with 8 < or = d < or = 32. Each system serves to store one logical qubit and additional auxiliary dimensions are used to create and purify entanglement between systems. Physical, possibly probabilistic two-system operations with error rates up to 2/3 are still tolerable to realize deterministic high-quality two-qubit gates on the logical qubits. The achievable error rate is of the same order of magnitude as of the single-system operations. We investigate possible implementations of our scheme for several physical setups.