Related papers: Efficient Quantum Algorithm for Port-based Telepor…
We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis…
This thesis presents an efficient quantum algorithm and explicit circuits for generating eigenstates of arbitrary SU(2) and SU(3) representations. These include a wide variety of highly entangled states. The algorithm uses Schur transform…
We report an experimental implementation of tripartite controlled quantum teleportation on the quantum optical devices. The protocol is performed through bi- and tripartite entangled channels of discrete variables and qubits encoded in…
Any bipartite nonlocal unitary operation can be carried out by teleporting a quantum state from one party to the other, performing the unitary gate locally, and teleporting a state back again. This paper investigates unitaries which can be…
This study investigates quantum energy teleportation (QET) using stochastic bi-partitioning in an $N-$body Hamiltonian system. In this protocol, project measurements are performed on $(N - m)$ qubits to capture quantum fluctuation…
The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…
Nonlinear differential equations model diverse phenomena but are notoriously difficult to solve. While there has been extensive previous work on efficient quantum algorithms for linear differential equations, the linearity of quantum…
Quantum time evolution exhibits rich physics, attributable to the interplay between the density and phase of a wave function. However, unlike classical heat diffusion, the wave nature of quantum mechanics has not yet been extensively…
It is a major challenge to construct good quantum codes supporting fault-tolerant (e.g. transversal) non-Clifford gates with low-weight parity-check measurements. In this paper, we construct the first known quantum codes with linear…
Distributed quantum computing (DQC) is a new paradigm aimed at scaling up quantum computing via the interconnection of smaller quantum processing units (QPUs). Shared entanglement allows teleportation of both states and gates between QPUs.…
We consider multiple teleportation in the Knill-Laflamme-Milburn (KLM) scheme. We introduce adaptive teleportation, i.e., such that the choice of entangled state used in the next teleportation depends on the results of the measurements…
Shor's algorithm efficiently solves factoring and discrete logarithm problems using quantum computers, compromising all public key schemes used today. These schemes rely on assumptions on their computational complexity, which quantum…
We demonstrate how insights gained from reformulating the problem of quantum teleportation into one of reversing quantum operations, and designing optimum completely positive maps for teleportation, can enable one to explore optimal…
Quantum teleportation is an essential application of quantum entanglement. The examination of teleportation fidelity in two-party standard teleportation schemes reveals a critical threshold distinguishing separable and entangled states. For…
The quantum Schur transform maps the computational basis of a system of $n$ qudits onto a \textit{Schur basis}, which spans the minimal invariant subspaces of the representations of the unitary and the symmetric groups acting on the state…
We consider the problem of secure packet routing at the maximum achievable rate in Quantum Key Distribution (QKD) networks. Assume that a QKD protocol generates symmetric private key pairs for secure communication over each link in a…
Quantum teleportation is an essential capability for quantum networks, allowing the transmission of quantum bits (qubits) without a direct exchange of quantum information. Its implementation between distant parties requires teleportation of…
We investigate the hardware requirements for quantum teleportation in an intercity-scale network topology consisting of two metropolitan-scale networks connected via a long-distance backbone link. Specifically, we identify the minimal…
It is crucial to design quantum circuits as small as possible and as shallow as possible for quantum information processing tasks. We design quantum circuits with simplified gate-count, cost, and depth for implementing quantum teleportation…
Although quantum computing holds promise for solving Combinatorial Optimization Problems (COPs), the limited qubit capacity of NISQ hardware makes large-scale instances intractable. Conventional methods attempt to bridge this gap through…