758 citations
- University of WaterlooCA15 papers
- Perimeter InstituteCA10 papers
- McMaster UniversityCA9 papers
- Canadian Institute for Advanced ResearchCA8 papers
- Jagiellonian UniversityPL4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Louisiana State UniversityUS3 papers
- University of CambridgeGB3 papers
- University of OsloNO3 papers
- Brigham Young UniversityUS2 papers
- California Institute of TechnologyUS2 papers
- Canadian Institute for Theoretical AstrophysicsCA2 papers
9 papers · 1 filter
Constructing the self-force
Eric Poisson
I present an overview of the methods involved in the computation of the scalar, electromagnetic, and gravitational self-forces acting on a point particle moving in a curved spaceti…
Optical implementation of a unitarily correctable code
Kurt M. Schreiter, Aron Pasieka, Rainer Kaltenbaek +2
Noise poses a challenge for any real-world implementation in quantum information science. The theory of quantum error correction deals with this problem via methods to encode and r…
Markov equivalence for ancestral graphs
R. Ayesha Ali, Thomas S. Richardson, Peter Spirtes
Ancestral graphs can encode conditional independence relations that arise in directed acyclic graph (DAG) models with latent and selection variables. However, for any ancestral gra…
The Consistency of Modeled and Observed Temperature Trends in the Tropical Troposphere: A Comment on Santer et al (2008)
Stephen McIntyre, Ross McKitrick
Santer et al (2008) (S08) compared climate models and observations in the tropical troposphere and reported that "there is no longer a serious discrepancy between modeled and obser…
High performance single-error-correcting quantum codes for amplitude damping
Peter W. Shor, Graeme Smith, John A. Smolin +1
We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms o…
A certifying algorithm for 3-colorability of P5-free graphs
Daniel Bruce, Chinh T. Hoang, Joe Sawada
We provide a certifying algorithm for the problem of deciding whether a P5- free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo…