Principles of Quantum Information Science. The use of quantum mechanical systems to carry and process information is enabling a revolution in information technology through innovations such as quantum computation and quantum teleportation. This project investigates the fundamental theory of quantum information science. The project aims to formulate general principles governing the power and behaviour of quantum information. These principles will, in turn, enable the development of powerful new ....Principles of Quantum Information Science. The use of quantum mechanical systems to carry and process information is enabling a revolution in information technology through innovations such as quantum computation and quantum teleportation. This project investigates the fundamental theory of quantum information science. The project aims to formulate general principles governing the power and behaviour of quantum information. These principles will, in turn, enable the development of powerful new applications of quantum information. Principal areas to be addressed include: general conditions for a physical system to be usable for quantum computation, the development of new algorithms for quantum computers, the development of new quantum communication protocols, and the theory of quantum entanglement.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