Related papers: Explore Simpler Eigenmarking: Quantum Entailment M…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
Concurrence, as one of entanglement measures, is a useful tool to characterize quantum entanglement in various quantum systems. However, the computation of the concurrence involves difficult optimizations and only for the case of two qubits…
We obtain a simplified and obvious expression of "concurrence" in Wootters' measure of entanglement of a pair of qubits having no more than two non-zero eigenvalues in terms of concurrences of eigenstates and their simple combinations. It…
The quantum state discrimination problem is to distinguish between non-orthogonal quantum states. This problem has many applications in quantum information theory, quantum communication and quantum cryptography. In this paper a quantum…
The genuine concurrence is a standard quantifier of multipartite entanglement, detection and quantification of which still remains a difficult problem from both theoretical and experimental point of view. Although many efforts have been…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
Self-testing is a powerful device-independent technique that enables one to deduce the forms of both the quantum state and the measurements involved in a physical experiment based solely on observed correlations. Although numerous schemes…
With the advance of quantum information technology, the question of how to most efficiently test quantum circuits is becoming of increasing relevance. Here we introduce the statistics of lengths of measurement sequences that allows one to…
Quantum technologies lead to a variety of applications that outperform their classical counterparts. In order to build a quantum device it must be verified that it operates below some error threshold. Recently, because of technological…
Generalized Grover's searching algorithm for the case in which there are multiple marked states is demonstrated on a nuclear magnetic resonance (NMR) quantum computer. The entangled basis states (EPR states) are synthesized using the…
Entanglement is one of the key resources of quantum information science which makes identification of entangled states essential to a wide range of quantum technologies and phenomena. This problem is however both computationally and…
We investigate the performance of Grover's quantum search algorithm on a register which is subject to loss of the particles that carry the qubit information. Under the assumption that the basic steps of the algorithm are applied correctly…
By harnessing the superposition and entanglement of physical states, quantum computers could outperform their classical counterparts in solving problems of technological impact, such as factoring large numbers and searching databases. A…
Quantum entanglement is the key resource for quantum information processing. Device-independent certification of entangled states is a long standing open question, which arouses the concept of self-testing. The central aim of self-testing…
Quantum entanglement is essential to the development of quantum computation, communications, and technology. The controlled SWAP test, widely used for state comparison, can be adapted to an efficient and useful test for entanglement of a…
We discuss how to build some partially entangled states of $n$ two-state quantum systems (qubits). The optimal partially entangled state with a high degree of symmetry is considered to be useful for overcoming a shot noise limit of Ramsey…
We discuss quantum state tomography via a stepwise reconstruction of the eigenstates of the mixed states produced in experiments. Our method is tailored to the experimentally relevant class of nearly pure states or simple mixed states,…
A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation in Grover's search algorithm can be used to construct a (less efficient) quantum search algorithm is cleared. The…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…