



@article {2530,
	title = {Quantum Computer Systems for Scientific Discovery},
	year = {2019},
	month = {12/16/2019},
	abstract = {<p>The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considered together, by co-designing full stack quantum computer systems along with their applications in order to hasten their development and potential for scientific discovery. In this context, we identify scientific and community needs, opportunities, and significant challenges for the development of quantum computers for science over the next 2-10 years. This document is written by a community of university, national laboratory, and industrial researchers in the field of Quantum Information Science and Technology, and is based on a summary from a U.S. National Science Foundation workshop on Quantum Computing held on October 21-22, 2019 in Alexandria, VA.</p>},
	url = {https://arxiv.org/abs/1912.07577},
	author = {Yuri Alexeev and Dave Bacon and Kenneth R. Brown and Robert Calderbank and Lincoln D. Carr and Frederic T. Chong and Brian DeMarco and Dirk Englund and Edward Farhi and Bill Fefferman and Alexey V. Gorshkov and Andrew Houck and Jungsang Kim and Shelby Kimmel and Michael Lange and Seth Lloyd and Mikhail D. Lukin and Dmitri Maslov and Peter Maunz and Christopher Monroe and John Preskill and Martin Roetteler and Martin Savage and Jeff Thompson and Umesh Vazirani}
}
@article {1403,
	title = {Quantum Algorithms for Fermionic Quantum Field Theories},
	year = {2014},
	month = {2014/04/28},
	abstract = {  Extending previous work on scalar field theories, we develop a quantum
algorithm to compute relativistic scattering amplitudes in fermionic field
theories, exemplified by the massive Gross-Neveu model, a theory in two
spacetime dimensions with quartic interactions. The algorithm introduces new
techniques to meet the additional challenges posed by the characteristics of
fermionic fields, and its run time is polynomial in the desired precision and
the energy. Thus, it constitutes further progress towards an efficient quantum
algorithm for simulating the Standard Model of particle physics.
},
	url = {http://arxiv.org/abs/1404.7115v1},
	author = {Stephen P. Jordan and Keith S. M. Lee and John Preskill}
}
@article {1395,
	title = {Quantum Computation of Scattering in Scalar Quantum Field Theories},
	journal = {Quantum Information and Computation},
	volume = {14},
	year = {2014},
	month = {2014/09/01},
	pages = {1014-1080},
	abstract = {  Quantum field theory provides the framework for the most fundamental physical
theories to be confirmed experimentally, and has enabled predictions of
unprecedented precision. However, calculations of physical observables often
require great computational complexity and can generally be performed only when
the interaction strength is weak. A full understanding of the foundations and
rich consequences of quantum field theory remains an outstanding challenge. We
develop a quantum algorithm to compute relativistic scattering amplitudes in
massive phi-fourth theory in spacetime of four and fewer dimensions. The
algorithm runs in a time that is polynomial in the number of particles, their
energy, and the desired precision, and applies at both weak and strong
coupling. Thus, it offers exponential speedup over existing classical methods
at high precision or strong coupling.
},
	url = {http://arxiv.org/abs/1112.4833v1},
	author = {Stephen P. Jordan and Keith S. M. Lee and John Preskill}
}
@article {1397,
	title = {Quantum Algorithms for Quantum Field Theories},
	journal = {Science},
	volume = {336},
	year = {2012},
	month = {2012/05/31},
	pages = {1130 - 1133},
	abstract = {  Quantum field theory reconciles quantum mechanics and special relativity, and
plays a central role in many areas of physics. We develop a quantum algorithm
to compute relativistic scattering probabilities in a massive quantum field
theory with quartic self-interactions (phi-fourth theory) in spacetime of four
and fewer dimensions. Its run time is polynomial in the number of particles,
their energy, and the desired precision, and applies at both weak and strong
coupling. In the strong-coupling and high-precision regimes, our quantum
algorithm achieves exponential speedup over the fastest known classical
algorithm.
},
	doi = {10.1126/science.1217069},
	url = {http://arxiv.org/abs/1111.3633v2},
	author = {Stephen P. Jordan and Keith S. M. Lee and John Preskill}
}
@article {1236,
	title = {Quantum information and precision measurement},
	journal = {Journal of Modern Optics},
	volume = {47},
	year = {2000},
	month = {1999/04/07},
	pages = {155 - 176},
	abstract = {  We describe some applications of quantum information theory to the analysis
of quantum limits on measurement sensitivity. A measurement of a weak force
acting on a quantum system is a determination of a classical parameter
appearing in the master equation that governs the evolution of the system;
limitations on measurement accuracy arise because it is not possible to
distinguish perfectly among the different possible values of this parameter.
Tools developed in the study of quantum information and computation can be
exploited to improve the precision of physics experiments; examples include
superdense coding, fast database search, and the quantum Fourier transform.
},
	doi = {10.1080/09500340008244034},
	url = {http://arxiv.org/abs/quant-ph/9904021v2},
	author = {Andrew M. Childs and John Preskill and Joseph Renes}
}
