BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//RLASKEY//CALENDEROUS//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20261019T054201Z
LAST-MODIFIED:20181205T173916Z
DTSTART:20181206T200000Z
DTEND:20181206T210000Z
UID:event2062@bu.edu
URL:http://physics.bu.edu/internal/events/show/2062
SUMMARY:Concurrence Percolation on Quantum Entanglement Networks
DESCRIPTION:Featuring Xiangyi Meng\n\nPart of the Preliminary Oral Exam.\n\
	nExamining Committee: H. Eugene Stanley\, William Klein\, Rama Bansil\, A. 
	Liam Fitzpatrick\n\nAbstract:\n\nQuantum information theory is changing our
	 comprehension of how information can be processed and communicated. A bett
	er understanding of quantum entanglement and non-locality within a backgrou
	nd of network science is the key to a future of safe\, efficient\, and larg
	e-scale quantum communications. In this work we show that a new local stati
	stical theory emerges from studying how to optimize the performance of quan
	tum communication networks. It shares analogy with classical percolation th
	eory\, but roots in a fundamental measure of entanglement\, namely\, concur
	rence. This concurrence percolation theory (ConPT) helps us to prove that `
	`quantum advantage'' exists\, i.e.\, one can establish faithful communicati
	on through a quantum network with a lower percolation threshold than what t
	he equivalent classical percolation scheme claims. ConPT also admits percol
	ation-like critical phenomena which are shown to be universal on Bethe latt
	ices and regular two-dimensional lattices. We calculate the critical expone
	nts of ConPT and find (1) $\beta=1/2$ when $D=\infty$ (mean-field) and (2) 
	$\nu=0.598(27)$ when $D=2$\, accordingly conjecturing that ConPT belongs to
	 a new universality class other than classical percolation theory.
LOCATION:SCI 328\, 590 Commonwealth Avenue\, 02215
STATUS:CONFIRMED
CLASS:PUBLIC
END:VEVENT
END:VCALENDAR