*A counter-example for the graph area law conjecture*[pdf] [pptx]*Convex optimization and quantum information*[pdf], [pptx]

Simons Institute, 25 Sep 2014.*SDP hierarchies and quantum states*[pdf, pptx]

Simons Institute, 17 Jan 2014.*Product-state approximations for quantum ground states*(1310.0017) [pdf, pptx]

MIT, 1 Nov 2013; SUNY Stony Brook, 22 Nov 2013.*Separable states, unique games and monogamy*(1205.4484) [pdf, pptx] and [pdf, pptx]

TQC, 22 May 2013; Newton Institute, 2 Sep 2013; Simons Institute, 16 Jan 2014; IAS, 27 Jan 2014.*Monogamy of entanglement, and other commandments of quantum information*[pdf, ppt]

Brown SUMS, 9 Mar 2013.*Quantum de Finetti Theorems under Local Measurements with Applications*(1210.6367)

Berkeley, 17 Oct 2012 [pdf, ppt]; QIP, Beijing, 22 Jan 2013 [pdf, ppt] ; STOC, Stanford, 4 June 2013 [pdf, ppt]; ICMAT, 11 July 2013 ; Simons Institute, 27 Feb 2014 [pdf, ppt]*High-degree graphs cannot be used for a quantum PCP*[pdf, ppt]

Berkeley, 15 Oct 2012; UW, 4 Dec 2012; Cambridge, 26 Mar 2013; Michigan, 12 Apr 2013; STOC, Stanford, 4 June 2013.*Computing with adversarial noise*[ppt, pdf]

UIUC, 1 Oct 2012; Santa Fe Institute, 10 Oct 2012.*Efficient distributed quantum computing*(1207.2307)

MSR Redmond, 5 Oct 2012.*Permutations are approximately orthogonal*[pdf]

Hannover, 16 Sep, 2011; CIRM workshop, 13 Jan 2012; Waterloo, 10 Apr 2012; Seefeld Q. Info. Workshop, 5 July 2012; Cambridge, 14 July 2012*Separable states and their application to computer science*(1205.4484)

UW, 5 June 2012; ETHZ, 29 June, 2012; UCL, 12 July, 2012.*Random quantum circuits are approximate poly-designs*(1208.0692)

Dagstuhl, 21 Sep 2011.*Injective Tensor Norms: Hardness and Reductions*[video]

MSR Redmond, 28 Apr 2011 ; MSR New England, 10 Aug 2011.*Detecting pure entanglement is easy, so detecting mixed entanglement is hard*(1001.0017) [pdf]

PI workshop, 6 July, 2010; UW CSE theory seminar, 12 Oct, 2010; FOCS, 26 Oct, 2010; LANL, 28 Oct, 2010; Waterloo IQC, 9 Apr, 2012.*The power of quantum sampling*[pdf v1, pdf v2]

Waterloo, 9 Feb, 2010; NEC, 25 March, 2010; UNM, 27 Oct, 2010; UW, 3 Feb, 2011.*Quantum algorithms for testing probability distributions*(0907.3920) [pdf]

STACS, 4 Mar 2010.*A quantum algorithm for solving linear systems of equations*(0811.3171) [pdf]

PI seminar, 4 May 2009; KITP seminar, 21 Oct 2009; MIT, 23 Nov 2009; QIP, 21 Jan 2010; Bristol CS, 18 Feb 2010; APS March Meeting, 15 Mar 2010; Princeton, 29 Mar 2010; Rutgers, 9 Apr 2010; Heilbronn conference, 18 May 2010; UW, 20 May 2010; ILAS, 25 June 2010;*Entanglement spread and clean resource inequalities*(0909.1557) [pdf]

MIT 'XQIT' conference, 19 November 2008; Waterloo IQC group meeting, 5 May 2009; ICMP'09, 6 Aug 2009; PI seminar, 8 Feb 2010; Princeton, 22 Apr 2010; Imperial College, 5 Aug 2010.*Quantum pseudo-randomness*[.pdf]

LANL 'CQIT' conference, 26 March 2008; Caltech, 3 April 2008; PI conference, 28 April 2008; CIFAR meeting, 4 June 2008; Cambridge, 24 June 2008; Tohoku workshop, 7 November 2008.*Quantum expanders from any classical Cayley graph expander*(0709.1142) [.pdf]

QIP, New Delhi, 20 December 2007; CWI, 22 February 2008.*Group representations and quantum information*[.pdf]

NII, Tokyo, 5 February 2007; UKZN, Durban, 2 April 2007.*Superpolynomial speedup from almost any circuit*(0805.0007) [.ppt]

local Bristol seminar, 11 October 2006; IBM, Yorktown Heights, NY, 5 January 2007; Caltech IQI seminar, 23 January 2007; QIP, Brisbane, 30 January 2007; Waterloo Randomization workshop, 27 June 2007. ICALP, 10 July 2008.*Forget this talk: Erasing correlations and undoing entanglement*[quant-ph/0511219]

Short talk at QIP conference in Paris, Jan 2006 [ppt, pdf]

Long talk at IHP workshop in Paris, Mar 2006 [ppt]

IBM, 26 May 2006; Waterloo, 31 July 2006; Oxford, 8 Dec 2006.-
*Applications of coherent classical communication and Schur duality to quantum information theory*- dissertation defense, June 28, 2005 (quant-ph/0512255) [.ppt] -
*A Family of Quantum Protocols*[quant-ph/0308044]

Group meeting, Oct 2004 [.ppt]

Short talk at IEEE Symposium on Information Theory in Chicago, July 2004 [.ppt] -
*Efficient quantum circuits for Clebsch-Gordan and Schur duality transforms*[quant-ph/0407082]

Talk at QIP conference at MIT, Jan 2005 [.ppt]

Talk at Newton Institute, Nov 2004 [.ppt]

Talk at Perimeter Institute, Oct 2004 [.ppt]

Medium-short talk at SQUINT meeting in UCSD, Feb 2004 [.ppt] -
*Coherent communication of classical messages*[quant-ph/0307091]

Talk at Caltech IQI, Feb 2004 [.ppt]

Short talk at QIP in Waterloo, Jan 2004 [.ppt]

Very short talk at ARO program review in Nashville, Aug 2003 [.ppt]

Talk at Tokyo ERATO office, July 2003 [.ppt] -
*A tight lower bound on the communication cost of entanglement dilution*[quant-ph/0204096]

Short talk at IEEE Symposium on Information Theory in Yokohama, July 2003 [.dvi] -
*Gentle tomography and universal data compression*[quant-ph/0403078]

Talk at Caltech IQI, Jan 2003 [.ppt] -
*Classical capacity of bidirectional channels*[quant-ph/0205057]

Short talk at AMS section meeting at Northeastern, Oct 2002 [.ppt] -
*Gate robustness: how much noise will ruin a unitary gate?*[quant-ph/0301108]

Short talk at MSRI QIP, Dec 2002 [.ppt] -
*Communication capacities of nonlocal gates and Hamiltonians*[quant-ph/0205057]

poster at IBM Yorktown QIP, Jan 2002 [.gif]

poster at UCSB ITP Conference on Quantum Information, Dec 2001