H. Thomas Williams
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
H. Thomas Williams has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Irina Mazilu
Department of Physics and Engineering Washington and Lee University 24450 Lexington VA USA
5 shared publications - Paul S. Bourdon
Department of Mathematics, Washington and Lee University, Lexington, Virginia 24450, USA
5 shared publications - Dan A. Mazilu
Department of Physics and Engineering Washington and Lee University 24450 Lexington VA USA
2 shared publications - Edward Gerjuoy
Department of Physics and Astronomy University of Pittsburgh 15260 † Pittsburgh PA
2 shared publications - Carlos Martins da Fonseca
Kuwait College of Science and Technology
1 shared publication - Paul Bourdon
Mathematics Department, Washington and Lee University, Lexington, USA
1 shared publication
Latest Publications
- Open Access
The eigenpairs of a Sylvester-Kac type matrix associated with a simple model for one-dimensional deposition and evaporation
A straightforward model for deposition and evaporation on discrete cells of a finite array of any dimension leads to a matrix equation involving a Sylvester-Kac type matrix. The eigenvalues and eigenvectors of the general matrix are determined for an arbitrary number of cells. A variety of models to which this solution may be applied are discussed.
Open AccessThe eigenpairs of a Sylvester-Kac type matrix associated with a simple model for one-dimensional deposition and evaporation
A straightforward model for deposition and evaporation on discrete cells of a finite array of any dimension leads to a matrix equation involving a Sylvester-Kac type matrix. The eigenvalues and eigenvectors of the general matrix are determined for an arbitrary number of cells. A variety of models to which this solution may be applied are discussed.
- Open Access
Stochastic epidemic-type model with enhanced connectivity: exact solution
We present an exact analytical solution to a one-dimensional model of the Susceptible-Infected-Recovered (SIR) epidemic type, with infection rates dependent on nearest-neighbor occupations. We use a quantum mechanical approach, transforming the master equation via a quantum spin operator formulation. We calculate exactly the time-dependent density of infected, recovered and susceptible populations for random initial conditions, and compare our results with a low connectivity SIR model reported by Schuetz et al.. Our results compare well to those of previous work, validating the model as a useful tool for additional and extended studies in this important area. Our model also provides exact solutions for the n-point correlation functions, and can be extended to more complex epidemic type models.
Open AccessStochastic epidemic-type model with enhanced connectivity: exact solution
We present an exact analytical solution to a one-dimensional model of the Susceptible-Infected-Recovered (SIR) epidemic type, with infection rates dependent on nearest-neighbor occupations. We use a quantum mechanical approach, transforming the master equation via a quantum spin operator formulation. We calculate exactly the time-dependent density of infected, recovered and susceptible populations for random initial conditions, and compare our results with a low connectivity SIR model reported by Schuetz et al.. Our results compare well to those of previous work, validating the model as a useful tool for additional and extended studies in this important area. Our model also provides exact solutions for the n-point correlation functions, and can be extended to more complex epidemic type models.
- Open Access
Entanglement enhancement of a noisy classical communication channel
We present a formal quantum mechanical analysis of the communication protocol of Prevedel {\it et al.}\ [Phys. Rev. Lett. \textbf{106}, 110505 (2011)], in which entanglement shared by sender and receiver is used to enhance, beyond that achievable via the optimal classical strategy, the probability of successful transmission of a bit through a particular noisy classical channel ${\cal N}$. We provide a full analysis of this protocol when the shared entanglement resides in a two-qubit system. Our analysis shows the measurement choices specified by the protocol yield the maximum possible enhancement of the probability of successful communication of the bit with one use of the channel ${\cal N}$. We determine that shared entanglement residing in a two-qudit system with $d > 2$ cannot provide enhancement beyond that produced by entangled qubits. Finally, we show how the protocol should be extended when probability parameters for the channel ${\cal N}$ are allowed to vary.Open AccessEntanglement enhancement of a noisy classical communication channel
We present a formal quantum mechanical analysis of the communication protocol of Prevedel {\it et al.}\ [Phys. Rev. Lett. \textbf{106}, 110505 (2011)], in which entanglement shared by sender and receiver is used to enhance, beyond that achievable via the optimal classical strategy, the probability of successful transmission of a bit through a particular noisy classical channel ${\cal N}$. We provide a full analysis of this protocol when the shared entanglement resides in a two-qubit system. Our analysis shows the measurement choices specified by the protocol yield the maximum possible enhancement of the probability of successful communication of the bit with one use of the channel ${\cal N}$. We determine that shared entanglement residing in a two-qudit system with $d > 2$ cannot provide enhancement beyond that produced by entangled qubits. Finally, we show how the protocol should be extended when probability parameters for the channel ${\cal N}$ are allowed to vary. - 8 December 2009
- Published by American Physical Society (APS) in Physical Review E
- Vol. 80 (6) , 061109
Exact energy spectrum of a two-temperature kinetic Ising model
We develop the exact energy spectrum for a two-temperature kinetic Ising spin chain and its dual reaction-diffusion system with spatially alternating pair annihilation and creation rates. We also discuss the symmetries of the system pseudo-Hamiltonian and their role in developing a general solution. The surprisingly simple form for the eigenvalues leads to interesting physical consequences and to a possible numerical analysis of the dynamical properties of the system.
- 8 December 2009
- Published by American Physical Society (APS) in Physical Review E
- Vol. 80 (6) , 061109
Exact energy spectrum of a two-temperature kinetic Ising model
We develop the exact energy spectrum for a two-temperature kinetic Ising spin chain and its dual reaction-diffusion system with spatially alternating pair annihilation and creation rates. We also discuss the symmetries of the system pseudo-Hamiltonian and their role in developing a general solution. The surprisingly simple form for the eigenvalues leads to interesting physical consequences and to a possible numerical analysis of the dynamical properties of the system.
- Open Access
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.
Open AccessExact 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.
- Open Access
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.
Open AccessNon-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.
- Open Access
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.
Open AccessThe 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.
- 5 February 2008
- Published by American Physical Society (APS) in Physical Review A
- Vol. 77 (2) , 022305
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 nonmaximally entangled qudits in a pure state . Our results include the following: (i) We prove that it is possible for a state 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 and , a conjecture of Mozes et al. about the minimum entanglement entropy that supports the sending of messages, ; moreover, we show that the and cases of the conjecture are valid in all dimensions. (iii) Given that allows the sending of messages and has as its largest Schmidt coefficient, we show that the inequality , established by Wu et al. [Phys. Rev. A 73, 042311 (2006)], must actually take the form if , while our constructions of local unitaries show that equality can be realized if or .- 5 February 2008
- Published by American Physical Society (APS) in Physical Review A
- Vol. 77 (2) , 022305
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 nonmaximally entangled qudits in a pure state . Our results include the following: (i) We prove that it is possible for a state 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 and , a conjecture of Mozes et al. about the minimum entanglement entropy that supports the sending of messages, ; moreover, we show that the and cases of the conjecture are valid in all dimensions. (iii) Given that allows the sending of messages and has as its largest Schmidt coefficient, we show that the inequality , established by Wu et al. [Phys. Rev. A 73, 042311 (2006)], must actually take the form if , while our constructions of local unitaries show that equality can be realized if or .- Open Access
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.
Open AccessSharp 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.
- 23 February 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 69 (2) , 022314
Unital quantum operations 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 multiqubit systems, obtaining inequalities that govern when a “diagonal” superoperator on the Bloch region is a quantum operator. These inequalities are the n-qubit analog of the Algoet-Fujiwara conditions. Our work is facilitated by an analysis of operator-sum decompositions in which negative summands are allowed.
- 23 February 2004
- Published by American Physical Society (APS) in Physical Review A
- Vol. 69 (2) , 022314
Unital quantum operations 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 multiqubit systems, obtaining inequalities that govern when a “diagonal” superoperator on the Bloch region is a quantum operator. These inequalities are the n-qubit analog of the Algoet-Fujiwara conditions. Our work is facilitated by an analysis of operator-sum decompositions in which negative summands are allowed.