arXiv subjects

Mark Hillery

Publications and source records attributed to Mark Hillery.

At least 91 records · Page 5Linked to original sources

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

Quantum state filtering and discrimination between sets of Boolean functions

The problem of quantum state filtering consists of determining whether an unknown quantum state, which is chosen from a known set of states, is either a particular, specified state, or not. We consider this problem for the case that the filtering procedure is required to be unambiguous, which necessitates admitting inconclusive answers when the given states are not orthogonal. As an application, we propose an efficient, probabilistic procedure for distinguishing between sets of Boolean functions, which is an extension of the Deutsch-Jozsa algorithm.

quant-ph↗

arXiv2003

Quantum walks based on an interferometric analogy

There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walk operates with continuous time. Here a third model for a quantum walk is proposed, which is based on an analogy to optical interferometers. It is a discrete-time model, and the unitary operator that advances the walk one step depends only on the local structure of the graph on which the walk is taking place. No quantum coin is introduced. This type of walk allows us to introduce elements, such as phase shifters, that have no counterpart in classical random walks. Walks on the line and cycle are discussed in some detail, and a probability current for these walks is introduced. The relation to the coined quantum walk is also discussed. The paper concludes by showing how to define these walks for a general graph.

quant-ph↗

arXiv2002

Distinguishing two-qubit states using local measurements and restricted classical communication

The problem of unambiguous state discrimination consists of determining which of a set of known quantum states a particular system is in. One is allowed to fail, but not to make a mistake. The optimal procedure is the one with the lowest failure probability. This procedure has been extended to bipartite states where the two parties, Alice and Bob, are allowed to manipulate their particles locally and communicate classically in order to determine which of two possible two-particle states they have been given. The failure probability of this local procedure has been shown to be the same as if the particles were together in the same location. Here we examine the effect of restricting the classical communication between the parties, either allowing none or eliminating the possibility that one party's measurement depends on the result of the other party's. These issues are studied for two-qubit states, and optimal procedures are found. In some cases the restrictions cause increases in the failure probability, but in other cases they do not. Applications of these procedures, in particular to secret sharing, are discussed.

quant-ph↗

arXiv2002

Optimal unambiguous discrimination between subsets of non-orthogonal quantum states

It is known that unambiguous discrimination among non-orthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of the different states, we shall only discriminate between two subsets of them. In particular, for the case of three non-orthogonal states, we show that the optimal strategy to distinguish between a set containing one of the states from the set containing the other two has a higher success rate than if we wish to discriminate among all three states. Somewhat surprisingly, for unambiguous discrimination the subsets need not be linearly independent. A fully analytical solution is presented, and we also show how to construct generalized interferometers (multiports) that provide an optical implementation of the optimal strategy.

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↗

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↗

arXiv2001

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↗

arXiv2000

Optimum unambiguous discrimination among linearly-independent non-orthogonal quantum states and its optical realization

The problem of unambiguously distinguishing among nonorthogonal but linearly independent quantum states can be solved by mapping the set of nonorthogonal quantum states onto a set of orthogonal ones, which can then be distinguished without error. Such nonunitary transformations can be performed conditionally on quantum systems; a unitary transformation is carried out on a larger system of which the system of interest is a subsytem, a measurement is performed, and if the proper result is obtained, the desired nonunitary transformation will have been performed on the subsystem. We show how to construct generalized interferometers (multiports), which when combined with measurements on some of the output ports, implement nonunitary transformations of this type. The input states are single-photon states in which the photon is divided among several modes. A number of explicit examples of distinguishing among three nonorthogonal states are discussed, and the networks that optimally distinguish among these states are presented.

quant-ph↗

arXiv2000

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↗

arXiv2000

Noise-free scattering of the quantized electromagnetic field from a dispersive linear dielectric

We study the scattering of the quantized electromagnetic field from a linear, dispersive dielectric using the scattering formalism for quantum fields. The medium is modeled as a collection of harmonic oscillators with a number of distinct resonance frequencies. This model corresponds to the Sellmeir expansion, which is widely used to describe experimental data for real dispersive media. The integral equation for the interpolating field in terms of the in field is solved and the solution used to find the out field. The relation between the in and out creation and annihilation operators is found which allows one to calculate the S-matrix for this system. In this model, we find that there are absorption bands, but the input-output relations are completely unitary. No additional quantum noise terms are required.

quant-ph↗

arXiv2000

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↗

arXiv2000

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↗

arXiv1999

Position-momentum local realism violation of the Hardy type

We show that it is, in principle, possible to perform local realism violating experiments of the Hardy type in which only position and momentum measurements are made on two particles emanating from a common source. In the optical domain, homodyne detection of the in-phase and out-of-phase amplitude components of an electromagnetic field is analogous to position and momentum measurement. Hence, local realism violations of the Hardy type are possible in optical systems employing only homodyne detection.

quant-ph↗

arXiv1999

Quantum cryptography with squeezed states

A quantum key distribution scheme based on the use of displaced squeezed vacuum states is presented. The states are squeezed in one of two field quadrature components, and the value of the squeezed component is used to encode a character from an alphabet. The uncertainty relation between quadrature components prevents an eavesdropper from determining both with enough precision to determine the character being sent. Losses degrade the performance of this scheme, but it is possible to use phase-sensitive amplifiers to boost the signal and partially compensate for their effect.

quant-ph↗

arXiv1998

Field Oscillations in a Micromaser with Injected Atomic Coherence

The electric field in a lossless, regularly-pumped micromaser with injected atomic coherence can undergo a period 2 oscillations in the steady state. The field changes its value after a single atom passes through the micromaser cavity, but returns to its original value after a second atom travels through. We give a simple explanation for this phenomenon in terms of tangent and cotangent states. We also examine the effect of cavity damping on this steady state.

quant-ph↗

arXiv1998

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↗