Discovery Projects - Grant ID: DP0984470

Funding Activity

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

Graph isomorphism and quantisation of longest cycles by means of determinants and spectra. A characterisation of the difficulty of the Hamiltonian cycle problem and the graphs isomorphism problem will be a significant conceptual advancement with repercussions in a number of fields including combinatorial optimisation and theoretical computer science, in particular, the Google PageRank. Applications of tensor networks technique will lead to a design of a quantum computer that enumerates all Hamiltonian cycles in a graph. Analysis of the determinant objective function in terms of the eigenvalues may lead to new spectral properties of stochastic matrices. Algorithmic advances exploiting such a characterisation will significantly contribute to existing technologies for solving problems in a wide range of applications.

Funded Activity Details

Start Date: 10-2009

End Date: 03-2012

Funding Scheme: Discovery Projects

Funding Amount: $262,000.00

Funder: Australian Research Council