Related papers: Partition of 3-qubits using local gates
We present a method to find the decompositions of tripartite entangled pure states which are smaller than two successive Schmidt decompositions. The method becomes very simple when one of the subsystems is a qubit. In this particular case,…
Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more…
We propose a quantum circuit composed of $cNOT$ gates and four single-qubit gates to generate a $W$ state of three qubits. This circuit was then enhanced by integrating two-qubit gates to create a $W$ state of four and five qubits. After a…
We study the entanglement of a pure state of a composite quantum system consisting of several subsystems with $d$ levels each. It can be described by the R\'enyi-Ingarden-Urbanik entropy $S_q$ of a decomposition of the state in a product…
A qubit, or quantum bit, is conventionally defined as "a physical system for storing information that is capable of existing in either of two quantum states or in a superposition of both". In this paper, we examine the simple question of…
For pure symmetric 3-qubit states there are only three algebraically independent entanglement measures; one choice is the pairwise concurrence $\mathcal C$, the 3-tangle $\tau$, and the Kempe invariant $\kappa$. Using a canonical form for…
We consider a quantum system of n qudits and the Clebsch-Gordan decomposition of the associated Hilbert space. In this decomposition, one of the subspaces is the so-called symmetric subspace or symmetric sector, that is, the subspace of all…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…
We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an $N$-dimensional state in depth $O(\log(N))$ and spacetime allocation (a…
Understanding what can be inferred about a multi-particle quantum system from only the knowledge of its subparts is a highly non-trivial task. Clearly, if the global system doesn't contain any information resource, nor do its subparts.…
Crosstalk and several sources of operational interference are invisible when qubit or a gate is calibrated or benchmarked in isolation. These are unlocked during the execution of full quantum circuit applying entangling gates to several…
The formation of multipartite quantum entanglement by repeated operation of one and two qubit gates is examined. The resulting entanglement is evaluated using two measures: the average bipartite entanglement and the Groverian measure. A…
We explicitly exhibit a set of four ququad-ququad orthogonal maximally entangled states that cannot be perfectly distinguished by means of local operations and classical communication. Before our work, it was unknown whether there is a set…
We study the entanglement dynamics of $n=2,3,4$-qubit Bell- and GHZ-type states under an amplitude-damping channel (ADC). We quantify multipartite entanglement using the genuine multipartite concurrence (GMC) and evaluate its utility…
Complex numbers are central to the formulation of quantum mechanics, yet their role as a genuine resource is only beginning to be understood. In this work, we demonstrate that quantum states with intrinsically complex amplitudes provide a…
State space structure of tripartite quantum systems is analyzed. In particular, it has been shown that the set of states separable across all the three bipartitions [say $\mathcal{B}^{int}(ABC)$] is a strict subset of the set of states…
We characterize the entanglement contained in a pure three-qubit state via operational entanglement measures. To this end we derive a new decomposition for arbitrary 3-qubit states which is characterized by five parameters (up to local…
We devise a deterministic quantum algorithm to produce antisymmetric states of single-particle orbitals in the first quantization mapping. Unlike sorting-based antisymmetrization algorithms, which require ordered input states and high…
While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture. Connectivity of the physical qubits is one such constraint that restricts two-qubit…
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood…