Related papers: Efficient Quantum Algorithm for Port-based Telepor…
Port-based teleportation (PBT), introduced in 2008, is a type of quantum teleportation protocol which transmits the state to the receiver without requiring any corrections on the receiver's side. Evaluating the performance of PBT was…
We study representation theory of the partially transposed permutation matrix algebra, a matrix representation of the diagrammatic walled Brauer algebra. This algebra plays a prominent role in mixed Schur-Weyl duality that appears in…
We propose and numerically simulate a semiconductor device based on coupled quantum wires, suitable for deterministic quantum teleportation of electrons trapped in the minima of surface acoustic waves.We exploit a network of interacting…
The QR algorithm is one of the three phases in the process of computing the eigenvalues and the eigenvectors of a dense nonsymmetric matrix. This paper describes a task-based QR algorithm for reducing an upper Hessenberg matrix to real…
Telecloning is a protocol introduced by Murao et al. [Phys. Rev. A 59, 156 (1999)] to distribute copies of an unknown quantum state to many receivers in a way that beats the trivial ``clone-and-teleport'' protocol. In the last decade, a new…
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…
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…
Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
A major goal for fault-tolerant quantum computation (FTQC) is to reduce the overhead needed for error correction. One approach is to use block codes that encode multiple qubits, which can achieve significantly higher rates for the same code…
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…
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
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…
The scalability of quantum computing is currently limited by physical, technological, and architectural constraints that hinder the integration of a large number of qubits within a single quantum processor. Distributed quantum computing…
Quantum computing promises to solve previously intractable problems, with neutral atoms emerging as a promising technology. Zoned neutral atom architectures allow for immense parallelism and higher coherence times by shielding idling atoms…
Quantum transduction is an important building block for quantum networking. Although various platforms have been proposed, the efficiency of the-state-of-the-art systems is still way below the threshold to provide robust quantum information…
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…
The ideal realization of quantum teleportation relies on having access to a maximally entangled state; however, in practice, such an ideal state is typically not available and one can instead only realize an approximate teleportation. With…
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…
The scheme of quantum teleportation, where Bob has multiple (N) output ports and obtains the teleported state by simply selecting one of the N ports, is thoroughly studied. We consider both deterministic version and probabilistic version of…