Related papers: Quantum Teleportation-Inspired Algorithm for Sampl…
We discuss how to simulate simple quantum logic operations with a large number of qubits. These simulations are needed for experimental testing of scalable solid-state quantum computers. Quantum logic for remote qubits is simulated in a…
The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…
The execution of quantum circuits on real systems has largely been limited to those which are simply time-ordered sequences of unitary operations followed by a projective measurement. As hardware platforms for quantum computing continue to…
We introduce a generalized concept of quantum teleportation in the framework of quantum measurement and reversing operation. Our framework makes it possible to find an optimal protocol for quantum teleportation enabling a faithful transfer…
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum…
We investigate an integrated optical circuit on lithium niobate designed to implement the teleportation-based quantum relay scheme for one-way quantum communication at a telecom wavelength. Such an advanced quantum circuit merges for the…
Quantum teleportation is one of the essential primitives of quantum communication. We suggest that any quantum teleportation scheme can be characterized by its efficiency, i.e. how often it succeeds to teleport, its fidelity, i.e. how well…
Due to the short decohorence time of qubits available in the NISQ-era, it is essential to pack (minimize the size and or the depth of) a logical quantum circuit as efficiently as possible given a sparsely coupled physical architecture. In…
We explore the capability of spin-1/2 chains to act as quantum channels for both teleportation and transfer of qubits. Exploiting the emergence of long-distance entanglement in low-dimensional systems [Phys. Rev. Lett. 96, 247206 (2006)],…
Limited quantum memory is one of the most important constraints for near-term quantum devices. Understanding whether a small quantum computer can simulate a larger quantum system, or execute an algorithm requiring more qubits than…
In this paper we present results illustrating the power and flexibility of one-bit teleportations in quantum bus computation. We first show a scheme to perform a universal set of gates on continuous variable modes, which we call a quantum…
A protocol of quantum communication is proposed in terms of the multi-qubit quantum teleportation through cluster states (Phys. Rev. Lett. \textbf{86}, 910 (2001)). Extending the cluster state based quantum teleportation on the basic unit…
We show how to construct a universal set of quantum logic gates using control over exchange interactions and single- and two-spin measurements only. Single-spin unitary operations are teleported instead of being executed directly, thus…
This thesis focuses on quantum information processing using the superconducting device, especially, on realizing quantum gates and algorithms in open quantum systems. Such a device is constructed by transmon-type superconducting qubits…
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…
Distributed architectures are a route to scalable quantum computing, but the performance of fault-tolerant operations across noisy inter-module links remains poorly characterized. We present circuit-level simulations of two key distributed…
The fundamental question of how to best simulate quantum systems using conventional computational resources lies at the forefront of condensed matter and quantum computation. It impacts both our understanding of quantum materials and our…
Can near-term gate model based quantum processors offer quantum advantage for practical applications in the pre-fault tolerance noise regime? A class of algorithms which have shown some promise in this regard are the so-called…
Quantum algorithms promise quadratic or exponential speedups for applications in cryptography, chemistry and material sciences. The topologies of today's quantum computers offer limited connectivity, leading to significant overheads for…
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…