Related papers: A sufficient and necessary condition for superdens…
Entangled states that cannot be distilled to maximal entanglement are called bound entangled and they are often viewed as too weak to break the limitations of classical models. Here, we show a strongly contrasting result: that bound…
We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is…
We propose here a new idea for quantum teleportation of superposed coherent state which is not only almost perfect, in principle, but also feasible experimentally. We use entangled resource $\sim…
We show that bipartite bound entangled states make possible violations of correlation inequalities in the prepare-and-measure scenario. These inequalities are satisfied by all classical models as well as by all quantum models that do not…
The utilization of a $d$-level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding…
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…
We examine the possible states of subsystems of a system of bits or qubits. In the classical case (bits), this means the possible marginal distributions of a probability distribution on a finite number of binary variables; we give necessary…
Given a bipartite quantum state (in arbitrary dimension) and a decomposition of it as a superposition of two others, we find bounds on the entanglement of the superposition state in terms of the entanglement of the states being superposed.…
We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states…
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…
We question the role of entanglement in masking quantum information contained in a set of mixed quantum states. We first show that a masker that can mask any two single-qubit pure states, can mask the entire set of mixed states comprising…
When a subset of particles in an entangled state is measured, the state of the subset of unmeasured particles is determined by the outcome of the measurement. This first measurement may be thought of as a state preparation for the remaining…
Large series of prime numbers can be superposed on a single quantum register and then analyzed in full parallelism. The construction of this Prime state is efficient, as it hinges on the use of a quantum version of any efficient primality…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
We propose a probabilistic scheme to prepare a maximally entangled state between a pair of two-level atoms inside a leaking cavity, without requiring precise time-controlling of the system evolution and initial atomic state. We show that…
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that…
The inference of entangled quantum states by recourse to the maximum entropy principle is considered in connection with the recently pointed out problem of fake inferred entanglement [R. Horodecki, {\it et al.}, Phys. Rev. A {\it 59} (1999)…
We determine the optimal entanglement rate of quantum state merging when assuming that the state is unknown except for its membership in a certain set of states. We find that merging is possible at the lowest rate allowed by the individual…
We consider mixed states of two qubits and show under which global unitary operations their entanglement is maximized. This leads to a class of states that is a generalization of the Bell states. Three measures of entanglement are…
In this work we provide a method for generating quantum circuits preparing maximally multipartite entangled states using genetic programming. The presented method is faster that known realisations thanks to the applied fitness function and…