Hi Guys,
here it is the title and abstract of Aram Harrow talk on 29 June, this Friday, at 11am in HIT E 41.1.
Best, Fernando
Title: Separable states and their applications in computer science
Abstract: I'll discuss how optimizing over separable states (or equivalently, estimating whether a density matrix is separable or entangled) is comparable in difficulty to many important approximation problems in classical computer science, such as estimating the 2->4 norm of a matrix, or estimating the minimum expansion of small subsets of a graph. These connections yield new (classical) algorithms and lower bounds for these approximation problems, and may also yield new classes of interesting quantum states by adapting results from classical computer science.
Joint work with Boaz Barak, Fernando Brandao, Jon Kelner, David Steurer and Yuan Zhou (STOC 2012, arXiv:1205.4484). ___________________________
Hi everyone,
Aram and I are going to have dinner leaving here at 6:15 pm. Would you like to join us?
Best, Fernando
On Tue, Jun 26, 2012 at 9:29 AM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi Guys,
here it is the title and abstract of Aram Harrow talk on 29 June, this Friday, at 11am in HIT E 41.1.
Best, Fernando
Title: Separable states and their applications in computer science
Abstract: I'll discuss how optimizing over separable states (or equivalently, estimating whether a density matrix is separable or entangled) is comparable in difficulty to many important approximation problems in classical computer science, such as estimating the 2->4 norm of a matrix, or estimating the minimum expansion of small subsets of a graph. These connections yield new (classical) algorithms and lower bounds for these approximation problems, and may also yield new classes of interesting quantum states by adapting results from classical computer science.
Joint work with Boaz Barak, Fernando Brandao, Jon Kelner, David Steurer and Yuan Zhou (STOC 2012, arXiv:1205.4484). ___________________________
Hi Guys,
Aram, Joe and I are going to Jimmy's pizza today at 8pm. Does anyone want to join us? We'll leave ETH around 7:30pm.
Cheers, Fernando
On Thu, Jun 28, 2012 at 5:33 PM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi everyone,
Aram and I are going to have dinner leaving here at 6:15 pm. Would you like to join us?
Best, Fernando
On Tue, Jun 26, 2012 at 9:29 AM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi Guys,
here it is the title and abstract of Aram Harrow talk on 29 June, this Friday, at 11am in HIT E 41.1.
Best, Fernando
Title: Separable states and their applications in computer science
Abstract: I'll discuss how optimizing over separable states (or equivalently, estimating whether a density matrix is separable or entangled) is comparable in difficulty to many important approximation problems in classical computer science, such as estimating the 2->4 norm of a matrix, or estimating the minimum expansion of small subsets of a graph. These connections yield new (classical) algorithms and lower bounds for these approximation problems, and may also yield new classes of interesting quantum states by adapting results from classical computer science.
Joint work with Boaz Barak, Fernando Brandao, Jon Kelner, David Steurer and Yuan Zhou (STOC 2012, arXiv:1205.4484). ___________________________
Sorry, I forgot to say where Jimmy's pizza is in the last email:
http://maps.google.co.uk/maps?hl=en&tab=wl
On Fri, Jun 29, 2012 at 4:34 PM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi Guys,
Aram, Joe and I are going to Jimmy's pizza today at 8pm. Does anyone want to join us? We'll leave ETH around 7:30pm.
Cheers, Fernando
On Thu, Jun 28, 2012 at 5:33 PM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi everyone,
Aram and I are going to have dinner leaving here at 6:15 pm. Would you like to join us?
Best, Fernando
On Tue, Jun 26, 2012 at 9:29 AM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi Guys,
here it is the title and abstract of Aram Harrow talk on 29 June, this Friday, at 11am in HIT E 41.1.
Best, Fernando
Title: Separable states and their applications in computer science
Abstract: I'll discuss how optimizing over separable states (or equivalently, estimating whether a density matrix is separable or entangled) is comparable in difficulty to many important approximation problems in classical computer science, such as estimating the 2->4 norm of a matrix, or estimating the minimum expansion of small subsets of a graph. These connections yield new (classical) algorithms and lower bounds for these approximation problems, and may also yield new classes of interesting quantum states by adapting results from classical computer science.
Joint work with Boaz Barak, Fernando Brandao, Jon Kelner, David Steurer and Yuan Zhou (STOC 2012, arXiv:1205.4484). ___________________________
There you go :-)
Jimmy's Pizzeria-Bodega Culmannstrasse 1, 8006 Zürich, Switzerland +41 44 251 36 51 · jimmys-pizzeria.ch
On Fri, Jun 29, 2012 at 4:57 PM, Fernando Brandao fgslbrandao@gmail.com wrote:
Sorry, I forgot to say where Jimmy's pizza is in the last email:
http://maps.google.co.uk/maps?hl=en&tab=wl
On Fri, Jun 29, 2012 at 4:34 PM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi Guys,
Aram, Joe and I are going to Jimmy's pizza today at 8pm. Does anyone want to join us? We'll leave ETH around 7:30pm.
Cheers, Fernando
On Thu, Jun 28, 2012 at 5:33 PM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi everyone,
Aram and I are going to have dinner leaving here at 6:15 pm. Would you like to join us?
Best, Fernando
On Tue, Jun 26, 2012 at 9:29 AM, Fernando Brandao fgslbrandao@gmail.com wrote:
Hi Guys,
here it is the title and abstract of Aram Harrow talk on 29 June, this Friday, at 11am in HIT E 41.1.
Best, Fernando
Title: Separable states and their applications in computer science
Abstract: I'll discuss how optimizing over separable states (or equivalently, estimating whether a density matrix is separable or entangled) is comparable in difficulty to many important approximation problems in classical computer science, such as estimating the 2->4 norm of a matrix, or estimating the minimum expansion of small subsets of a graph. These connections yield new (classical) algorithms and lower bounds for these approximation problems, and may also yield new classes of interesting quantum states by adapting results from classical computer science.
Joint work with Boaz Barak, Fernando Brandao, Jon Kelner, David Steurer and Yuan Zhou (STOC 2012, arXiv:1205.4484). ___________________________
itp-quantumseminare@lists.phys.ethz.ch