Related papers: Optimal joint remote state preparation of equatori…
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are…
$W$ states are quantum correlated states possessing both bipartite and multipartite entanglement, which makes them useful for several quantum algorithms. We propose a protocol to generate these states by exploiting {\it topological ring…
The ability of preparing perfect Bell pairs with a practical scheme is of great relevance for quantum communication as well as distributed quantum computing. We propose a scheme which probabilistically, but unambiguously produces the…
A single photon in a superposition of $d$ modes naturally encode a $d$-dimensional quantum system, a so-called qudit. We show that such superpositions can be leveraged to achieve a quantum speed-up of remote remote state preparation (RSP):…
We propose a quantum teleportation scheme for transmitting a single qutrit state by adopting a 2-qudit entangled state as the quantum channel. The measurement basis for Alice has been carefully and systematically constructed, which is…
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…
We propose a protocol of remote implementations of quantum operations by hybridizing bidirectional quantum state teleportation's (BQST) and Wang's one. The protocol is available for remote implemetations of quantum operations in the…
It is well-known that maximally entangled GHZ states can achieve perfect teleportation and superdense coding, whereas maximally entangled W states cannot. However, it has been demonstrated that there exists a special class of non-maximally…
Two tripartite schemes are put forward with shared entanglements and LOCC for sharing an operation on a remote target sate. The first scheme uses a Bell and a symmetric W states as quantum channels, while the second replaces the symmetric W…
In pursuit of enhancing the predication capabilities of the neural network, it has been a longstanding objective to create dataset encompassing a diverse array of samples. The purpose is to broaden the horizons of neural network and…
We address the fundamental task of converting $n$ uses of an unknown unitary transformation into a quantum state (i.e., storage) and later retrieval of the transformation. Specifically, we consider the case where the unknown unitary is…
We propose two deterministic secure quantum communication (DSQC) protocols employing three-qubit GHZ-like states and five-qubit Brown states as quantum channels for secure transmission of information in units of two bits and three bits…
Interconnecting well-functioning, scalable stationary qubits and photonic qubits could substantially advance quantum communication applications and serve to link future quantum processors. Here, we present two protocols for transferring the…
We propose a novel scheme for probabilistic teleportation when the information of the partially entangled state is only available for the sender. This is in contrast with the fact that the receiver must know the non-maximally entangled…
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…
We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) computers by applying a genetic algorithm to generate quantum circuits for state preparation. The algorithm can account for the specific…
We suggest a protocol for perfect quantum communication through spin chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success…
Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given…
We present a scheme to prepare a quantum state in a ion trap with probability approaching to one by means of ion trap quantum computing and Grover's quantum search algorithm acting on trapped ions.
A measurement-based quantum feedback protocol is developed for spin state initialization in a gate-defined double quantum dot spin qubit coupled to a superconducting resonator. The protocol improves qubit state initialization as it is able…