Integrated quantum photonics
As the field has progressed new quantum algorithms have been developed which provide short and long term routes towards the demonstration of the superiority of quantum computers over their classical counterparts. Cluster state computation is now generally accepted as the approach that will be used to develop a fully fledged quantum computer. Whilst development of quantum computer will require the synthesis of many different aspects of integrated optics, boson sampling seeks to demonstrate the power of quantum computation via technologies readily available and is therefore a very promising near term algorithm to doing so. In fact shortly after its proposal there were several small scale experimental demonstrations of the boson sampling algorithm
Quantum computing
Although quantum computers may be faster than classical computers for some problem types, those described above cannot solve any problem that classical computers cannot already solve. A Turing machine can simulate these quantum computers, so such a quantum computer could never solve an undecidable problem like the halting problem. The existence of "standard" quantum computers does not disprove the Church–Turing thesis. It has been speculated that theories of quantum gravity, such as M-theory or loop quantum gravity, may allow even faster computers to be built. Currently, "defining" computation in such theories is an open problem due to the "problem of time", i.e., there currently exists no obvious way to describe what it means for an observer to submit input to a computer and later receive output.