Related papers: Non-classical Correlations in the Quantum Search A…
The aim of this thesis is to investigate quantum entanglement and quantum nonlocality of bipartite finite-dimensional systems (bipartite qudits). Entanglement is one of the most fascinating non-classical features of quantum theory, and…
Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover's algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at…
We investigate the decay of two-qubit entanglement caused by the influence of classical noise. We consider the whole spectrum of cases ranging from independent to fully correlated noise affecting each qubit. We take into account different…
Entanglement and quantum communication are paradigmatic resources in quantum information science leading to correlations between systems that have no classical analogue. Correlations due to entanglement when communication is absent have for…
Quantum correlation lies at the very heart of almost all the non-classical phenomena exhibited by quantum systems composed of more than one subsystem. In the recent days it has been pointed out that there exists quantum correlation, namely…
Entanglement entropy, which is a measure of quantum correlations between separate parts of a many-body system, has emerged recently as a fundamental quantity in broad areas of theoretical physics, from cosmology and field theory to…
We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…
We propose a scheme for entangling the motion of two massive objects in a hybrid electromechanical architecture. The entanglement is generated due to the interaction of two mechanical oscillators with a mediating superconducting qubit. We…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best…
Entropic uncertainty and entanglement are two distinct aspects of quantum mechanical procedures. To estimate entropic uncertainty relations, entropies are used: the greater the entropy bound, the less effective the quantum operations and…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The…
We analyse the use of entangled states to perform quantum computations non locally among distant nodes in a quantum network. The complexity associated with the generation of multiparticle entangled states is quantified in terms of the…
Entanglement is a physical resource of a quantum system just like mass, charge or energy. Moreover it is an essential tool for many purposes of nowadays quantum information processing, e.g. quantum teleportation, quantum cryptography or…
Noise in entangled quantum systems is difficult to characterize due to many-body effects involving multiple degrees of freedom. This noise poses a challenge to quantum computing, where two-qubit gate performance is critical. Here, we…
We study the steady state entanglement and correlations of an open system comprised of two coupled fermions in the equilibrium or nonequilibrium environments and distill the nonequilibrium contribution to the quantum correlations. We show…
The Groverian entanglement measure introduced earlier for pure quantum states [O. Biham, M.A. Nielsen and T. Osborne, Phys. Rev. A 65, 062312 (2002)] is generalized to the case of mixed states, in a way that maintains its operational…
A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Such a correspondence, however, does not exist even for pure quantum states in the multipartite domain.…
As quantum error corrections still cannot be realized physically, quantum noise is the most profound obstacle to the implementations of large-scale quantum algorithms or quantum schemes. It has been well-known that if a quantum computer…
Unstructured search remains as one of the significant challenges in computer science, as classical search algorithms become increasingly impractical for large-scale systems due to their linear time complexity. Quantum algorithms, notably…
Searching a database is a central task in computer science and is paradigmatic of transport and optimization problems in physics. For an unstructured search, Grover's algorithm predicts a quadratic speedup, with the search time…