Related papers: Perfect State Transfer, Effective Gates and Entang…
Quantum entanglement plays an irreplaceable role in various remote quantum information processing tasks. Here we present protocols for generating deterministic and heralded $N$-qubit entangled states across multiple network nodes. By…
Quantum teleportation with additional a priori information about the input state achieves higher fidelity than teleportation of a completely unknown state. However, perfect teleportation of two non-orthogonal input states requires the same…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
The quantum computing paradigm in photonics currently relies on the multi-port interference in linear optical devices, which is intrinsically based on probabilistic measurements outcome and thus non-deterministic. Devising a fully…
We present a general formalism to the problem of perfect state-transfer (PST), where the state involves multiple excitations of the quantum network. A key feature of our formalism is that it allows for inclusion of nontrivial interactions…
Based on $d$-dimensional quantum full homomorphic encryption, an efficient and secure quantum network coding protocol is proposed in this paper. First, a quantum full homomorphic encryption protocol is constructed utilizing $d$-dimensional…
Quantum logic gates must perform properly when operating on their standard input basis states, as well as when operating on complex superpositions of these states. Experiments using superconducting qubits have validated the truth table for…
Highly efficient transfer of quantum resources including quantum excitations, states, and information on quantum networks is an important task in quantum information science. Here, we propose a bipartite-graph framework for studying quantum…
The evolution of certain pair state in a quantum network with isomorphic branches, governed by the Heisenberg $XY$ Hamiltonian, depends solely on the local structure, and it remains unaffected even if the global structure is altered. All…
Motivated by the need for communication of coherent state-based qubits in quantum computers, we introduce a method for perfect transferring of an arbitrary superposition of coherent states between two distant nodes of a linear array of…
We present improved circuits for the control-control-phase (Toffoli) gate and the control-swap (Fredkin) gate using three and four global two-qubit gates, respectively. This is a nearly double speed-up compared to the conventional circuits,…
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…
Tensor network states, and in particular projected entangled pair states, play an important role in the description of strongly correlated quantum lattice systems. They do not only serve as variational states in numerical simulation…
Continuous U(1) gauge symmetry, which guarantees the conservation of the total excitations in linear bosonic systems, will be broken when it comes to the strong-coupling regime where the rotation wave approximation (RWA) fails. Here we…
We report the first experimental realization of perfect W-state in a superconducting qubit based system. In contrast to maximally entangled state, the perfect W state is different in weights and phases of the terms contained in the…
A simple, general and practically exact method, Entanglement Perturbation Theory (EPT), is formulated to calculate the ground states of 2D macroscopic quantum systems with translational symmetry. An emphasis will be placed on the…
We investigate entanglement distribution in pure-state quantum networks. We consider the case when non-maximally entangled two-qubit pure states are shared by neighboring nodes of the network. For a given pair of nodes, we investigate how…
We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static…
We study the elliptic spin-1/2 Kondo model (spin-1/2 fermions in one dimension with fully anisotropic contact interactions with a magnetic impurity) in the light of mappings to bosonic systems using the fermion-boson correspondence and…
Quantum networks consist of quantum nodes that are linked by entanglement and quantum information can be transferred from one node to another. Operations can be applied to qubits of local nodes coordinated by classical communication to…