Quantum Computing

Quantum computing promises to break and remake Computer Science. In theory, it can address the largest problem in computing science (summarized as P=NP - we won’t discuss this here).

Currently, there are two types of quantum computing technologies that could be commercial in 10 years - Adiabatic quantum computing (being developed by DWave) and gate quantum computing (by IBM and others). Research is occurring on other types (Topological) but no public demonstrable system exists.

quantum computation uses quantum mechanical effects to find local minima in complex multivariable problems - put simply it does things like optimisations and routing potentially orders of magnitude faster than current ‘classical’ computers. For public safety, this means better algorithms to match resources to an incident, faster ways of getting there. This was the first quantum computer that was sold to a customer and is currently being used for research problems.

Gate Quantum computation was the first theoretical description of how quantum computing would work (to some people this is ‘true’ quantum computing). At this moment, this is a heavy area of research with major players investing in this space. IBM Q has made a 4 Qbit system available to the public for general investigation (a real-world system would need to be at least 128 Qbits). There are a new class of quantum algorithms being developed that could benefit public safety. There are also issue with the ‘stability’ of gate quantum computer. This is have been massively improved in the last 18 months or so but there is a long way to go before this is extended enough for reasonable calculations.

A selected summary is provided below:

● Grover’s algorithm could make searching for data in a random in a data store much faster. This would be very useful when ingesting massive amounts of data into a data lake. Improving search could make MapReduce (Big Data algorithms) much much faster, therefore, allowing access to a new class of ‘real-time-hyper-data’ tools.

● Deutsch-Jozsa Algorithm - is used to create positive and negative weights in a new class of machine learning algorithms (‘Quantum Deep Learning’). Superpositioning these weights may also add another layer over existing deep learning algorithms. It could certainly speed up exponentially the rate of model training which in of itself you produce more sophisticated models.

● Shor’s algorithm - as well as destroying classical cryptography, it will likely create a new type of quantum hashing process and quantum cryptography

● Quantum Walk - a new source of creating probability - could provide breakthrough is routing, statistical modelling.

If you like this please tell me and I will be happy to write more articles in this space.Quantum computing promises to break and remake Computer Science. In theory, it can address the largest problem in computing science (summarized as P=NP - we won’t discuss this here).

Currently, there are two types of quantum computing technologies that could be commercial in 10 years - Adiabatic quantum computing (being developed by DWave) and gate quantum computing (by IBM and others). Research is occurring on other types (Topological) but no public demonstrable system exists.

quantum computation uses quantum mechanical effects to find local minima in complex multivariable problems - put simply it does things like optimisations and routing potentially orders of magnitude faster than current ‘classical’ computers. For public safety, this means better algorithms to match resources to an incident, faster ways of getting there. This was the first quantum computer that was sold to a customer and is currently being used for research problems.

Gate Quantum computation was the first theoretical description of how quantum computing would work (to some people this is ‘true’ quantum computing). At this moment, this is a heavy area of research with major players investing in this space. IBM Q has made a 4 Qbit system available to the public for general investigation (a real-world system would need to be at least 128 Qbits). There are a new class of quantum algorithms being developed that could benefit public safety. There are also issue with the ‘stability’ of gate quantum computer. This is have been massively improved in the last 18 months or so but there is a long way to go before this is extended enough for reasonable calculations.

A selected summary is provided below:

● Grover’s algorithm could make searching for data in a random in a data store much faster. This would be very useful when ingesting massive amounts of data into a data lake. Improving search could make MapReduce (Big Data algorithms) much much faster, therefore, allowing access to a new class of ‘real-time-hyper-data’ tools.

● Deutsch-Jozsa Algorithm - is used to create positive and negative weights in a new class of machine learning algorithms (‘Quantum Deep Learning’). Superpositioning these weights may also add another layer over existing deep learning algorithms. It could certainly speed up exponentially the rate of model training which in of itself you produce more sophisticated models.

● Shor’s algorithm - as well as destroying classical cryptography, it will likely create a new type of quantum hashing process and quantum cryptography

● Quantum Walk - a new source of creating probability - could provide breakthrough is routing, statistical modelling.

If you like this please tell me and I will be happy to write more articles in this space.