We discuss the problem of counting the maximum number of distinct states that an isolated physical system can pass through in a given period of time---its maximum speed of dynamical evolution. Previous analyses have given bounds in terms of the standard deviation of the energy of the system; here we give a strict bound that depends only on E-E0, the system's average energy minus its ground state energy. We also discuss bounds on information processing rates implied by our bound on the speed of dynamical evolution. For example, adding one Joule of energy to a given computer can never increase its processing rate by more than about 3x10^33 operations per second.Comment: 14 pages, no figures, LaTex2e (elsart). This is the published version, which includes brief semi-classical and relativistic discussions not included in the original preprin

Abstract-We investigate a new class of codes for the optimal covering of vertices in an undirected graph G such that any vertex in G can be uniquely identified by examining the vertices that cover it. We define a ball of radius t centered on a vertex v to be the set of vertices in G that are at distance at most t from v: The vertex v is then said to cover itself and every other vertex in the ball with center v: Our formal problem statement is as follows: Given an undirected graph G and an integer t 1, find a (minimal) set C of vertices such that every vertex in G belongs to a unique set of balls of radius t centered at the vertices in C: The set of vertices thus obtained constitutes a code for vertex identification. We first develop topology-independent bounds on the size of C: We then develop methods for constructing C for several specific topologies such as binary cubes, nonbinary cubes, and trees. We also describe the identification of sets of vertices using covering codes that uniquely identify single vertices. We develop methods for constructing optimal topologies that yield identifying codes with a minimum number of codewords. Finally, we describe an application of the theory developed in this paper to fault diagnosis of multiprocessor systems.

The question of how fast a quantum state can evolve has attracted a considerable attention in connection with quantum measurement, metrology, and information processing. Since only orthogonal states can be unambiguously distinguished, a transition from a state to an orthogonal one can be taken as the elementary step of a computational process.1 Therefore, such a transition can be interpreted as the operation of "flipping a qubit", and the number of orthogonal states visited by the system per unit time can be viewed as the maximum rate of operation.A lower bound on the orthogonalization time, based on the energy spread ∆E, was found by Mandelstam and Tamm. 2 Another bound, based on the average energy E, was established by Margolus and Levitin.3 The bounds coincide, and can be exactly attained by certain initial states if ∆E = E. However, the problem remained open of what the situation is when ∆E = E.Here we consider the unified bound that takes into account both ∆E and E. We prove that there exist no initial states that saturate the bound if ∆E = E. However, the bound remains tight: for any given values of ∆E and E, there exists a oneparameter family of initial states that can approach the bound arbitrarily close when the parameter approaches its limit value. The relation between the largest energy level, the average energy, and the orthogonalization time is also discussed. These results establish the fundamental quantum limit on the rate of operation of any information-processing system. Starting with the classical result of Mandelstam and Tamm,2 it was later shown by Fleming, 4 Anandan and Aharonov, 5 and Vaidman 6 that the minimum time τ required for arriving to an orthogonal state is bounded bywhere (∆E) 2 = ψ|H 2 |ψ − ( ψ|H|ψ ) 2 , H is the Hamiltonian, and |ψ the wavefunction of the system. A different bound was obtained in,Here, E = ψ|H|ψ is the quantum-mechanical average energy of the system (the energy of the ground state is taken to be zero). Both bounds (1) and (2) are tight, and achieved for a quantum state such that ∆E = E.Since then, a vast literature has been devoted to various aspects of this problem. In particular, inequality (2) has been proved for mixed states and for composite systems both in separable and in entangled states (e.g., Giovannetti et al.,7, 8 Zander et al. 9 ). Bound (2) obtained for an isolated system has been generalized to a system driven by an external Hamiltonian (a "quantum gate") in.10, 11 Various derivations of (1) and (2) However, what remained unnoticed is the paradoxical situation of the existence of two bounds based on two different characteristics of the quantum state, seemingly independent of one another. Since the average energy E and the energy uncertainty ∆E play the most determinative role in quantum evolution, it is important to have a unified bound that would take into account both of these characteristics.In all known cases where bounds (1) and (2) can be exactly attained, the ratio α = ∆E E equals 1. A question arises: what happens if α = 1? Some authors ...

No abstract

An explicit formula is obtained for the entropy defect and the (maximum) information for an ensemble of two pure quantum states; an optimal basis is found, that is, an optimal measurement procedure which enables one to obtain the maximum information. Some results are also presented for the case of two mixed states, described by second-order density matrices (for example, spin polarization matrices). It is shown that in the case of two states the optimal measurement is a direct von Neumann measurement performed in the subspace of the two states.