arXiv subjects

Mario Ziman

Publications and source records attributed to Mario Ziman.

62 records · Page 4Linked to original sources

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↗

arXiv2002

Quantum theory: kinematics, linearity and no-signaling condition

We show that the linearity of an evolution of Quantum Mechanics follows from the definition of kinematics. The same result is obtained for an arbitrary theory with the state space that includes mixtures of different preparations. Next, we formulate the non-signaling theorem and show that the theorem poses no additional restriction on Quantum Mechanics provided the kinematics is given. We also discuss validity of the postulate for the case of more general theories.

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

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↗

arXiv2001

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↗

arXiv2001

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↗

arXiv2000

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↗