Skip to main content
Ir a la página de inicio de la Comisión Europea (se abrirá en una nueva ventana)
español español
CORDIS - Resultados de investigaciones de la UE
CORDIS
Contenido archivado el 2024-05-27

Quantum computation: novel algorithms and their many-body implementations

Objetivo

Goals of this project are the construction of new quantum algorithms as well as the investigation of the theoretical realisability of their implementations in devices based on realistic physical structures. The study of microscopic complex regularities of the physical interactions and the symmetries mirroring the system's invariance with respect to specific state space transformations is planned which might lead to outstanding fast algorithms for hard problems in combinatorics. Parallel to this, we intend to provide a compiler capable to perform the transition from an algebraic specified signal transformation to a sequence of elementary quantum gates.
Goals of this project are the construction of new quantum algorithms as well as the investigation of the theoretical realisability of their implementations in devices based on realistic physical structures. The study of microscopic complex regularities of the physical interactions and the symmetries mirroring the system's invariance with respect to specific state space transformations is planned which might lead to outstanding fast algorithms for hard problems in combinatorics. Parallel to this, we intend to provide a compiler capable to perform the transition from an algebraic specified signal transformation to a sequence of elementary quantum gates.

OBJECTIVES
The key idea of this proposal is to use quantum superposition, entanglement and controlled quantum mechanical evolution to speed up computation with respect to the classical case. It is promising to apply non-abelian Fourier transforms and other unitary signal transforms to graph theoretical and combinatorial problems (such as the evaluation of the permanent of large matrices), which have turned out to be notoriously hard for any classical computer. Since a systematic approach to the study and development of quantum algorithms is lacking we intend to fill in this gap by providing tools for the development of quantum algorithms. These are designed to help engineering quantum state transformations on a very fine grain level enabling the programmer to find efficient factorisations of desired transformations automatically. Attention will be devoted in particular to approaches based on non-abelian harmonic analysis.

DESCRIPTION OF WORK
A thorough understanding of the principles on which the known quantum algorithms are based on is a precondition for the design of new quantum algorithms. The basic research part of the work will yield a candidate list of combinatorial problems, which can be tackled on a quantum computer. A language to express quantum programs will be written on a high level of abstraction using computer algebra systems. There are options to extend this programming language by assembler-like operations depending on the physical hardware chosen. One of our objectives is to provide a tool to obtain ultra-fast quantum circuits for generalised Fourier transforms and other signal transforms in an automatic fashion.
The appearing symmetries are captured by group and representation theoretical methods, which can best be handled by computer algebra systems. It is intended to model operations using algebraic data types representing them as sparse as possible. As for algorithms, attention will be devoted in particular to approaches based on non-abelian harmonic analysis of graph theoretical and combinatorial problems, such as the evaluation of the permanent of large matrices. Graphs with regular auto morphism groups appear naturally in meso- and carbon physics as symmetry groups of the systems. Therefore also crystallographic groups and their spectral properties will be analysed by the developed means.

Ámbito científico (EuroSciVoc)

CORDIS clasifica los proyectos con EuroSciVoc, una taxonomía plurilingüe de ámbitos científicos, mediante un proceso semiautomático basado en técnicas de procesamiento del lenguaje natural. Véas: El vocabulario científico europeo..

Para utilizar esta función, debe iniciar sesión o registrarse

Programa(s)

Programas de financiación plurianuales que definen las prioridades de la UE en materia de investigación e innovación.

Tema(s)

Las convocatorias de propuestas se dividen en temas. Un tema define una materia o área específica para la que los solicitantes pueden presentar propuestas. La descripción de un tema comprende su alcance específico y la repercusión prevista del proyecto financiado.

Convocatoria de propuestas

Procedimiento para invitar a los solicitantes a presentar propuestas de proyectos con el objetivo de obtener financiación de la UE.

Datos no disponibles

Régimen de financiación

Régimen de financiación (o «Tipo de acción») dentro de un programa con características comunes. Especifica: el alcance de lo que se financia; el porcentaje de reembolso; los criterios específicos de evaluación para optar a la financiación; y el uso de formas simplificadas de costes como los importes a tanto alzado.

CSC - Cost-sharing contracts

Coordinador

UNIVERSITAET KARLSRUHE (TH)
Aportación de la UE
Sin datos
Dirección
KAISERSTRASSE 12
76131 KARLSRUHE
Alemania

Ver en el mapa

Coste total

Los costes totales en que ha incurrido esta organización para participar en el proyecto, incluidos los costes directos e indirectos. Este importe es un subconjunto del presupuesto total del proyecto.

Sin datos

Participantes (1)

Mi folleto 0 0