Hola,
¿eres nuevo aquí?

Registrate y conecta tu empresa con financiación pública, partners y proyectos.

ASC-Q

Financiado

Algorithms, Security and Complexity for Quantum Computers

As progress is made in implementing quantum computers, the question is looming: What will we do with them? This proposal is concerned with the theoretical computer science aspects of this question. Part of this question is concern... ver más

30/06/2027

NWO-I

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

STICHTING NEDERLANDSE WETENSCHAPPELIJK ONDERZ... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2022-02-22

Línea de financiación objetivo El proyecto se financió a través de la siguiente ayuda:

ERC-2021-STG: ERC STARTING GRANTS

I+D

Cerrada hace 3 años

0% 100%

1 Participantes

NWO-I

1.50M€ | Lider

Proyectos interesantes

PLEC2021-008251 Few-qubit quantum hardware, algorithms and codes, on photoni... 92K€ Cerrado

QUARC QUARC-BEYOND QUANTUM ADVANTAGE: A PRACTICAL AND UNCONDITIONA... 190K€ Cerrado

PID2021-122547NB-I00 TECNOLOGIAS CLAVE PARA COMPUTACION CUANTICA 109K€ Cerrado

FIS2017-89860-P COMPUTACION CUANTICA REALISTA Cerrado

QSPEED Scalable quantum algorithms in highly noisy environments 140K€ Cerrado

PID2021-124054OB-C31 QSERV-UEX - DESARROLLO Y OPERACION DE MICROSERVICIOS CUANTIC... 136K€ Cerrado

Últimas noticias

01-12-2024: REDES En las últimas 48 horas el Organismo REDES ha otorgado 1337 concesiones

01-12-2024: IDAE En las últimas 48 horas el Organismo IDAE ha otorgado 4 concesiones

01-12-2024: AEI En las últimas 48 horas el Organismo AEI ha otorgado 23 concesiones

Duración del proyecto: 64 meses Fecha Inicio: 2022-02-22
Fecha Fin: 2027-06-30

Presupuesto del proyecto 1M€

Descripción del proyecto As progress is made in implementing quantum computers, the question is looming: What will we do with them? This proposal is concerned with the theoretical computer science aspects of this question. Part of this question is concerned with quantum algorithms (WP1). We know of several examples of quantum algorithms with large speedups over the best known classical algorithms, such as Shor's poly-time integer factorization algorithm. While this is evidence that quantum computers will be useful once built, it does not tell us what quantum computers will be used for in practice (probably not much factoring). To ensure that quantum computer users are best able to make use of them, we will focus on developing general techniques for the design of quantum algorithms that can be easily applied by subject-matter experts in different fields to the problems that interest them. We will also consider the constraints of early quantum computers in our algorithm design. First, we would like to understand how the limited memory of early quantum computers will impact what they can do. Some of the most important techniques for designing quantum algorithms are already well-suited to the study of space-bounded computation, and we will generalize and improve these in WP1. To complement this, we will study lower bounds and complexity (WP2), focusing on space-bounded complexity classes, which have many relationships with other complexity classes. Second, since most early users will have to delegate their quantum computations, we would like to understand which quantum algorithms can still be used in various delegated or multiparty settings where some type of security is a consideration. We take the novel approach of using a quantum algorithmic model called span programs to design secure quantum computing protocols (WP3). It turns out that space-bounded models and secure quantum computation are very much related, and understanding this relationship is what ties this proposal together.

Conecta tu I+D

Entra hoy

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores