| EPSRC Reference: |
GR/S30887/01 |
| Title: |
Quantum Algorithms for Inexact Graph Matching |
| Principal Investigator: |
Wilson, Professor R |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
Computer Science |
| Organisation: |
University of York |
| Scheme: |
Standard Research (Pre-FEC) |
| Starts: |
01 October 2003 |
Ends: |
30 November 2006 |
Value (£): |
196,333
|
| EPSRC Research Topic Classifications: |
| Fundamentals of Computing |
Logic & Combinatorics |
| Mathematical Analysis |
Mathematical Physics |
| Quantum Optics & Information |
|
|
| EPSRC Industrial Sector Classifications: |
| Electronics |
Information Technologies |
|
| Related Grants: |
|
| Panel History: |
|
|
Summary on Grant Application Form |
|
The aim in this proposal is to take some steps in the direction of developing quantum search procedures for the inexact subgraph isomorphism problem. We view this as a three stage process. First, we will turn our attention to the issue of how the problem can be represented in a manner which lends it: to quantum search. Second, we will elucidate quantum search algorithms, and specify the quantum machines necessary to support them. Finally, WE will provide simulations of the resulting algorithms and apply them to some practical graph-matchinbg problems furnished by our work in the computer vision domain.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
http://www.york.ac.uk |