Project information
Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing
- Project Identification
- MSM 143300001
- Project Period
- 1/1999 - 12/2004
- Investor / Pogramme / Project type
-
Ministry of Education, Youth and Sports of the CR
- Research Intents
- MU Faculty or unit
- Faculty of Informatics
- Keywords
- concurrency;process algebras; infinite state systems; real-time; modal and temporal logics;concurrent constraint systems;specification;verification;quantum algorithms and protocols;entanglement;quantum finite and cellular automata;design methodologies
Aim: Importance of non-sequential models of computing grows both from theoretical and practical point of view. The aim of this proposal for a long-term research is on one side the continuation of the already well established and successful research in the area of concurrent, distributed and parallel systems and on the other side the extension of the scope of the research into the area of quantum computing. Scope: Analysis of models of concurrency and of their mutual relations with the emphasis on decision, algorithmic and complexity problems. Analysis of models and the development of specification and transformation tools for real-time concurrent systems with emphasis on safety-critical systems. Logics, especially temporal and modal, for specification and analysis of concurrent and distributed systems. Design and analysis of quantum algorithms and development of methods for design of quantum algorithms and protocols, as well as for quantum finite automata and quantum cellular automata.
Results
The aim of this proposal for a long-term research is on one side the continuation of the already well established and successful research in the area of concurrent, distributed and parallel systems and on the other side the extension of the scope of the research into the area of quantum computing.
Publications
Total number of publications: 265
2000
-
Equally distant, partially entangled alphabet states for quantum channels
Physical Review A, year: 2000, volume: 62, edition: 5
-
JOMP Application Program Interface
Year: 2000, edition: Vyd. Version 0.1 (draft), number of pages: 32 s.
-
Matching Modulo Associativity and Idempotency is NP-Complete
Mathematical Foundation of Computer Science 2000, 25th International Symposium, year: 2000
-
Multiple observations of quantum clocks
Physical Review A, year: 2000, volume: 62, edition: 06
-
New challenges for theoretical informatics
IFIP TCS2000, year: 2000
-
On Simulation-Checking with Sequential Systems
Proceedings of 6th Asian Computing Science Conference (ASIAN 2000), year: 2000
-
Optimal manipulations with qubits: Universal quantum entanglers
Physical Review A, year: 2000, volume: 62, edition: 02
-
Physics of Quantum Information
J. Mod. Opt., year: 2000, volume: 47, edition: 2-3
-
Quantum computing challenges
Maathematics unlimited, 2001 and beyond, edition: Vyd. 1, year: 2000, number of pages: 35 s.
-
Quantum disentanglers
Physical Review A, year: 2000, volume: 62, edition: 05