Quantum Information and Entanglement: a new framework for Science and Technology with quantum many-body systems. The expected outcome of the research program is a significant boost in the understanding of quantum many-body systems, which will reinforce Australia's competitiveness and international profile in aspects of breakthrough science and frontier technologies. By developing both the underpinning theory and innovative computational tools, and by applying them to problems of recognised impor ....Quantum Information and Entanglement: a new framework for Science and Technology with quantum many-body systems. The expected outcome of the research program is a significant boost in the understanding of quantum many-body systems, which will reinforce Australia's competitiveness and international profile in aspects of breakthrough science and frontier technologies. By developing both the underpinning theory and innovative computational tools, and by applying them to problems of recognised importance, this program will have direct implications in areas of condensed matter physics, quantum statistical mechanics, particle physics, complex systems, quantum information science and technology, quantum computation, engineered quantum systems and nanotechnology. Read moreRead less
Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is ....Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is relevant to public-key cryptography, where breaking an encryption scheme should be infeasible, and to many real-life situations where NP-complete problems need to be solved, either exactly or approximately.Read moreRead less
Group actions: combinatorics, geometry and computation. Science today relies on digital technologies using quantised and digital information. Because of the discrete nature of digital information, much of the mathematics underpinning these advances comes from the core disciplines of algebra and combinatorics within which this proposal falls. All aspects of the proposal focus on strengthening theoretical understanding of algebraic and combinatorial structures, and increasing computational power f ....Group actions: combinatorics, geometry and computation. Science today relies on digital technologies using quantised and digital information. Because of the discrete nature of digital information, much of the mathematics underpinning these advances comes from the core disciplines of algebra and combinatorics within which this proposal falls. All aspects of the proposal focus on strengthening theoretical understanding of algebraic and combinatorial structures, and increasing computational power for working with them. The fundamental research outcomes, in terms of theorems, algorithms, and the training of young research mathematicians, will thus both enhance the high international standing of Australian mathematics, and strengthen Australia's capabilities in these important areas.Read moreRead less