arXiv subjects

H. T. Williams

Publications and source records attributed to H. T. Williams.

6 recordsLinked to original sources

arXiv2009

Exact energy spectrum of a two-temperature kinetic Ising model

The exact energy spectrum is developed for a two temperature kinetic Ising spin chain, and its dual reaction diffusion system with spatially alternating pair annihilation and creation rates. Symmetries of the system pseudo-Hamiltonian that enable calculation of the spectrum are also used to derive explicit state vectors for small system sizes, and to make observations regarding state vectors in the general case. Physical consequences of the surprisingly simple form for the eigenvalues are also discussed.

cond-mat.stat-mech↗

arXiv2008

Non-equilibrium statistical mechanics: a solvable model

A two-temperature linear spin model is presented that allows an easily understandable introduction to non-equilibrium statistical physics. The model is one that includes the concepts that are typical of more realistic non-equilibrium models but that allows straightforward steady state solutions and, for small systems, development of the full time dependence for configuration probabilities. The model is easily accessible to upper-level undergraduate students, and also provides a good check for computer models of larger systems.

cond-mat.stat-mech↗

arXiv2008

The augmented message-matrix approach to deterministic dense coding theory

A method is presented for producing analytical results applicable to the standard two-party deterministic dense coding protocol, wherein communication of K perfectly distinguishable messages is attainable with the aid of K selected local unitary operations on one qudit from a pair of entangled qudits of equal dimension d in a pure state. The method utilizes the properties of a (d^2)x(d^2) unitary matrix whose initial columns represent message states of the system used for communication, augmented by sufficiently many additional orthonormal column vectors so that the resulting matrix is unitary. Using the unitarity properties of this augmented message-matrix, we produce simple proofs of previously established results including (i) an upper bound on the value of the square of the largest Schmidt coefficient, given by d/K, and (ii) the impossibility of finding a pure state that can enable transmission of K=d^2-1 messages but not d^2. Additional results obtained using the method include proofs that when K=d+1 the upper bound on the square of the largest Schmidt coefficient (i) always reduces to at least (1/2)[1+sqrt{(d-2)/(d+2)}], and (ii) reduces to (d-1)/d in the special case that the identity and shift operators are two of the selected local unitaries.

quant-ph↗

arXiv2008

Deterministic dense coding and entanglement entropy

We present an analytical study of the standard two-party deterministic dense-coding protocol, under which communication of perfectly distinguishable messages takes place via a qudit from a pair of non-maximally entangled qudits in pure state |S>. Our results include the following: (i) We prove that it is possible for a state |S> with lower entanglement entropy to support the sending of a greater number of perfectly distinguishable messages than one with higher entanglement entropy, confirming a result suggested via numerical analysis in Mozes et al. [Phys. Rev. A 71 012311 (2005)]. (ii) By explicit construction of families of local unitary operators, we verify, for dimensions d = 3 and d=4, a conjecture of Mozes et al. about the minimum entanglement entropy that supports the sending of d + j messages, j = 2, ..., d-1; moreover, we show that the j=2 and j= d-1 cases of the conjecture are valid in all dimensions. (iii) Given that |S> allows the sending of K messages and has the square roof of c as its largest Schmidt coefficient, we show that the inequality c <= d/K, established by Wu et al. [ Phys. Rev. A 73, 042311 (2006)], must actually take the form c < d/K if K = d+1, while our constructions of local unitaries show that equality can be realized if K = d+2 or K = 2d-1.

quant-ph↗

arXiv2006

Sharp probability estimates for Shor's order-finding algorithm

Let N be a (large positive integer, let b > 1 be an integer relatively prime to N, and let r be the order of b modulo N. Finally, let QC be a quantum computer whose input register has the size specified in Shor's original description of his order-finding algorithm. We prove that when Shor's algorithm is implemented on QC, then the probability P of obtaining a (nontrivial) divisor of r exceeds 0.7 whenever N exceeds 2^{11}-1 and r exceeds 39, and we establish that 0.7736 is an asymptotic lower bound for P. When N is not a power of an odd prime, Gerjuoy has shown that P exceeds 90 percent for N and r sufficiently large. We give easily checked conditions on N and r for this 90 percent threshold to hold, and we establish an asymptotic lower bound for P of (2/Pi) Si(4Pi), about .9499, in this situation. More generally, for any nonnegative integer q, we show that when QC(q) is a quantum computer whose input register has q more qubits than does QC, and Shor's algorithm is run on QC(q), then an asymptotic lower bound on P is (2/Pi) Si(2^(q+2) Pi) (if N is not a power of an odd prime). Our arguments are elementary and our lower bounds on P are carefully justified.

quant-ph↗

arXiv2003

Unital quantum operators on the Bloch ball and Bloch region

For one qubit systems, we present a short, elementary argument characterizing unital quantum operators in terms of their action on Bloch vectors. We then show how our approach generalizes to multi-qubit systems, obtaining inequalities that govern when a ``diagonal'' superoperator on the Bloch region is a quantum operator. These inequalities are the n-qubit analogue of the Algoet-Fujiwara conditions. Our work is facilitated by an analysis of operator-sum decompositions in which negative summands are allowed.

quant-ph↗