Controlled teleportation of multi-qudit quantum information

We propose a scheme for realizing a controlled teleportation of random $M$-qudit quantum information under the control of $N$ agents. The resource consumption includes a prearranged $(2M + N + 1)$-qudit entangled quantum channel and $(2M + N + 1)\log _2 d$-bit classical communication. And the quantum operations used in the teleportation process are a series of generalized Bell-state measurements, single-qudit measurements, qudit $H$-gates, qudit-Pauli gates and qudit phase gates. It is shown that the original state can be restored by the receiver only on condition that all the agents work in collaboration with each others. If one agent does not cooperate with the other, the original state cannot be fully recovered.     

Asymptotically optimal quantum circuits for d-level systems

Scalability of a quantum computation requires that the information be processed on multiple subsystems. However, it is unclear how the complexity of a quantum algorithm, quantified by the number of entangling gates, depends on the subsystem size. We examine the quantum circuit complexity for exactly universal computation on many d-level systems (qudits). Both a lower bound and a constructive upper bound on the number of two-qudit gates result, proving a sharp asymptotic of theta(d(2n)) gates. This closes the complexity question for all d-level systems (d finite). The optimal asymptotic applies to systems with locality constraints, e.g., nearest neighbor interactions.     

多光子偏振态与单光子高维空间态之间的相互变换及其应用

基于一种特殊的控制非门,实现多光子偏振态与单光子空间高维态之间的相互变换,使得对多光子偏振态的操作可以通过对单光子的操作来完成,由此可以实现任意多光子正定算符值测量和多光子任意幺正操作.这种实现方式是以一定概率完成的,但其效率要优于此前的方案,在目前的实验条件下是可行的. 关键词： 单光子空间态 特殊控制非门 线性光学多端口干涉仪     

弱测量对四个量子比特量子态的保护

廖湘萍等(Chin.Phys.B 23 020304,2014)指出弱测量和弱测量反转操作可以保护三个量子比特的纠缠,提高保真度.本文将弱测量方法推广至四个量子比特的情况,研究了几种典型四个量子比特量子态的演化.结果表明:在振幅阻尼通道中,弱测量方法能够有效地提高系统量子态的保真度.分析了影响量子态保真度的各种因素,对比了不同量子态的演化特征,划分了量子态保真度提高的敏感区域.最后,对弱测量方法抑制量子态衰减的内在机制做了合理的物理解释.     

Controlled Teleportation of Multi-Qudit Quantum Information

We present a controlled teleportation scheme for teleporting an arbitrary superposition state of an M-qudit quantum system. The scheme employs only one entangled state as quantum channel, which consists of the qudits from Alice, Bob and every agent. The quantum operations used in the teleportation process are a series of qudit Bell measurements, single-qudit projective measurements, qudit H-gates, qudit-Pauli gates and qudit phase gates. It is shown that the original state can be restored by the receiver only on the condition that all the agents collaborate. If any agent does not cooperate, the original state can not be fully recovered.     

Standard form of qudit stabilizer groups

We investigate stabilizer codes with carrier qudits of equal dimension D, an arbitrary integer greater than 1. We prove that there is a direct relation between the dimension of a qudit stabilizer code and the size of its corresponding stabilizer, and this implies that the code and its stabilizer are dual to each other. We also show that any qudit stabilizer can be put in a canonical, or standard, form using a series of Clifford gates, and we provide an explicit efficient algorithm for doing this. Our work generalizes known results that were valid only for prime dimensional systems and may be useful in constructing efficient encoding/decoding quantum circuits for qudit stabilizer codes and better qudit quantum error correcting codes.     

Teleportation of an arbitrary two-qudit state based on the non-maximally four-qudit cluster state

Two different schemes are presented for quantum teleportation of an arbitrary two-qudit state using a non-maximally four-qudit cluster state as the quantum channel. The first scheme is based on the Bell-basis measurements and the receiver may probabilistically reconstruct the original state by performing proper transformation on her particles and an auxiliary two-level particle; the second scheme is based on the generalized Bell-basis measurements and the probability of successfully teleporting the unknown state depends on those measurements which are adjusted by Alice. A comparison of the two schemes shows that the latter has a smaller probability than that of the former and contrary to the former, the channel information and auxiliary qubit are not necessary for the receiver in the latter. Supported by the Natural Science Research Project of Shanxi Province (Grant No. 2004A15)     

Teleportation of a multiqubit state by an entangled qudit channel

We investigate the problem of teleportation of an M-qubit state by using an entangled qudit pair as a quantum channel and show that the teleportation of a multiparticle state can correspond to the teleportation of a multi-dimensional state. We also introduce a quantum-state converter composed of beamsplitter arrays, on/off-detectors and cross-Kerr couplers and demonstrate that the state conversion from an M-qubit to an N-dimensional qudit and vice versa can be implemented with this converter, where N=2^M. Based on this, an experimentally feasible scheme for the teleportation of an M-qubit via an entangled N-level qudit pair channel is proposed.     

Quantum computation with Turaev-Viro codes

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev’s toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.     

Quantum state sharing of an arbitrary qudit state by using nonmaximally generalized GHZ state

We present a scheme for quantum state sharing of an arbitrary qudit state by using nonmaximally entangled generalized Greenberger-Horne-Zeilinger （GHZ） states as the quantum channel and generalized Bell-basis states as the joint measurement basis. We show that the probability of successful sharing an unknown qudit state depends on the joint measurements chosen by Alice. We also give an expression for the maximally probability of this scheme.     

Improving the local implementation of a nonlocal multi-party quantum Toffoli gate

Efficient local implementation of a nonlocal multi-party quantum Toffoli gate is considered. We present and demonstrate a scheme that can improve significantly the implementation of this nonlocal (N + 1)-party gate by harnessing N entangled pairs of qubits as quantum channels and a (N+1)-dimensional qudit as a catalyser. The quantum circuit that does the proposed implementation is built entirely of local single-body and two-body gates, and has only (2N + 1) two-body gates. The method that we describe is independent of the particular physical system used to encode quantum information and the way in which the elemental gates are realized.     

Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme

Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly,the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys.     

Exact two-qubit universal quantum circuit

We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the controlled-unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation.     

Efficient Quantum Circuit for Encoding and Decoding of the [[8,3,5]] Stabilizer Code

A general protocol for constructing a complete efficient encoding and decoding quantum circuit of the [[8,3,5]] stabilizer code is proposed. The [[8,3,5]] stabilizer code is an eight-qubit code that protects a three-qubit state with up to one error, which is very important for quantum information processing. Single-qubit operations, two-qubit controlled gates and Toffoli gates are required in the proposed circuit. The current protocol can be generalized to all quantum stabilizer codes satisfying quantum Hamming bound, and implemented in some quantum systems.     

Allowable Generalized Quantum Gates

In this paper, we give the most general duality gates, or generalized quantum gates in duality quantum computers. Here we show by explicit construction that a n-bit duality quantum computer with d slits can be simulated perfectly with an ordinary quantum computer with n qubits and one auxiliary qudit. Using this model, we give the most general form of duality gates which is of the form ∑i=0^d-1piUi,and the pi ＇s are complex numbers with module less or equal to 1 and constrained by｜∑iPi｜≤1.     

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.     

Remote interactions between two d-dimensional distributed quantum systems： nonlocal generalized quantum control-NOT gate and entanglement swapping

We present a systematic simple method to implement a generalized quantum control-NOT （CNOT） gate on two d-dimensional distributed systems. First, we show how the nonlocal generalized quantum CNOT gate can be implemented with unity fidelity and unity probability by using a maximally entangled pair of qudits as a quantum channel. We also put forward a scheme for probabilistically implementing the nonlocal operation with unity fidelity by employing a partially entangled qudit pair as a quantum channel. Analysis of the scheme indicates that the use of partially entangled quantum channel for implementing the nonlocal generalized quantum CNOT gate leads to the problem of ＇the general optimal information extraction＇. We also point out that the nonlocal generalized quantum CNOT gate can be used in the entanglement swapping between particles belonging to distant users in a communication network and distributed quantum computer.[第一段]     

Implementation of ternary Shor's algorithm based on vibrational states of an ion in anharmonic potential

It is widely believed that Shor's factoring algorithm provides a driving force to boost the quantum computing research.However, a serious obstacle to its binary implementation is the large number of quantum gates. Non-binary quantum computing is an efficient way to reduce the required number of elemental gates. Here, we propose optimization schemes for Shor's algorithm implementation and take a ternary version for factorizing 21 as an example. The optimized factorization is achieved by a two-qutrit quantum circuit, which consists of only two single qutrit gates and one ternary controlled-NOT gate. This two-qutrit quantum circuit is then encoded into the nine lower vibrational states of an ion trapped in a weakly anharmonic potential. Optimal control theory(OCT) is employed to derive the manipulation electric field for transferring the encoded states. The ternary Shor's algorithm can be implemented in one single step. Numerical simulation results show that the accuracy of the state transformations is about 0.9919.     

Quantum information processing with fiber optics: Quantum Fourier transform of 1024 qubits

Among a number of candidates, photons have advantages for implementing qubits: very weak coupling to the environment, the existing single photon measurement technique, and so on. Moreover, commercially available fiber-optic devices enable us to construct quantum circuits that consist of one-qubit operations (including classically controlled gates). Fiber optics resolves the mode matching problems in conventional optics and provides mechanically stable optical circuits. A quantum Fourier transform (QFT) followed by measurement was demonstrated with a simple circuit based on fiber optics. The circuit was shown to be robust against imperfections in the rotation gate. The error probability was estimated to be 0.01 per qubit, which corresponded to error-free operation for 100 qubits. The error probability can be further reduced to achieve successful QFT of 1024 qubits by taking the majority of the accumulated results. As is well known, QFT is a key function in quantum computations such as the final part of Shor’s factorization algorithm. The present QFT circuit, in combination with controlled unitary gates, would make possible practical quantum computers. Possible schemes of realizing quantum computers in this line are explored.