output
20132022
most citedA formula for crossing probabilities of critical systems inside polygons

21 citations

5 papers

quant-ph2022★ 1 cited

Testing the necessity of complex numbers in traditional quantum theory with quantum computers

Jarrett L. Lancaster, Nicholas M. Palladino

A recent experiment testing the necessity of complex numbers in the standard formulation of quantum theory is recreated using IBM quantum computers. To motivate the experiment, we…

cond-mat.stat-mech2016★ 21 cited

A formula for crossing probabilities of critical systems inside polygons

Steven M. Flores, Jacob J. H. Simmons, Peter Kleban +1

In this article, we generalize known formulas for crossing probabilities. Prior crossing results date back to J. Cardy's prediction of a formula for the probability that a percolat…

math-ph2015★ 4 cited

Multiple-SLE connectivity weights for rectangles, hexagons, and octagons

Steven M. Flores, Jacob J. H. Simmons, Peter Kleban

In a previous article, we define "connectivity weights" to be functions with these two properties: 1) They solve the three conformal Ward identities of conformal field theory (CFT)…

cond-mat.stat-mech2014★ 4 cited

Percolation crossing probabilities in hexagons: a numerical study

Steven M. Flores, Robert M. Ziff, Jacob J. H. Simmons

In a recent article, one of the authors used logarithmic conformal field theory to predict crossing-probability formulas for percolation clusters inside a hexagon with free b…

cond-mat.stat-mech2013★ 9 cited

Logarithmic operator intervals in the boundary theory of critical percolation

Jacob J H Simmons

We consider the sub-sector of the logarithmic conformal field theory (LCFT) generated by the boundary condition changing (bcc) operator in two dimensional critical percolatio…