Overcoming exponential volume scaling in quantum simulations of lattice gauge theories

Real-time evolution of quantum field theories using classical computers requires resources that scale exponentially with the number of lattice sites. Because of a fundamentally different computational strategy, quantum computers can in principle be used to perform detailed studies of these dynamics from first principles. Before performing such calculations, it is important to ensure that the quantum algorithms used do not have a cost that scales exponentially with the volume. In these proceedings, we present an interesting test case: a formulation of a compact U(1) gauge theory in 2+1 dimensions free of gauge redundancies. A naive implementation onto a quantum circuit has a gate count that scales exponentially with the volume. We discuss how to break this exponential scaling by performing an operator redefinition that reduces the non-locality of the Hamiltonian. While we study only one theory as a test case, it is possible that the exponential gate scaling will persist for formulations of other gauge theories, including non-Abelian theories in higher dimensions.Comment: 11 pages, 2 figures, Proceedings of the 39th Annual International Symposium on Lattice Field Theory (Lattice 2022), August 8-13 2022, Bonn, German

Jefferson Alumni Bulletin – Volume XLII, Number 1, Fall 1993

Jefferson Alumni Bulletin – Volume XLII, Number 1, Fall 1993 House staff receive a comprehensive preparation, page 2 Rectal cancer management arrives on the threshold of synergy with basic research, page 6 Fry is the first marks professor, page 8 Funding completed for the kind professorship, page 9 Bibbo is the first Lang professor, page 10 Institute for dermatopathology, page 11 Joslin center for diabetes, page 11 $54 million in awards in 1993, page 12 Blood substitute is refined, page 12 Study suggests site of alcohol and anesthesia action, page 13 Computers assist drug design, page 13 Clinton aide discusses health care reform, page 14 Portrait exhibited in London, page 15 Class notes, page 21 Books, page 2

Editorial Challenge: From a Quarterly to a Bimonthly Journal

Starting with issue 4 of volume 7(2012) International Journal of Computers Communications & Control (INT J COMPUT COMMUN, IJCCC) [4] is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE) [2].Beginning with issue 1 of volume 8(2013) IJCCC will be published as a bimonthly journal (6 issues/year) [5]

Programs as Diagrams: From Categorical Computability to Computable Categories

This is a draft of the textbook/monograph that presents computability theory using string diagrams. The introductory chapters have been taught as graduate and undergraduate courses and evolved through 8 years of lecture notes. The later chapters contain new ideas and results about categorical computability and some first steps into computable category theory. The underlying categorical view of computation is based on monoidal categories with program evaluators, called *monoidal computers*. This categorical structure can be viewed as a single-instruction diagrammatic programming language called Run, whose only instruction is called RUN. This version: improved text, moved the final chapter to the next volume. (The final version will continue lots of exercises and workouts, but already this version has severely degraded graphics to meet the size bounds.)Comment: 150 pages, 81 figure

Compensation of sampled-data systems

"November 8, 1958.""Reprinted from Proceedings of the National Electronics Conference, Volume XIII, Hotel Sherman, Chicago, Illinois, October 7, 8, 9, 1957.""Compensation of sampled-data systems is straight forward if the compensation network can be separated from the rest of the system by samplers. However, use of directly connected continuous networks presents more of a problem. Existing theory does not adequately cover such compensation. This paper examines the above situation using z-transform theory and continuous network realizability conditions. Lack of a general correlation between the number of z-plane and s-plane zeros presents the major problem. This difficulty becomes apparent when attempting to find a principle Laplace transform for the final system impulse response following z-plane compensation. By imposing certain restrictions on z-plane pole locations and by approximating the desired system impulse response in the s-plane, this paper demonstrates the use of directly connected RC networks in lieu of discrete networks or digital computers for compensating sampled-data systems. Studies are, also, made concerning the requirements necessary to eliminate the need for approximating the final impulse response. Graphs are presented to allow the solution of this problem for third order systems."--Page 1