Related papers: Generating efficient quantum circuits for preparin…
Shared entanglement between spatially separated systems is an essential resource for quantum information processing including long-distance quantum cryptography and teleportation. While purification protocols for mixed distributed entangled…
We investigate the generation of multipartite entangled state in a system of N quantum dots embedded in a microcavity and examine the emergence of genuine multipartite entanglement by three different characterizations of entanglement. At…
Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers,…
Time-frequency entangled photons constitute an important resource for a plethora of applications across the diverse quantum technology landscape. Thus, efficient and tunable setups for the generation of entangled photons are requisite for…
Cluster states, a special type of highly entangled states, are a universal resource for measurement-based quantum computation. Here, we propose an efficient one-step generation scheme for cluster states in semiconductor quantum dot…
We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an…
The cluster state, the highly entangled state that is the central resource for one-way quantum computing, can be efficiently generated in a variety of physical implementations via global nearest-neighbor interactions. In practice, a…
A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a a unitary matrix U, into a product of simpler U j via a neural network. These U j can then be decomposed…
A quantum telecloning process combining quantum teleportation and optimal quantum cloning from one input to M outputs is presented. The scheme relies on the establishment of particular multiparticle entangled states, which function as…
A scheme for generating an entangled state in a two spin-1/2 system by means of a spin-dependent potential scattering of another qubit is presented and analyzed in three dimensions. The entanglement is evaluated in terms of the concurrence…
Distributed quantum computing has been well-known for many years as a system composed of a number of small-capacity quantum circuits. Limitations in the capacity of monolithic quantum computing systems can be overcome by using distributed…
Entanglement between spatially distant qubits is perhaps the most counterintuitive and vital resource for distributed quantum computing. However, despite a few special cases, there is no known general procedure to maximally entangle two…
An interesting aspect of multipartite entanglement is that for perfect teleportation and superdense coding, not the maximally entangled W states but a special class of non-maximally entangled W-like states are required. Therefore, efficient…
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. Circuit cutting techniques enable the distribution of quantum computations through classical…
This paper addresses the challenge of preparing mixed quantum states -- both arbitrary states in general and highly sparse ones in particular -- an area that has received far less attention than the preparation of pure states. We present…
The simple and universal global optimization method based on simplified multipopulation genetic algorithm is presented. The method is applied to quantum information problems. It is compared to the genetic algorithm on standard test…
In this paper, we presented a physical scheme to generate the multi-cavity maximally entangled W state via cavity QED. All the operations needed in this scheme are to modulate the interaction time only once.
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…
We propose efficient algorithms with logarithmic step complexities for the generation of entangled $GHZ_N$ and $W_N$ states useful for quantum networks, and we demonstrate an implementation on the IBM quantum computer up to $N=16$. Improved…
The generation of entanglement across different nodes in distributed quantum architectures plays a pivotal role for different applications. In particular, deterministic, robust, and fast protocols that prepare genuine multipartite entangled…