Mark Hillery

Quantum secret sharing

Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using Greenberger-Horne-Zeilinger (GHZ) states. In the quantum case the presence of an eavesdropper will introduce errors so that his presence can be detected. We also show how GHZ states can be used to split quantum information into two parts so that both parts are necessary to reconstruct the original qubit.

Quantum copying: Beyond the no-cloning theorem

We analyze the possibility of copying ~that is, cloning! arbitrary states of a quantum-mechanical spin-1/2 system. We show that there exists a ‘‘universal quantum-copying machine’’ ~i.e., transformation! which approximately copies quantum-mechanical states such that the quality of its output does not depend on the input. We also examine a machine which combines a unitary transformation and a selective measurement to produce good copies of states in the neighborhood of a particular state. We discuss the problem of measurement of the output states. @S1050-2947~96!08408-9#

Universal state inversion and concurrence in arbitrary dimensions

Wootters [Phys. Rev. Lett. 80, 2245 (1998)] has given an explicit formula for the entanglement of formation of two qubits in terms of what he calls the concurrence of the joint density operator. Wootterss concurrence is defined with the help of the superoperator that flips the spin of a qubit. We generalize the spin-flip superoperator to a universal inverter, which acts on quantum systems of arbitrary dimension, and we introduce the corresponding generalized concurrence for joint pure states of D-1 X D-2 bipartite quantum systems. We call this generalized concurrence the I concurrence to emphasize its relation to the universal inverter. The universal inverter, which is a positive, but not completely positive superoperator, is closely related to the completely positive universal-NOT superoperator, the quantum analogue of a classical NOT gate. We present a physical realization of the universal-NOT Superoperator.

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.

Squeezing of the square of the field amplitude in second harmonic generation

Abstract Squeezing of the square of the field amplitude is defined and shown to be a nonclassical effect. It is not equivalent to the higher-order squeezing defined recently by Hong and Mandel. Amplitude-squared squeezing occurs in the fundamental mode in second harmonic generation. It is also the case that the normal squeezing of the harmonic depends directly upon the amplitude-squared squeezing of the incident light in the fundamental mode. Second harmonic generation, therefore, converts a form of higher-order squeezing in the fundamental into squeezing in the harmonic.

Entanglement conditions for two-mode states.

We provide a class of inequalities whose violation shows the presence of entanglement in two-mode systems. We initially consider observables that are quadratic in the mode creation and annihilation operators and find conditions under which a two-mode state is entangled. Further examination allows us to formulate additional conditions for detecting entanglement. We conclude by showing how the methods used here can be extended to find entanglement in systems of more than two modes.

Quantum copying: A network

We present a network consisting of quantum gates that produces two imperfect copies of an arbitrary qubit. The quality of the copies does not depend on the input qubit. We also show that for a restricted class of inputs it is possible to use a very similar network to produce three copies instead of two. For qubits in this class, the copy quality is again independent of the input and is the same as the quality of the copies produced by the two-copy network.

Quantum copying: Fundamental inequalities

How well can one 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.

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 1!2 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 related by generalized phase-space displacements.

Towards quantum-based privacy and voting

The privacy of communicating participants is often of paramount importance, but in some situations it is an essential condition. A typical example is a fair (secret) voting. We analyze in detail communication privacy based on quantum resources, and we propose new quantum protocols. Possible generalizations that would lead to voting schemes are discussed.