Related papers: Implementation of a Deutsch-like quantum algorithm…
We introduce a protocol to classify three-qubit pure states into different entanglement classes and implement it on an NMR quantum processor. The protocol is designed in such a way that the experiments performed to classify the states can…
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm…
The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt, or tensor product…
The improved quantum scheduling algorithm proposed by Grover has been generalized using the generalized quantum search algorithm, in which a unitary operator replaces the Walsh-Hadamard transform, and $\pi/2$ phase rotations replace the…
We calculate the two-qubit disentanglement due to classical random telegraph noise using the quasi-Hamiltonian method. This allows us to obtain analytical results even for strong coupling and mixed noise, important when the qubits have…
Quantum entanglement is the cornerstone of quantum technology and enables quantum devices to outperform classical systems in terms of performance. However, detecting entanglement in high-dimensional systems remains a significant challenge…
Searching for marked items from an unsorted database is an important scientific problem and a benchmark for computing devices as well. Using a 7-qubit liquid NMR quantum computer, we have demonstrated successfully an hybrid quantum fetching…
The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal…
Entanglement is at the heart of quantum theory and is responsible for various quantum-enabling technologies. In practice, during its preparation, storage, and distribution to the intended recipients, this valuable quantum resource may…
We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those…
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical…
In the discussion about the quantumness of NMR computation a conclusion is done that computational states are separable and therefore can not be entangled. This conclusion is based on the assumption that the initial density matrix of an…
Entanglement distillation is a procedure for extracting from one or more pairs of entangled qubits a smaller number of pairs with a higher degree of entanglement that is essential for many applications in quantum information science.…
We investigate the entanglement of the ground state in the quantum networks that their nodes are considered as quantum harmonic oscillators. To this aim, the Schmidt numbers and entanglement entropy between two arbitrary partitions of a…
Entanglement is a fundamental feature of quantum mechanics, playing a crucial role in quantum information processing. However, classifying entangled states, particularly in the mixed-state regime, remains a challenging problem, especially…
Quantum correlations in multiple quantum (MQ) NMR experiments are investigated in two-spin systems (dimers). In the initial moment of time one spin is in a pure quantum polarized state and the other spin is in the thermodynamic equilibrium…
The intermediate quantum states of multiple qubits, generated during the operation of Shor's factoring algorithm are analyzed. Their entanglement is evaluated using the Groverian measure. It is found that the entanglement is generated…
Local Operations enhancing the entanglement of bipartite quantum states are of great interest in quantum information processing. Subject of this paper are local selective operations acting on single copies of states. Such operations can…
We give an elementary introduction to the notion of quantum entanglement between distinguishable parties and review a recent proposal about solid state quantum computation with spin-qubits in quantum dots. The indistinguishable character of…