arXiv subjects

Vladimir Buzek

Publications and source records attributed to Vladimir Buzek.

At least 55 records · Page 3Linked to original sources

arXiv2005

Process reconstruction: From unphysical to physical maps via maximum likelihood

We show that the method of maximum likelihood (MML) provides us with an efficient scheme for reconstruction of quantum channels from incomplete measurement data. By construction this scheme always results in estimations of channels that are completely positive. Using this property we use the MML for a derivation of physical approximations of un-physical operations. In particular, we analyze the optimal approximation of the universal NOT gate as well as a physical approximation of a quantum nonlinear polarization rotation.

quant-ph↗

arXiv2004

Process reconstruction from incomplete and/or inconsistent data

We analyze how an action of a qubit channel (map) can be estimated from the measured data that are incomplete or even inconsistent. That is, we consider situations when measurement statistics is insufficient to determine consistent probability distributions. As a consequence either the estimation (reconstruction) of the channel completely fails or it results in an unphysical channel (i.e., the corresponding map is not completely positive). We present a regularization procedure that allows us to derive physically reasonable estimates (approximations) of quantum channels. We illustrate our procedure on specific examples and we show that the procedure can be also used for a derivation of optimal approximations of operations that are forbidden by the laws of quantum mechanics (e.g., the universal NOT gate).

quant-ph↗

arXiv2004

Realization of POVMs using measurement-assisted programmable quantum processors

We study possible realizations of generalized quantum measurements on measurement-assisted programmable quantum processors. We focus our attention on the realization of von Neumann measurements and informationally complete POVMs. It is known that two unitary transformations implementable by the same programmable processor require mutually {\it orthogonal} states. It turns out that the situation with von Neumann measurements is different. Specifically, in order to realize two such measurements one does not have to use orthogonal program states. On the other hand, the number of the implementable von Neumann measurements is still limited. As an example of a programmable processor we use the so-called quantum information distributor.

quant-ph↗

arXiv2004

Realization of the Optimal Universal Quantum Entangler

We present the first experimental demonstration of the ''optimal'' and ''universal'' quantum entangling process involving qubits encoded in the polarization of single photons. The structure of the ''quantum entangling machine'' consists of the quantum injected optical parametric amplifier by which the contextual realization of the 1->2 universal quantum cloning and of the universal NOT (U-NOT) gate has also been achieved.

quant-ph↗

arXiv2004

Description of quantum dynamics of open systems based on collision-like models

Master equations in the Lindblad form describe evolution of open quantum systems that is completely positive and simultaneously has a semigroup property. We analyze a possibility to derive this type of master equations from an intrinsically discrete dynamics that is modelled as a sequence of collisions between a given quantum system (a qubit) with particles that form the environment. In order to illustrate our approach we analyze in detail how a process of an exponential decay and a process of decoherence can be derived from a collision-like model in which particular collisions are described by SWAP and controlled-NOT interactions, respectively.

quant-ph↗

arXiv2004

Reconstruction of superoperators from incomplete measurements

We present strategies how to reconstruct (estimate) properties of a quantum channel described by the map E based on incomplete measurements. In a particular case of a qubit channel a complete reconstruction of the map E can be performed via complete tomography of four output states E[rho_j ] that originate from a set of four linearly independent test states j (j = 1, 2, 3, 4) at the input of the channel. We study the situation when less than four linearly independent states are transmitted via the channel and measured at the output. We present strategies how to reconstruct the channel when just one, two or three states are transmitted via the channel. In particular, we show that if just one state is transmitted via the channel then the best reconstruction can be achieved when this state is a total mixture described by the density operator rho = I/2. To improve the reconstruction procedure one has to send via the channel more states. The best strategy is to complement the total mixture with pure states that are mutually orthogonal in the sense of the Bloch-sphere representation. We show that unitary transformations (channels) can be uniquely reconstructed (determined) based on the information of how three properly chosen input states are transformed under the action of the channel.

quant-ph↗

arXiv2003

Generalized measurements via programmable quantum processor

We show that it is possible to control the trade-off between information gain and disturbance in generalized measurements of qudits by utilizing the programmable quantum processor. This universal quantum machine allows us to perform a generalized measurement on the initial state of the input qudit to construct a Husimi function of this state. The trade-off between the gain and the disturbance of the qudit is controlled by the initial state of ancillary system that acts as a program register for the quantum-information distributor. The trade-off fidelity does not depend on the initial state of the qudit.

quant-ph↗

arXiv2003

Improving performance of probabilistic programmable quantum processors

We present a systematic analysis how one can improve performance of probabilistic programmable quantum processors. We generalize a simple Vidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the phase of the rotation encoded in a state of the program register. We show how the probability of success of the probabilistic processor can be enhanced by using the processor in loops. In addition we show that the same strategy can be utilized for a probabilistic implementation of non-unitary transformations on qubits. In addtion, we show that an arbitrary SU(2) transformations of qubits can be encoded in program state of a universal programmable probabilistic quantum processor. The probability of success of this processor can be enhanced by a systematic correction of errors via conditional loops. Finally, we show that all our results can be generalized also for qudits. In particular, we show how to implement SU (N) rotations of qudits via programmable quantum processor and how the performance of the processor can be enhanced when it is used in loops.

quant-ph↗

arXiv2003

Controlling bi-partite entanglement in multi-qubit systems

Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in order to analyze pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits.

quant-ph↗

arXiv2003

Entangled graphs II: Classical correlations in multi-qubit entangled systems

Bipartite correlations in multi-qubit systems cannot be shared freely. The presence of entanglement or classical correlation on certain pairs of qubits may imply correlations on other pairs. We present a method of characterization of bi-partite correlations in multi-qubit systems using a concept of entangled graphs that has been introduced in our earlier work [M.Plesch and V.Buzek, Phys. Rev. A 67, 012322 (2003)]. In entangled graphs each qubit is represented by a vertex while the entanglement and classical correlations are represented by two types of edges. We prove by construction that any entangled graph with classical correlations can be represented by a mixed state of N qubits. However, not all entangled graphs with classical correlations can be represented by a pure state.

quant-ph↗

arXiv2002

Entangled graphs: Bipartite entanglement in multi-qubit systems

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite system is associated with a point (vertex) while a bi-partite entanglement between two specific qubits is represented by a connection (edge) between these points. We prove that any such entangled structure can be associated with a pure state of a multi-qubit system. Moreover, we show that a pure state corresponding to a given entangled structure is a superposition of vectors from a subspace of the $2^N$-dimensional Hilbert space, whose dimension grows linearly with the number of entangled pairs.

quant-ph↗

arXiv2002

Role of entanglement and correlations in dense coding

Usually it is assumed that quantum dense coding is due to quantum entanglement between two parties. We show that this phenomenon has its origin in {\em correlations} between two parties rather than simply in entanglement. In order to justify our argument we evaluate a capacity of the noiseless channel for two cases: (1) when Bob performs measurement just on the particle received from Alice and (2) in the case when he utilizes the whole potential of the dense coding, that is, he performs the measurement on the received particle and the particle he had prior to the communication. We also present a simple classical scenario which might serve as a prototype of the dense coding. We generalize our results also for qudits.

quant-ph↗

arXiv2002

Implementation of quantum maps by programmable quantum processors

A quantum processor is a device with a data register and a program register. The input to the program register determines the operation, which is a completely positive linear map, that will be performed on the state in the data register. We develop a mathematical description for these devices, and apply it to several different examples of processors. The problem of finding a processor that will be able to implement a given set of mappings is also examined, and it is shown that while it is possible to design a finite processor to realize the phase-damping channel, it is not possible to do so for the amplitude-damping channel.

quant-ph↗

arXiv2002

Reconstruction of motional states of neutral atoms via MaxEnt principle

We present a scheme for a reconstruction of states of quantum systems from incomplete tomographic-like data. The proposed scheme is based on the Jaynes principle of Maximum Entropy. We apply our algorithm for a reconstruction of motional quantum states of neutral atoms. As an example we analyze the experimental data obtained by the group of C. Salomon at the ENS in Paris and we reconstruct Wigner functions of motional quantum states of Cs atoms trapped in an optical lattice.

quant-ph↗

arXiv2002

Thermalizing Quantum Machines: Dissipation and Entanglement

We study the relaxation of a quantum system towards the thermal equilibrium using tools developed within the context of quantum information theory. We consider a model in which the system is a qubit, and reaches equilibrium after several successive two-qubit interactions (thermalizing machines) with qubits of a reservoir. We characterize completely the family of thermalizing machines. The model shows a tight link between dissipation, fluctuations, and the maximal entanglement that can be generated by the machines. The interplay of quantum and classical information processes that give rise to practical irreversibility is discussed.

quant-ph↗

arXiv2002

Quantum multimeters: A programmable state discriminator

We discuss a possibility to build a programmable quantum measurement device (a "quantum multimeter"). That is, a device that would be able to perform various desired generalized, positive operator value measure (POVM) measurements depending on a quantum state of a "program register". As an example, we present a "universal state discriminator". It serves for the unambiguous discrimination of a pair of known non-orthogonal states (from a certain set). If the two states are changed the apparatus can be switched via the choice of the program register to discriminate the new pair of states unambiguously. The proper POVM is determined by the state of an auxiliary quantum system. The probability of successful discrimination is not optimal for all pairs of non-orthogonal states from the given set. However, for some subsets it can be very close to the optimal value.

quant-ph↗

arXiv2002

Entanglement swapping between multi-qudit systems

We generalize the entanglement swapping scheme originally proposed for two pairs of qubits to an arbitrary number $q$ of systems composed from an arbitrary number $m_j$ of qudits. Each of the system is supposed to be prepared in a maximally entangled state of $m_j$ qudits, while different systems are not correlated at all. We show that when a set $\sum_{j=1}^q a_j$ particles (from each of the $q$ systems $a_j$ particles are measured) are subjected to a generalized Bell-type measurement, the resulting set of $\sum_{j=1}^q (m_j-a_j)$ particles will collapse into a maximally entangled state.

quant-ph↗

arXiv2001

Cold Trapped Ions as Quantum Information Processors

In this tutorial we review physical implementation of quantum computing using a system of cold trapped ions. We discuss systematically all the aspects for making the implementation possible. Firstly, we go through the loading and confining of atomic ions in the linear Paul trap, then we describe the collective vibrational motion of trapped ions. Further, we discuss interactions of the ions with a laser beam. We treat the interactions in the travelling-wave and standing-wave configuration for dipole and quadrupole transitions. We review different types of laser cooling techniques associated with trapped ions. We address Doppler cooling, sideband cooling in and beyond the Lamb-Dicke limit, sympathetic cooling and laser cooling using electromagnetically induced transparency. After that we discuss the problem of state detection using the electron shelving method. Then quantum gates are described. We introduce single-qubit rotations, two-qubit controlled-NOT and multi-qubit controlled-NOT gates. We also comment on more advanced multi-qubit logic gates. We describe how quantum logic networks may be used for the synthesis of arbitrary pure quantum states. Finally, we discuss the speed of quantum gates and we also give some numerical estimations for them. A discussion of dynamics on off-resonant transitions associated with a qualitative estimation of the weak coupling regime and of the Lamb-Dicke regime is included in Appendix.

quant-ph↗