other seminars:

Lior Eldar (MIT) Quantum entanglement is considered to be a very delicate phenomenon that is hard to maintain in the presence of noise, or nonzero temperatures. In recent years however, and motivated by a quest for a quantum analog of the PCP theorem, researches have tried to establish whether or not we can preserve quantum entanglement at constant temperature that is independent of system size. This would imply that any quantum state with energy at most, say 0.05 of the total available energy of the Hamiltonian, would be highlyentangled. However to this date, no such systems were found. Moreover, it became evident that even embedding local Hamiltonians on robust, albeit "nonphysical" topologies, namely expanders, does not guarantee entanglement robustness. In this talk, I'll provide indication that such robustness may be possible after all, by showing a local Hamiltonian with the following property of inapproximability: any quantum state that violates a fraction at most 0.05 of all local terms cannot be even approximately simulated by classical circuits whose depth is sublogarithmic in the number of qubits. In a sense, this implies that even providing a "witness" to the fact that the local Hamiltonian can be "almost" satisfied, requires longrange entanglement. William Wooters (Williams College) Two orthogonal bases for a Hilbert space are called mutually unbiased if each vector in one basis is an equalmagnitude superposition of all the vectors in the other basis. The maximum number of mutually unbiased bases in a space of dimension d is d+1; so a set of d+1 such bases is called complete. Complete sets of mutually unbiased bases play significant roles in quantum cryptography and quantum tomography. For certain values of d, it is possible to find a single unitary transformation that, by repeated application, generates a complete set of mutually unbiased bases starting with the standard basis. This talk reviews our current understanding of such cycling unitaries and related transformations, and shows how their effects can be pictured in a discrete phase space. Beni Yoshida (Caltech) We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum errorcorrecting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an exact isometry from bulk operators to boundary operators. The entire tensor network is a quantum errorcorrecting code, where the bulk and boundary degrees of freedom may be identified as logical and physical degrees of freedom respectively. These models capture key features of entanglement in the AdS/CFT correspondence; in particular, the RyuTakayanagi formula and the negativity of tripartite information are obeyed exactly in many cases. That bulk logical operators can be represented on multiple boundary regions mimics the Rindlerwedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum errorcorrecting features of AdS/CFT. This is a joint work with Daniel Harlow, Fernando Pastawski and John Preskill Sergey Bravyi (IBM) TBA Lidia del Rio (University of Bristol) TBA Rotem Arnon Friedman (ETH Zurich) TBA Marco Tomamichel (The University of Sydney) TBA 