Related papers: Entanglement Is Not Necessary for Perfect Discrimi…
We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The…
We demonstrate that conditional as well as unconditional basic operations which are prerequisite for universal quantum gates can be performed with almost 100% fidelity within a strongly interacting two-electron quantum ring. Both sets of…
Recently, the entanglement dynamics of two harmonic oscillators initially prepared in a separable-coherent state was demonstrated to offer a pathway for prime number identification. This article presents a generalized approach and outlines…
In early days of quantum theory it was believed that the results of measurements performed on two distant physical systems should be uncorrelated thus their quantum state should be separable it means described by a simple tensor product of…
The notion of entanglement of quantum states is usually defined with respect to a fixed bipartition. Indeed, a global basis change can always map an entangled state to a separable one. The situation is however different when considering a…
Quantum discord is significant in analyzing quantum nonclassicality beyond the paradigm of entanglement. Presently we have explored the effectiveness of global unitary operations in manifesting quantum discord from a general two qubit zero…
Quantum coherence plays a fundamental and operational role in different areas of physics. A resource theory has been developed to characterize the coherence of distinguishable particles systems. Here we show that indistinguishability of…
Quantum protocols for secret sharing usually rely on multi-party entanglement which with present technology is very difficult to achieve. Recently it has been shown that sequential manipulation and communication of a single $d-$ level state…
The existence of pseudorandom unitaries (PRUs) -- efficient quantum circuits that are computationally indistinguishable from Haar-random unitaries -- has been a central open question, with significant implications for cryptography,…
We study minimum-error identification of an unknown single-bit Boolean function given black-box (oracle) access with one allowed query. Rather than stopping at an abstract optimal measurement, we give a fully constructive solution: an…
Quantum state elimination measurements tell us what states a quantum system does not have. This is different from state discrimination, where one tries to determine what the state of a quantum system is, rather than what it is not. Apart…
Coherence and entanglement are the two most crucial resources for various quantum information processing tasks. Here, we study the interplay of coherence and entanglement under the action of different three qubit quantum cloning operations.…
We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate…
We address the question of finding the most effective convex decompositions into boundary elements (so-called boundariness) for sets of quantum states, observables and channels. First we show that in general convex sets the boundariness…
Roa et al. showed that quantum state discrimination between two nonorthogonal quantum states does not require quantum entanglement but quantum dissonance only. We find that quantum coherence can also be utilized for unambiguous quantum…
We study an optimized measurement that discriminates two mixed quantum states with maximum confidence for each conclusive result, thereby keeping the overall probability of inconclusive results as small as possible. When the rank of the…
We introduce an operational procedure to determine, with arbitrary probability and accuracy, optimal entanglement witness for every multipartite entangled state. This method provides an operational criterion for separability which is…
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these…
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the…
Quantum separable operations are defined as those that cannot produce entanglement from separable states, and it is known that they strictly surpass local operations and classical communication (LOCC) in a number of tasks, which is…