Quantum Information Processing with Interacting Parties
We are approaching an era where the capabilities of quantum hardware begin to meet the requirements of theoretical quantum protocols. Such times give new urgency to the Central Challenge of the theory of quantum information proces...
We are approaching an era where the capabilities of quantum hardware begin to meet the requirements of theoretical quantum protocols. Such times give new urgency to the Central Challenge of the theory of quantum information processing:
For which tasks do quantum devices hold an advantage over their conventional counterparts?
My proposal addresses this challenge in the context of information processing with interacting parties, which is the natural setting for problems in cryptography, communication, and distributed computing. We take a two-pronged approach with each prong addressing an essential facet of interactive information processing while sharing a common focus on efficiency. A desired impact is to kick-start a new pragmatic trend that focuses on efficiency in areas where the main goal so far has been an information-theoretic understanding of ultimate quantum capabilities.
The first work package deals with the uniquely quantum resource of entanglement which is responsible for most quantum advantages in multi-party settings. We will propose new tools (e.g. entanglement-preserving reductions) that will allow us to systematically identify scenarios where the generally elusive quantum advantages can be detected and realized efficiently. We will also address major outstanding challenges like the Parallel Repetition question and finding a simple task capable of distinguishing two competing models of entanglement. The latter is our most ambitious goal which would provide an alternative proof for Connes' Embedding Problem and lay theory groundwork for an experiment capable of identifying the right mathematical description of reality.
The second work package will leverage Schur-Weyl duality to devise efficient algorithms for symmetric problems with quantum input. We will put forth new error reduction algorithms for black-box devices (e.g. quantum majority vote) and propose highly efficient explicit quantum circuits for key subroutines like quantum Schur sampling.ver más
Seleccionando "Aceptar todas las cookies" acepta el uso de cookies para ayudarnos a brindarle una mejor experiencia de usuario y para analizar el uso del sitio web. Al hacer clic en "Ajustar tus preferencias" puede elegir qué cookies permitir. Solo las cookies esenciales son necesarias para el correcto funcionamiento de nuestro sitio web y no se pueden rechazar.
Cookie settings
Nuestro sitio web almacena cuatro tipos de cookies. En cualquier momento puede elegir qué cookies acepta y cuáles rechaza. Puede obtener más información sobre qué son las cookies y qué tipos de cookies almacenamos en nuestra Política de cookies.
Son necesarias por razones técnicas. Sin ellas, este sitio web podría no funcionar correctamente.
Son necesarias para una funcionalidad específica en el sitio web. Sin ellos, algunas características pueden estar deshabilitadas.
Nos permite analizar el uso del sitio web y mejorar la experiencia del visitante.
Nos permite personalizar su experiencia y enviarle contenido y ofertas relevantes, en este sitio web y en otros sitios web.