Quantifying nonorthogonality

An exploratory approach to the possibility of analyzing nonorthogonality as a quantifiable property is presented. Three different measures for the nonorthogonality of pure states are introduced, and one of these measures is extended to single-particle density matrices using methods that are similar to recently introduced techniques for quantifying entanglement. Several interesting special cases are considered. It is pointed out that a measure of nonorthogonality can meaningfully be associated with a single mixed quantum state. It is then shown how nonorthogonality can be unlocked with classical information; this analysis reveals interesting inequalities and points to a number of connections between nonorthogonality and entanglement.Comment: Accepted for publication in Phys. Rev.

A new class of entanglement measures

We introduce new entanglement measures on the set of density operators on tensor product Hilbert spaces. These measures are based on the greatest cross norm on the tensor product of the sets of trace class operators on Hilbert space. We show that they satisfy the basic requirements on entanglement measures discussed in the literature, including convexity, invariance under local unitary operations and non-increase under local quantum operations and classical communication.Comment: Revised version accepted by J Math Phys, 12 pages, LaTeX, contains Sections 1-5 & 7 of the previous version. The previous Section 6 is now in quant-ph/0105104 and the previous Section 8 is superseded by quant-ph/010501

Relations between Entropies Produced in Nondeterministic Thermodynamic Processes

Landauer's erasure principle is generalized to nondeterministic processes on systems having an arbitrary number of non-symmetrical logical states. The condition that the process is applied in the same way, irrespective of the initial logical state, imposes some restrictions on the individual heat exchanges associated with each possible transition. The complete set of such restrictions are derived by a statistical analysis of the phase-space flow induced by the process. Landauer's erasure principle can be derived from and is a special case of these.Comment: 12 pages with one figure; a final major revision in presentation; physical assumptions are clarified no

Annotation of Heterogenous Media Using OntoMedia

While ontologies exist for the annotation of monomedia, interoperability between these schemes is an important issue. The OntoMedia ontology consists of a generic core, capable of representing a diverse range of media, as well as extension ontologies to focus on specific formats. This paper provides an overview of the OntoMedia ontologies, together with a detailed case study when applied to video, a scripted form, and an associated short story

Method of convex rigid frames and applications in studies of multipartite quNit pure-states

In this Letter we suggest a method of convex rigid frames in the studies of the multipartite quNit pure-states. We illustrate what are the convex rigid frames and what is the method of convex rigid frames. As the applications we use this method to solve some basic problems and give some new results (three theorems): The problem of the partial separability of the multipartite quNit pure-states and its geometric explanation; The problem of the classification of the multipartite quNit pure-states, and give a perfect explanation of the local unitary transformations; Thirdly, we discuss the invariants of classes and give a possible physical explanation.Comment: 6 pages, no figur

Classical Concepts in Quantum Programming

The rapid progress of computer technology has been accompanied by a corresponding evolution of software development, from hardwired components and binary machine code to high level programming languages, which allowed to master the increasing hardware complexity and fully exploit its potential. This paper investigates, how classical concepts like hardware abstraction, hierarchical programs, data types, memory management, flow of control and structured programming can be used in quantum computing. The experimental language QCL will be introduced as an example, how elements like irreversible functions, local variables and conditional branching, which have no direct quantum counterparts, can be implemented, and how non-classical features like the reversibility of unitary transformation or the non-observability of quantum states can be accounted for within the framework of a procedural programming language.Comment: 11 pages, 4 figures, software available from http://tph.tuwien.ac.at/~oemer/qcl.html, submitted for QS2002 proceeding

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.Comment: 15 pages, no figure

A method of enciphering quantum states

In this paper, we propose a method of enciphering quantum states of two-state systems (qubits) for sending them in secrecy without entangled qubits shared by two legitimate users (Alice and Bob). This method has the following two properties. First, even if an eavesdropper (Eve) steals qubits, she can extract information from them with certain probability at most. Second, Alice and Bob can confirm that the qubits are transmitted between them correctly by measuring a signature. If Eve measures m qubits one by one from n enciphered qubits and sends alternative ones (the Intercept/Resend attack), a probability that Alice and Bob do not notice Eve's action is equal to (3/4)^m or less. Passwords for decryption and the signature are given by classical binary strings and they are disclosed through a public channel. Enciphering classical information by this method is equivalent to the one-time pad method with distributing a classical key (random binary string) by the BB84 protocol. If Eve takes away qubits, Alice and Bob lose the original quantum information. If we apply our method to a state in iteration, Eve's success probability decreases exponentially. We cannot examine security against the case that Eve makes an attack with using entanglement. This remains to be solved in the future.Comment: 21 pages, Latex2e, 10 epsf figures. v2: 22 pages, added two references, several clarifying sentences are added in Sec. 5, typos corrected, a new proof is provided in Appendix A and it is shorter than the old one. v3: 23 pages, one section is adde

Entanglement Patterns in Mutually Unbiased Basis Sets for N Prime-state Particles

A few simply-stated rules govern the entanglement patterns that can occur in mutually unbiased basis sets (MUBs), and constrain the combinations of such patterns that can coexist (ie, the stoichiometry) in full complements of p^N+1 MUBs. We consider Hilbert spaces of prime power dimension (as realized by systems of N prime-state particles, or qupits), where full complements are known to exist, and we assume only that MUBs are eigenbases of generalized Pauli operators, without using a particular construction. The general rules include the following: 1) In any MUB, a particular qupit appears either in a pure state, or totally entangled, and 2) in any full MUB complement, each qupit is pure in p+1 bases (not necessarily the same ones), and totally entangled in the remaining p^N-p. It follows that the maximum number of product bases is p+1, and when this number is realized, all remaining p^N-p bases in the complement are characterized by the total entanglement of every qupit. This "standard distribution" is inescapable for two qupits (of any p), where only product and generalized Bell bases are admissible MUB types. This and the following results generalize previous results for qubits and qutrits. With three qupits there are three MUB types, and a number of combinations (p+2) are possible in full complements. With N=4, there are 6 MUB types for p=2, but new MUB types become possible with larger p, and these are essential to the realization of full complements. With this example, we argue that new MUB types, showing new entanglement characteristics, should enter with every step in N, and when N is a prime plus 1, also at critical p values, p=N-1. Such MUBs should play critical roles in filling complements.Comment: 27 pages, one figure, to be submitted to Physical Revie

Implementable Quantum Bit-String Commitment Protocol

Quantum bit-string commitment[A.Kent, Phys.Rev.Lett., 90, 237901 (2003)] or QBSC is a variant of bit commitment (BC). In this paper, we propose a new QBSC protocol that can be implemented using currently available technology, and prove its security under the same security criteria as discussed by Kent. QBSC is a generalization of BC, but has slightly weaker requirements, and our proposed protocol is not intended to break the no-go theorem of quantum BC.Comment: To appear in Phys. Rev. A., 9 pages, 2 figure