OzHub, the Macquarie Telecom-led cloud computing alliance, has come down firmly on the side of Optus over the copyright controversy surrounding Optus TV Now, warning that any moves to change the law "risk branding Australia a global luddite state."
read more
Stephen Withers
Monday, 12 February 2007 05:29
Quantum computing (in this writer's limited understanding) is based on the idea that at a quantum level, states are undetermined until they are observed. Thus while a conventional computer's bits are always on or off, a quantum computer's qubits (quantum bits) exist in both states at the same time. A quantum computer 'collapses' these states to generate a solution.
A simple example of what's known as an NP-Complete' problem is the travelling salesman problem (determining a route starting and ending at the same city, but visiting a number of others exactly once at the lowest total cost). Equivalent problems occur in manufacturing and other areas.
The reason why these combinatorial problems are important is that they occur frequently in real life, and the time needed to solve them on a conventional computer goes up rapidly as they become more complicated (eg, the number of cities to be visited increases).
Loading comments ...

|
Microsoft Office 365Try an easy-to-use set of web-enabled tools for business-class productivity services. Office 365 provides anywhere-access to email, important documents, contacts, and calendars on almost any device. |