Quantum computers are constantly growing in their number of qubits, but continue to suffer from restrictions such as the limited pairs of qubits that may interact with each other. Thus far, this problem is addressed by mapping and moving qubits to suitable positions for the interaction (known as quantum circuit mapping). However, this movement requires additional gates to be incorporated into the circuit, whose number should be kept as small as possible since each gate increases the likelihood of errors and decoherence. State-of-the-art mapping methods utilize swapping and bridging to move the qubits along the static paths of the coupling map---solving this problem without exploiting all means the quantum domain has to offer. In this paper, we propose to additionally exploit quantum teleportation as a possible complementary method. Quantum teleportation conceptually allows to move the state of a qubit over arbitrary long distances with constant overhead---providing the potential of determining cheaper mappings. The potential is demonstrated by a case study on the IBM Q Tokyo architecture which already shows promising improvements. With the emergence of larger quantum computing architectures, quantum teleportation will become more effective in generating cheaper mappings.
This paper includes two comments. The first one is a comment on 'Teleportation of two quNit entanglement: Exploiting local resources'. Two different efficient methods are presented to modify some details of N. Ba An's protocol, so that teleportation of two quNit entanglement can be successfully achieved in terms of the revised N. Ba An's protocol. The second one is a comment on 'Reply to Yang et al.'s comment'.
We show that low-depth random quantum circuits can be efficiently simulated by a quantum teleportation-inspired algorithm. By using logical qubits to redirect and teleport the quantum information in quantum circuits, the original circuits can be renormalized to new circuits with a smaller number of logical qubits. We demonstrate the algorithm to simulate several random quantum circuits, including 1D-chain 1000-qubit 42-depth, 2D-grid 125*8-qubit 42-depth and 2D-Bristlecone 72-qubit 32-depth circuits. Our results present a memory-efficient method with a clear physical picture to simulate low-de…
We demonstrate the design of an integrated conditional quantum teleportation circuit and a readout circuit using a two-dimensional photonic crystal single chip. Fabrication and testing of the proposed quantum circuit can be accomplished with current or near future semiconductor process technology and experimental techniques. The readout part of our device, which has potential for independent use as an atomic interferometer, can also be used on its own or integrated with other compatible optical circuits to achieve atomic state detection. Further improvement of the device in terms of compactnes…
An explicit quantum circuit is given to implement quantum teleportation. This circuit makes teleportation straightforward to anyone who believes that quantum computation is a reasonable proposition. It could also be genuinely used inside a quantum computer if teleportation is needed to move quantum information around. An unusual feature of this circuit is that there are points in the computation at which the quantum information can be completely disrupted by a measurement (or some types of interaction with the environment) without ill effects: the same final result is obtained whether or not t…
An efficient and economical scheme is proposed for the perfect quantum teleportation of n-qubit non-maximally entangled state of generalized Bell-type. A Bell state is used as the quantum channel in the proposed scheme. It is also shown that the controlled teleportation of this n-qubit state can be achieved by using a GHZ state or a GHZ-like state as quantum channel. The proposed schemes are economical because for the perfect and controlled teleportation of n-qubit non-maximally entangled state of generalized Bell-type we only need a Bell state and a tripartite entangled state respectively. It…
The quantum teleportation protocol is extracted directly out of a standard classical circuit that exchanges the states of two qubits using only controlled-NOT gates. This construction of teleportation from a classically transparent circuit generalizes straightforwardly to d-state systems.
We propose a deterministic scheme for teleporting an unknown qubit through continuous-variable entangled states in superconducting circuits. The qubit is a superconducting two-level system and the bipartite quantum channel is a photonic entangled coherent state between two cavities. A Bell-type measurement performed on the hybrid state of solid and photonic states brings a discrete-variable unknown electronic state to a continuous-variable photonic cat state in a cavity mode. This scheme further enables applications for quantum information processing in the same architecture of circuit-QED suc…
Quantum algorithms and protocols are often presented as quantum circuits for a better understanding. We give a list of equivalence rules which can help in the analysis and design of quantum circuits. As example applications we study quantum teleportation and dense coding protocols in terms of a simple XOR swapping circuit and give an intuitive picture of a basic gate teleportation circuit.
Clifford circuits play an important role in quantum computation. Gottesman and Chuang proposed a gate teleportation protocol so that a quantum circuit can be implemented by the teleportation circuit with specific ancillary qubits. In particular, an $n$-qubit Clifford circuit $U$ can be implemented by preparing an ancillary stabilizer state $(I\otimes U)|Φ^+\rangle^{\otimes n}$ for teleportation and doing a Pauli correction conditioned on the measurement. In this paper, we provide an alternative procedure to implement a Clifford circuit through Pauli measurements, by preparing $O(1)$ ancillas t…
We present a quantum circuit representation consisting entirely of qubit initialisations (I), a network of controlled-NOT gates (C) and measurements with respect to different bases (M). The ICM representation is useful for optimisation of quantum circuits that include teleportation, which is required for fault-tolerant, error corrected quantum computation. The non-deterministic nature of teleportation necessitates the conditional introduction of corrective quantum gates and additional ancillae during circuit execution. Therefore, the standard optimisation objectives, gate count and number of w…
We study the possibility to teleport an unkown quantum state onto the vibrational degree of freedom of a movable mirror. The quantum channel between the two parties is established by exploiting radiation pressure effects.
We propose an experimentally feasible scheme to teleport an unkown quantum state onto the vibrational degree of freedom of a macroscopic mirror. The quantum channel between the two parties is established by exploiting radiation pressure effects.
The presented work provides a procedure for optimizing the communication cost of a distributed quantum circuit (DQC) in terms of the number of qubit teleportations. Because of technology limitations which do not allow large quantum computers to work as a single processing element, distributed quantum computation is an appropriate solution to overcome this difficulty. Previous studies have applied ad-hoc solutions to distribute a quantum system for special cases and applications. In this study, a general approach is proposed to optimize the number of teleportations for a DQC consisting of two s…
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 …
Teleportation of a quantum state may be used for distributing entanglement between distant qubits in quantum communication and for quantum computation. Here we demonstrate the implementation of a teleportation protocol, up to the single-shot measurement step, with superconducting qubits coupled to a microwave resonator. Using full quantum state tomography and evaluating an entanglement witness, we show that the protocol generates a genuine tripartite entangled state of all three-qubits. Calculating the projection of the measured density matrix onto the basis states of two qubits allows us to r…
Bosonic quantum error-correcting codes offer a viable direction towards reducing the hardware overhead required for fault-tolerant quantum information processing. A broad class of bosonic codes, namely rotation-symmetric codes, can be characterized by their phase-space rotation symmetry. However, their performance has been examined to date only within an idealistic noise model. Here, we further analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. To this end, we numerically compute the average gate fidelity, including measu…
A 5-qubit quantum controlled teleportation scheme incorporated with a 3-qubit quantum error-corrective circuit is proposed for satellite control and communication. This means that the coordinates of a satellite on the unit two-dimensional Bloch sphere representation can be sent to the ground based operator via quantum teleportation. Applying quantum rotation operators to the initial quantum state, to obtain desired changes, the corrected/desired quantum state can be sent back to the satellite to adjust its coordinates.
We present an optomechanical system as a paradigm of three-mode teleportation network. Quantum state transfer among optical and vibrational modes becomes possible by exploiting correlations established by radiation pressure.
We study the construction of both universal quantum computation and multi-partite entangled states in the topological diagrammatical approach to quantum teleportation. Our results show that the teleportation-based quantum circuit model admits a space-time topological interpretation which makes the construction of both quantum gates and four-partite entangled states more intuitive and simpler. Our results state a deeper link between the space-time non-locality and the quantum non-locality which are the two-fold character of the topological diagrammatical representation.
We study a quantum teleportation scheme between two nanomechanical modes without local interaction. The nanomechanical modes are linearly coupled to and connected by the continuous variable modes of a superconducting circuit consisting of a transmission line and Josephson junctions. We calculate the fidelity of transferring Gaussian states at finite temperature and non-unit detector efficiency. For coherent state, a fidelity above the classical limit of 1/2 can be achieved for a large range of parameters.
We study the effects of relativistic motion on quantum teleportation and propose a realizable experiment where our results can be tested. We compute bounds on the optimal fidelity of teleportation when one of the observers undergoes non-uniform motion for a finite time. The upper bound to the optimal fidelity is degraded due to the observer's motion however, we discuss how this degradation can be corrected. These effects are observable for experimental parameters that are within reach of cutting-edge superconducting technology. Our setup will further provide guidance for future space-based exp…
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.
Quantum error correction is an essential tool for reliably performing tasks for processing quantum information on a large scale. However, integration into quantum circuits to achieve these tasks is problematic when one realizes that non-transverse operations, which are essential for universal quantum computation, lead to the spread of errors. Quantum gate teleportation has been proposed as an elegant solution for this. Here, one replaces these fragile, non-transverse inline gates with the generation of specific, highly entangled offline resource states that can be teleported into the circuit t…
The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be used as a quantum channel for teleportation, as proposed by Wang, Shang and Xue [Quantum Inf. Process. 16, 221 (2017)]. Here, we demonstrate the implementation of quantum teleportation using quantum walks on a five-qubit quantum computer and a 32-qubit simulator provided by IBM quantum experience beta platform. We show the teleportation of single-qubit, two…
Quantum error correcting codes (QECC) are the key ingredients both for fault-tolerant quantum computation and quantum communication. Teleportation-based error correction (TEC) helps in detecting and correcting operational and erasure errors by performing X and Z measurements during teleportation. Here we demonstrate the TEC protocol for the detection and correction of a single bit-flip error by proposing a new quantum circuit. A single phase-flip error can also be detected and corrected using the above protocol. For the first time, we illustrate detection and correction of erasure error in the…
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…
Transferring the state of an information carrier from a sender to a receiver is an essential primitive in both classical and quantum communication and information processing. In a quantum process known as teleportation the unknown state of a quantum bit can be relayed to a distant party using shared entanglement and classical information. Here we present experiments in a solid-state system based on superconducting quantum circuits demonstrating the teleportation of the state of a qubit at the macroscopic scale. In our experiments teleportation is realized deterministically with high efficiency…
Here we demonstrate quantum teleportation through hypergraph states, which are the generalization of graph states, and due to their non-local entanglement properties, it allows us to perform quantum teleportation. Here we design some hypergraph states useful for quantum teleportation and process the schemes for quantum teleportation of single-qubit and two-qubit arbitrary states via three-uniform three-qubit and four-qubit hypergraph states respectively. We explicate the experimental realization of quantum teleportation of both single and two-qubit arbitrary states. Then we run our quantum cir…
