Searcharxiv⌕ Search

arXiv subjects

Vladimir Buzek

Publications and source records attributed to Vladimir Buzek.

At least 73 records · Page 4Linked to original sources

Purification and correlated measurements of bipartite mixed states

We prove that all purifications of a non-factorable state (i.e., the state which cannot be expressed in a form $ρ_{AB}=ρ_A\otimesρ_B$) are entangled. We also show that for any bipartite state there exists a pair of measurements which are correlated on this state if and only if the state is non-factorable.

quant-ph↗

On the local unitary equivalence of states of multi-partite systems

Two pure states of a multi-partite system are alway are related by a unitary transformation acting on the Hilbert space of the whole system. This transformation involves multi-partite transformations. On the other hand some quantum information protocols such as the quantum teleportation and quantum dense coding are based on equivalence of some classes of states of bi-partite systems under the action of local (one-particle) unitary operations. In this paper we address the question: ``Under what conditions are the two states states, $\varrho$ and $σ$, of a multi-partite system locally unitary equivalent?'' We present a set of conditions which have to be satisfied in order that the two states are locally unitary equivalent. In addition, we study whether it is possible to prepare a state of a multi-qudit system. which is divided into two parts A and B, by unitary operations acting only on the systems A and B, separately.

quant-ph↗

Probabilistic implementation of universal quantum processors

We present a probabilistic quantum processor for qudits. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of the dimension N with a certain probability. If the operation is unitary, the probability is in general 1/N^2, but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.

quant-ph↗

Singlet states and the estimation of eigenstates and eigenvalues of an unknown Controlled-U gate

We consider several problems that involve finding the eigenvalues and generating the eigenstates of unknown unitary gates. We first examine Controlled-U gates that act on qubits, and assume that we know the eigenvalues. It is then shown how to use singlet states to produce qubits in the eigenstates of the gate. We then remove the assumption that we know the eigenvalues and show how to both find the eigenvalues and produce qubits in the eigenstates. Finally, we look at the case where the unitary operator acts on qutrits and has eigenvalues of 1 and -1, where the eigenvalue 1 is doubly degenerate. The eigenstates are unknown. We are able to use a singlet state to produce a qutrit in the eigenstate corresponding to the -1 eigenvalue.

quant-ph↗

Multiparticle entanglement with quantum logic networks: Application to cold trapped ions

We show how to construct a multi-qubit control gate on a quantum register of an arbitrary size N. This gate performs a single-qubit operation on a specific qubit conditioned by the state of other N-1 qubits. We provide an algorithm how to build up an array of networks consisting of single-qubit rotations and multi-qubit control-NOT gates for the synthesis of an arbitrary entangled quantum state of N qubits. We illustrate the algorithm on a system of cold trapped ions. This example illuminates the efficiency of the direct implementation of the multi-qubit CNOT gate compared to its decomposition into a network of two-qubit CNOT gates.

quant-ph↗

The no-signaling condition and quantum dynamics

We show that the basic dynamical rules of quantum physics can be derived from its static properties and the condition that superluminal communication is forbidden. More precisely, the fact that the dynamics has to be described by linear completely positive maps on density matrices is derived from the following assumptions: (1) physical states are described by rays in a Hilbert space, (2) probabilities for measurement outcomes at any given time are calculated according to the usual trace rule, (3) superluminal communication is excluded. This result also constrains possible non-linear modifications of quantum physics.

quant-ph↗

Equally-distant partially-entangled alphabet states for quantum channels

Each Bell state has the property that by performing just local operations on one qubit, the complete Bell basis can be generated. That is, states generated by local operations are totally distinguishable. This remarkable property is due to maximal quantum entanglement between the two particles. We present a set of local unitary transformations that generate out of partially entangled two-qubit state a set of four maximally distinguishable states that are mutually equally distant. We discuss quantum dense coding based on these alphabet states.

quant-ph↗

Quantum information distributors: Quantum network for symmetric and asymmetric cloning in arbitrary dimension and continuous limit

We show that for any Hilbert-space dimension, the optimal universal quantum cloner can be constructed from essentially the same quantum circuit, i.e., we find a universal design for universal cloners. In the case of infinite dimensions (which includes continuous variable quantum systems) the universal cloner reduces to an essentially classical device. More generally, we construct a universal quantum circuit for distributing qudits in any dimension which acts covariantly under generalized displacements and momentum kicks. The behavior of this covariant distributor is controlled by its initial state. We show that suitable choices for this initial state yield both universal cloners and optimized cloners for limited alphabets of states whose states are related by generalized phase-space displacements.

quant-ph↗

Entangled webs: Tight bound for symmetric sharing of entanglement

Quantum entanglement cannot be unlimitedly shared among arbitrary number of qubits. Larger the number of entangled pairs in an N-qubit system, smaller the degree of bi-partite entanglement is. We analyze a system of N qubits in which an arbitrary pair of particles is entangled. We show that the maximum degree of entanglement (measured in the concurrence) between any pair of qubits is 2/N. This tight bound can be achieved when the qubits are prepared in a pure symmetric (with respect to permutations) state with just one qubit in the basis state |0> and the others in the basis state |1>.

quant-ph↗

Recycling of quantum information: Multiple observations of quantum clocks

How much information about the original state preparation can be extracted from a quantum system which already has been measured? That is, how many independent (non-communicating) observers can measure the quantum system sequentially and give a nontrivial estimation of the original unknown state? We investigate these questions and we show from a simple example that quantum information is not entirely lost as a result of the measurement-induced collapse of the quantum state, and that an infinite number of independent observers who have no prior knowledge about the initial state can gain a partial information about the original preparation of the quantum system.

quant-ph↗

Optimal manipulations with qubits: Universal quantum entanglers

We analyze various scenarios for entangling two initially unentangled qubits. In particular, we propose an optimal universal entangler which entangles a qubit in unknown state $|Ψ>$ with a qubit in a reference (known) state $|0>$. That is, our entangler generates the output state which is as close as possible to the pure (symmetrized) state $(|Ψ>|0> +|0>|Ψ>)$. The most attractive feature of this entangling machine, is that the fidelity of its performance (i.e. the distance between the output and the ideally entangled -- symmetrized state) does not depend on the input and takes the constant value $F= (9+3\sqrt{2})/14\simeq 0.946$. We also analyze how to optimally generate from a single qubit initially prepared in an unknown state $|Ψ\r$ a two qubit entangled system which is as close as possible to a Bell state $(|Ψ\r|Ψ^\perp\r+|Ψ^\perp\r|Ψ\r)$, where $łΨ|Ψ^\perp\r =0$.

quant-ph↗

Quantum disentanglers

It is not possible to disentangle a qubit in an unknown state $|ψ>$ from a set of (N-1) ancilla qubits prepared in a specific reference state $|0>$. That is, it is not possible to {\em perfectly} perform the transformation $(|ψ,0...,0\r +|0,ψ,...,0\r +...+ |0,0,...ψ\r) \to |0,...,0>\otimes |ψ>$. The question is then how well we can do? We consider a number of different methods of extracting an unknown state from an entangled state formed from that qubit and a set of ancilla qubits in an known state. Measuring the whole system is, as expected, the least effective method. We present various quantum ``devices'' which disentangle the unknown qubit from the set of ancilla qubits. In particular, we present the optimal universal disentangler which disentangles the unknown qubit with the fidelity which does not depend on the state of the qubit, and a probabilistic disentangler which performs the perfect disentangling transformation, but with a probability less than one.

quant-ph↗

Entangling Atoms in Photonic Crystals

We propose a method for entangling a system of two-level atoms in photonic crystals. The atoms are assumed to move in void regions of a photonic crystal. The interaction between the atoms is mediated either via a defect mode or via resonant dipole-dipole interaction. We show that these interactions can produce pure entangled atomic states. We analyze the problem with parameters typical for currently existing photonic crystals and Rydberg atoms. We show that the atoms can emerge from photonic crystals in entangled states. Depending on the linear dimensions of the crystal and on their velocity of the entangled atoms can be separated by tens of centimeters.

quant-ph↗

Reconstruction of Liouvillian Superoperators

We show how to determine (reconstruct) a master equation governing the time evolution of an open quantum system. We present a general algorithm for the reconstruction of the corresponding Liouvillian superoperators. Dynamics of a two-level atom in various environments is discussed in detail.

quant-ph↗

Universal optimal cloning of qubits and quantum registers

We review our recent work on the universal (i.e. input state independent) optimal quantum copying (cloning) of qubits. We present unitary transformations which describe the optimal cloning of a qubit and we present the corresponding quantum logical network. We also present network for an optimal quantum copying ``machine'' (transformation) which produces N+1 identical copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copies, N. In addition, we present the machine which universaly and optimally clones states of quantum objects in arbitrary-dimensional Hilbert spaces. In particular, we discuss universal cloning of quantum registers.

quant-ph↗

Universal Algorithm for Optimal Estimation of Quantum States from Finite Ensembles

We present a universal algorithm for the optimal quantum state estimation of an arbitrary finite dimensional system. The algorithm specifies a physically realizable positive operator valued measurement (POVM) on a finite number of identically prepared systems. We illustrate the general formalism by applying it to different scenarios of the state estimation of N independent and identically prepared two-level systems (qubits).

quant-ph↗

Quantum copying: Fundamental inequalities

How well one can copy an arbitrary qubit? To answer this question we consider two arbitrary vectors in a two-dimensional state space and an abstract copying transformation which will copy these two vectors. If the vectors are orthogonal, then perfect copies can be made. If they are not, then errors will be introduced. The size of the error depends on the inner product of the two original vectors. We derive a lower bound for the amount of noise induced by quantum copying. We examine both copying transformations which produce one copy and transformations which produce many, and show that the quality of each copy decreases as the number of copies increases.

quant-ph↗