Related papers: Quantum Computing Without Entanglement
Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…
Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such…
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…
Entanglement is a purely quantum mechanical phenomenon and thus it has no classical analog. On the other hand, coherence is a well-known phenomenon in classical optics and in quantum mechanics. Recent research shows that quantum coherence…
Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…
Entanglement is the powerful and enigmatic resource central to quantum information processing, which promises capabilities in computing, simulation, secure communication, and metrology beyond what is possible for classical devices. Exactly…
The widely accepted basis for quantum computing advantage is derived from the entanglement and superposition properties of the probabilistic interpretation of the underlying quantum mechanical formalism which in turn is widely accepted…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently…
"Quantum conversation" is a way in which two parties can communicate classical information with each other using entanglement as a shared resource. We present this scheme using a multipartite entangled state after describing its generation…
Quantum theory makes the most accurate empirical predictions and yet it lacks simple, comprehensible physical principles from which the theory can be uniquely derived. A broad class of probabilistic theories exist which all share some…
A promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios.…
Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we consider the application of quantum computers to scientific computing and…
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 study the degree to which quantum entanglement survives when a three-qubit entangled state is copied by using local and non-local processes, respectively, and investigate iterating quantum copying for the three-qubit system. There may…
We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from…
In quantum systems, entanglement corresponds to nonclassical correlation of nonlocal observables. Thus, entanglement (or, to the contrary, separability) of a given quantum state is not uniquely determined by properties of the state, but may…
Understanding the resource consumption in distributed scenarios is one of the main goals of quantum information theory. A prominent example for such a scenario is the task of quantum state merging where two parties aim to merge their parts…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As…