The difficulty in producing precisely timed and controlled quantum gates is a significant source of error in many physical implementations of quantum computers. Here we introduce a simple universal primitive, adiabatic gate teleportation, which is robust to timing errors and many control errors and maintains a constant energy gap throughout the computation above a degenerate ground state space. Notably this construction allows for geometric robustness based upon the control of two independent qubit interactions. Further, our piecewise adiabatic evolution easily relates to the quantum circuit model, enabling the use of standard methods from fault-tolerance theory for establishing thresholds.
We introduce a shortcut to the adiabatic gate teleportation model of quantum computation. More specifically, we determine fast local counterdiabatic Hamiltonians able to implement teleportation as a universal computational primitive. In this scenario, we provide the counterdiabatic driving for arbitrary n-qubit gates, which allows to achieve universality through a variety of gate sets. Remarkably, our approach maps the superadiabatic Hamiltonian for an arbitrary n-qubit gate teleportation into the implementation of a rotated superadiabatic dynamics of an n-qubit state teleportation. This resul…
Teleportation of quantum gates is a critical step for implementation of quantum networking and teleportation-based models of quantum computation. We report an experimental demonstration of teleportation of the prototypical quantum controlled-NOT (CNOT) gate. Assisted with linear optical manipulations, photon entanglement produced from parametric down conversion, and coincidence measurements, we teleport the quantum CNOT gate from acting on local qubits to acting on remote qubits. The quality of the quantum gate teleportation is characterized through the method of quantum process tomography, wi…
We clarify the connections between the erasure scheme of probabilistic CNOT gate implementation recently proposed by Pittman, Jacobs and Franson [Phys. Rev. A 64, 062311 (2001)] and quantum teleportation.
Quantum teleportation is a powerful protocol with applications in several schemes of quantum communication, quantum cryptography and quantum computing. The present work shows the required conditions for a two-qubit quantum gate to be deterministically and probabilistically teleported by a quantum gate teleportation scheme using different basis of measurement. Additionally, we present examples of teleportation of two-qubit gates that do not belong to Clifford group as well the limitations of the quantum gate teleportation scheme employing a four-qubit state with genuine four-way entanglement.
We study the dynamics of a pair of atoms, resonantly interacting with a single mode cavity, in the situation where the atoms enter the cavity with a time delay between them. Using time dependent coupling functions to represent the spatial profile of the mode, we considered the adiabatic limit of the system. Although the time evolution is mostly adiabatic, energy crossings play an important role in the system dynamics. Following from this, entanglement, and a procedure for cavity state teleportation are considered. We examine the behaviour of the system when we introduce decoherence, a finite d…
In our work, we compare three teleportation protocols: the original protocol, the photon subtraction protocol, and the protocol with a cubic phase gate. We evaluate the fidelity of each protocol using the example of teleportation of the squeezed state and the Schrodinger's cat state. We show that, under equal conditions, the teleportation scheme with a cubic phase gate achieves significantly higher fidelity than the other protocols considered.
We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of $L$ unitary gates increases at most as $O(L^5)$. However, we show that it has the interesting property that it can map the temporal order of gates to the …
We examine continuous-variable gate teleportation using entangled states made from pure product states sent through a beamsplitter. We show that such states are Choi states for a (typically) non-unitary gate, and we derive the associated Kraus operator for teleportation, which can be used to realize non-Gaussian, non-unitary quantum operations on an input state. With this result, we show how gate teleportation is used to perform error correction on bosonic qubits encoded using the Gottesman-Kitaev-Preskill code. This result is presented in the context of deterministically produced macronode cl…
A generalization of the quantum XOR-gate is presented which operates in arbitrary dimensional Hilbert spaces. Together with one-particle Fourier transforms this gate is capable of performing a variety of tasks which are important for quantum information processing in arbitrary dimensional Hilbert spaces. Among these tasks are the preparation of Bell states, quantum teleportation and quantum state purification. A physical realization of this generalized XOR-gate is proposed which is based on non-linear optical elements.
The universal quantum cloning machine and the universal NOT gate acting on a single qubit can be implemented very generally by slightly modifying the protocol of quantum state teleportation. The experimental demonstration of the 1 to 2 cloning process according to the above scheme has been realized for a qubit encoded in photon polarization.
We propose a modified quantum teleportation scheme to increase the teleportation accuracy by applying a cubic phase gate to the displaced squeezed state. We have described the proposed scheme in Heisenberg's language, evaluating it from the point of view of adding an error in teleportation, and have shown that it allows achieving less error than the original scheme. Repeating the description in the language of wave functions, we have found the range of the displacement values, at which our conclusions will be valid. Using the example of teleportation of the vacuum state, we have shown that the…
We show that a universal set of gates for quantum computation with optics can be quantum teleported through the use of EPR entangled states, homodyne detection, and linear optics and squeezing operations conditioned on measurement outcomes. This scheme may be used for fault-tolerant quantum computation in any optical scheme (qubit or continuous variable). The teleportation of nondeterministic nonlinear gates employed in linear optics quantum computation is discussed.
Reliable entangling gates for qubits encoded in single-photon states represent a major challenge on the road to scalable quantum computing architectures based on linear optics. In this work, we present two approaches to develop high-fidelity, near-deterministic controlled-sign-shift gates based on the techniques of quantum gate teleportation. On the one hand, teleportation in a discrete-variable setting, i.e., for qubits, offers unit-fidelity operations but suffers from low success probabilities. Here, we apply recent results on advanced linear optical Bell measurements to reach a near-determi…
We experimentally demonstrate a programmable quantum gate that applies a sign flip operation to data qubit in an arbitrary basis fully specified by the quantum state of a two-qubit program register. Our linear-optical implementation is inspired by teleportation-based schemes for quantum computing and relies on multiphoton interference and coincidence detection. We confirm the programmability of the gate and its high-fidelity performance by carrying out full quantum process tomography of the resulting operation on data qubit for several different programs.
By a significant modification of the standard protocol of quantum state Teleportation two processes ''forbidden'' by quantum mechanics in their exact form, the Universal NOT gate and the Universal Optimal Quantum Cloning Machine, have been implemented contextually and optimally by a fully linear method. In particular, the first experimental demonstration of the Tele-UNOT Gate, a novel quantum information protocol has been reported (cfr. quant-ph/0304070). A complete experimental realization of the protocol is presented here.
Quantum Fourier gates (QFG) constitute a family of quantum gates that result from an exact combination of the quantum Fourier transform (QFT) and the SWAP gate. As a direct consequence of this, the Feynman gate is a particular case of that family, just as the Bell states are particular cases of the states that are also derived from the aforementioned family. Besides, this new tool will allow us to demonstrate that teleportation is not something that happens exclusively thanks to some level of entanglement, but that it is also possible with an incomplete form of entanglement known as rough enta…
We present a computational circuit which realizes contextually the Tele-UNOT gate and the universal optimal quantum cloning machine (UOQCM). We report the experimental realization of the probabilistic UOQCM with polarization encoded qubits. This is achieved by combining on a symmetric beam-splitter the input qubit with an ancilla in a fully mixed state.
The stored-program architecture is canonical in classical computing, while its power has not been fully recognized for the quantum case. We study quantum information processing with stored quantum program states, i.e., using qubits instead of bits to encode quantum operations. We develop a stored-program model based on Choi states, following from channel-state duality, and a symmetry-based generalization of deterministic gate teleportation. Our model enriches the family of universal models for quantum computing, and can also be employed for tasks including quantum simulation and communication.
We report on the usage of a linear optics phase gate for distinguishing all four Bell states simultaneously in a quantum teleportation and entanglement swapping protocol. This is demonstrated by full state tomography of the one and two qubit output states of the two protocols, yielding average state fidelities of about 0.83 and 0.77, respectively. In addition, the performance of the teleportation channel is characterised by quantum process tomography. The non classical properties of the entanglement swapping output states are further confirmed by the violation of a CHSH-type Bell inequality of…
Blind quantum computation (BQC) is a model in which a computation is performed on a server by a client such that the server is kept blind about the input, the algorithm, and the output of the computation. Here we layout a general framework for BQC which, unlike the previous BQC models, does not constructed on specific computational model. A main ingredient of our construction is gate teleportation. We demonstrate that our framework can be straightforwardly implemented on circuit-based models as well as measurement-based models of quantum computation. We illustrate our construction by showing t…
Teleportation is a crucial element in fault-tolerant quantum computation and a complete understanding of its capacity is very important for the practical implementation of optimal fault-tolerant architectures. It is known that stabilizer codes support a natural set of gates that can be more easily implemented by teleportation than any other gates. These gates belong to the so called $\mathcal{C}_k$ hierarchy introduced by Gottesman and Chuang (Nature \textbf{402}, 390). Moreover, a subset of $\mathcal{C}_k$ gates, called semi-Clifford operations, can be implemented by an even simpler architect…
We present a model to realize a probabilistic conditional sign flip gate using only linear optics. The gate operates in the space of number state qubits and is obtained by a nonconventional use of the teleportation protocol. Both a destructive and a nondestructive version of the gate are presented. In the former case an Hadamard gate on the control qubit is combined with a projective teleportation scheme mixing control and target. The success probability is 1/2. In the latter case we need a quantum encoder realized via the interaction of the control qubit with an ancillary state composed of tw…
Quantum computers promise dramatic speed ups for many computational tasks. For large-scale quantum computation however, the inevitable coupling of physical qubits to the noisy environment imposes a major challenge for a real-life implementation. A scheme introduced by Gottesmann and Chuang can help to overcome this difficulty by performing universal quantum gates in a fault-tolerant manner. Here, we report a non-trivial demonstration of this architecture by performing a teleportation-based two-qubit controlled-NOT gate through linear optics with a high-fidelity six-photon interferometer. The o…
Large-scale quantum computers will require quantum gate operations between widely separated qubits. A method for implementing such operations, known as quantum gate teleportation (QGT), requires only local operations, classical communication, and shared entanglement. We demonstrate QGT in a scalable architecture by deterministically teleporting a controlled-NOT (CNOT) gate between two qubits in spatially separated locations in an ion trap. The entanglement fidelity of our teleported CNOT is in the interval [0.845, 0.872] at the 95% confidence level. The implementation combines ion shuttling wi…
Assisted with linear optical manipulation, single photon, entangled photon pairs, photon measurement, and classical communication, a scheme for two-spin qubits phase gate and teleportation of a CNOT gate between two electron spins from acting on local qubits to acting on remote qubits using quantum dots in optical microcavities is proposed. The scheme is based on spin selective photon reflection from the cavity and is achieved in a deterministic way by the sequential detection of photons and the single-qubit rotations of a single electron spin in a self-assembled GaAs/InAs quantum dot. The fea…
In recent years, there has been heightened interest in quantum teleportation, which allows for the transfer of unknown quantum states over arbitrary distances. Quantum teleportation not only serves as an essential ingredient in long-distance quantum communication, but also provides enabling technologies for practical quantum computation. Of particular interest is the scheme proposed by Gottesman and Chuang [Nature \textbf{402}, 390 (1999)], showing that quantum gates can be implemented by teleporting qubits with the help of some special entangled states. Therefore, the construction of a quantu…
Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the client's private information. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. In this paper, we consider a scenario where a trusted center is responsible for preparing initial states, a client with the ability to perform X, Z does not require any quantu…
We present simplification schemes for probabilistic and controlled teleportation of the unknown quantum states of both one-particle and two-particle and construct efficient quantum logic networks for implementing the new schemes by means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations. In these schemes the teleportation are not always successful but with certain probability.
A simplification scheme of probabilistic teleportation of two-particle state of general form is given. By means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations, we construct an efficient quantum logical network for implementing the new scheme of probabilistic teleportation of a two-particle state of general form.
The scheme for probabilistic teleportation of an N-particle state of general form is proposed. As the special cases we construct efficient quantum logic networks for implementing probabilistic teleportation of a two-particle state, a three-particle state and a four-particle state of general form, built from single qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations.
This paper focuses on the study of topological features in teleportation-based quantum computation as well as aims at presenting a detailed review on teleportaiton-based quantum computation (Gottesman and Chuang, Nature 402, 390, 1999). In the extended Temperley-Lieb diagrammatical approach, we clearly show that such topological features bring about the fault-tolerant construction of both universal quantum gates and four-partite entangled states more intuitive and simpler. Furthermore, we describe the Yang--Baxter gate by its extended Temperley-Lieb configuration, and then study teleportation-…
Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward
Yale Quantum Institute & Department of Applied Physics, Yale University（耶鲁大学应用物理系及耶鲁量子研究所）；Pritzker School of Molecular Engineering, University of Chicago（芝加哥大学普里茨克分子工程学院）
In this paper we propose a scheme to implement a quantum teleportation based on the current experimental design [Nature (London) 431, 162 (2004); ibid 445, 515 (2007)] in which superconducting charge qubits are capacitively coupled to a single high-Q superconducting coplanar resonator. As advantage of this architecture, it permits the use of multiqubit gates between non-nearest qubits and the realization of parallel gates. We consider the case of two qubits inside the resonator, where the teleportation is accomplished.
We present a model of quantum teleportation protocol based on a double quantum dot array. The unknown qubit is encoded using a pair of quantum dots, coupled by tunneling, with one excess electron. It is shown how to create maximally entangled states with this kind of qubits using an adiabatically increasing Coulomb repulsion between different pairs. This entangled states are exploited to perform teleportation again using an adiabatic coupling between them and the incoming unknown state. Finally, a sudden separation of Bob's qubit enables a time evolution of Alice's state providing a modified v…
In this paper, we investigate the relationship of quantum teleportation in quantum information science and the Birman-Murakami-Wenzl (BMW) algebra in low-dimensional topology. For simplicity, we focus on the two spin-1/2 representation of the BMW algebra, which is generated by both the Temperley-Lieb projector and the Yang-Baxter gate. We describe quantum teleportation using the Temperley-Lieb projector and the Yang-Baxter gate, respectively, and study teleportation-based quantum computation using the Yang-Baxter gate. On the other hand, we exploit the extended Temperley-Lieb diagrammatical ap…
We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell measurements, and GHZ states. We also present straightforward constructions of a wide variety of fault-tolerant quantum gates.
Squeezing transformation as an essential component, gives rise to the possibility to perform various tasks of quantum information processing. However, the reported squeezing gate with best performance so far is a conditional realization at the expense of low success probability, while the performance of the deterministic ones is currently circumscribed by the limited squeezing degree of the non-classical ancilla. To address this issue, we develop and demonstrate a new scheme of deterministic and universal quantum squeezing gate with the property of non-local operation attributed to the telepor…
Quantum state transfer and teleportation, with qubits encoded in internal states of the atoms in cavities, among spatially separated nodes of a quantum network in decoherence-free subspace are proposed, based on a cavity-assisted interaction by single-photon pulses. We show in details the implementation of a logic-qubit Hadamard gate and a two-logic-qubit conditional gate, and discuss the experimental feasibility of our scheme.
We investigate experiments of continuous-variable quantum information processing based on the teleportation scheme. Quantum teleportation, which is realized by a two-mode squeezed vacuum state and measurement-and-feedforward, is considered as an elementary quantum circuit as well as quantum communication. By modifying ancilla states or measurement-and-feedforwards, we can realize various quantum circuits which suffice for universal quantum computation. In order to realize the teleportation-based computation we improve the level of squeezing, and fidelity of teleportation. With a high-fidelity …
It is well-known that maximally entangled states such as the Greenberger-Horne-Zeilinger (GHZ) states, with the Bell states as the simplest examples, are widely exploited in quantum information and computation. We study the application of such maximally entangled states from the viewpoint of the GHZ transform, which is a unitary basis transformation from the product states to the GHZ states. The algebraic structure of the GHZ transform is made clear and representative examples for it are verified as multi-qubit Clifford gates. In this paper, we focus on the Bell transform as the simplest examp…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. In this dissertation we introduce two different models to perform universal superadiabatic quantum computing, which are based on the use of shortcuts to adiabaticity by counter-diabatic Hamiltonians. The first model is based on the use of superadiabatic quantum teleport…
We present a nonlocal construction of universal gates by means of holonomic (geometric) quantum teleportation. The effect of the errors from imperfect control of the classical parameters, the looping variation of which builds up holonomic gates, is investigated. Additionally, the influence of quantum decoherence on holonomic teleportation used as a computational primitive is studied. Advantages of the holonomic implementation with respect to control errors and dissipation are presented.
