arXiv subjects

David Beckman

Publications and source records attributed to David Beckman.

3 recordsLinked to original sources

arXiv2001

Measurability of Wilson loop operators

We show that the nondemolition measurement of a spacelike Wilson loop operator W(C) is impossible in a relativistic non-Abelian gauge theory. In particular, if two spacelike-separated magnetic flux tubes both link with the loop C, then a nondemolition measurement of W(C) would cause electric charge to be transferred from one flux tube to the other, a violation of relativistic causality. A destructive measurement of W(C) is possible in a non-Abelian gauge theory with suitable matter content. In an Abelian gauge theory, many cooperating parties distributed along the loop C can perform a nondemolition measurement of the Wilson loop operator if they are equipped with a shared entangled ancilla that has been prepared in advance. We also note that Abelian electric charge (but not non-Abelian charge) can be transported superluminally, without any accompanying transmission of information.

hep-th↗

arXiv2001

Causal and localizable quantum operations

We examine constraints on quantum operations imposed by relativistic causality. A bipartite superoperator is said to be localizable if it can be implemented by two parties (Alice and Bob) who share entanglement but do not communicate; it is causal if the superoperator does not convey information from Alice to Bob or from Bob to Alice. We characterize the general structure of causal complete measurement superoperators, and exhibit examples that are causal but not localizable. We construct another class of causal bipartite superoperators that are not localizable by invoking bounds on the strength of correlations among the parts of a quantum system. A bipartite superoperator is said to be semilocalizable if it can be implemented with one-way quantum communication from Alice to Bob, and it is semicausal if it conveys no information from Bob to Alice. We show that all semicausal complete measurement superoperators are semilocalizable, and we establish a general criterion for semicausality. In the multipartite case, we observe that a measurement superoperator that projects onto the eigenspaces of a stabilizer code is localizable.

quant-ph↗

arXiv1996

Efficient Networks for Quantum Factoring

We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm suggested by Shor. A $K$-bit number can be factored in time of order $K^3$ using a machine capable of storing $5K+1$ qubits. Evaluation of the modular exponential function (the bottleneck of Shor's algorithm) could be achieved with about $72 K^3$ elementary quantum gates; implementation using a linear ion trap would require about $396 K^3$ laser pulses. A proof-of-principle demonstration of quantum factoring (factorization of 15) could be performed with only 6 trapped ions and 38 laser pulses. Though the ion trap may never be a useful computer, it will be a powerful device for exploring experimentally the properties of entangled quantum states.

quant-ph↗