arXiv subjects

Edward Gerjuoy

Publications and source records attributed to Edward Gerjuoy.

5 recordsLinked to original sources

arXiv2015

The American Physical Society's Defense of Human Rights

The history of APS involvement in the defense of human rights, a history of which the Society can be proud, will be summarized. The summary will include illustrative specific Society human rights defense actions in illustrative specific cases. As will be emphasized, the aforesaid involvement has been primarily through the activities of the APS Committee on International Freedom of Scientists. It is noteworthy, and one of the reasons the Society can be proud, that this Committee is charged with monitoring concerns regarding human rights for scientists, not solely for physicists.

physics.hist-ph↗

arXiv2014

Memories of Julian Schwinger

The career and accomplishments of Julian Schwinger, who shared the Nobel Prize for physics in 1965, have been reviewed in numerous books and articles. For this reason these Memories, which seek to convey a sense of Schwinger's remarkable talents as a physicist, concentrate primariy (though not entirely) on heretofore unpublished pertinent recollections of the youthful Schwinger by this writer, who first encountered Schwinger in 1934 when they both were undergraduates at the City College of New York.

physics.hist-ph↗

arXiv2005

Popper's Experiment and Superluminal Communication

We comment on Tabesh Qureshi, "Understanding Popper's Experiment," AJP 73, 541 (June 2005), in particular on the implications of its section IV. We show, in the situation envisaged by Popper, that analysis solely with conventional non-relativistic quantum mechanics suffices to exclude the possibility of superluminal communication.

quant-ph↗

arXiv2004

Shor's Factoring Algorithm and Modern Cryptography. An Illustration of the Capabilities Inherent in Quantum Computers

The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical (i.e., conventional) computers. In 1994, however, Peter Shor showed that for sufficiently large N a quantum computer would be expected to perform the factoring with much less computational effort. This paper endeavors to explain, in a fashion comprehensible to the non-expert readers of this journal: (i) the RSA encryption protocol; (ii) the various quantum computer manipulations constituting the Shor algorithm; (iii) how the Shor algorithm performs the factoring; and (iv) the precise sense in which a quantum computer employing Shor's algorithm can be said to accomplish the factoring of very large numbers with less computational effort than a classical computer can. It is made apparent that factoring $N$ generally requires many successive runs of the algorithm. The careful analysis herein reveals, however, that the probability of achieving a successful factorization on a single run is about twice as large as commonly quoted in the literature.

quant-ph↗

arXiv2003

Lower Bound on Entanglement of Formation for the Qubit-Qudit System

Wootters [PRL 80, 2245 (1998)] has derived a closed formula for the entanglement of formation (EOF) of an arbitrary mixed state in a system of two qubits. There is no known closed form expression for the EOF of an arbitrary mixed state in any system more complicated than two qubits. This paper, via a relatively straightforward generalization of Wootters' original derivation, obtains a closed form lower bound on the EOF of an arbitary mixed state of a system composed of a qubit and a qudit (a d-level quantum system, with d greater than or equal to 3). The derivation of the lower bound is detailed for a system composed of a qubit and a qutrit (d = 3); the generalization to d greater than 3 then follows readily.

quant-ph↗