Frequently Asked Questions
What is P-Computing?
P-Computing refers to probabilistic computing. Decision-making, econometrics, risk management, chip design, drug design, business analytics, and machine learning are not deterministic. Why should our processors be all deterministic?
How is P-Computing different?
The majority of today’s digital circuitry is based on building blocks called bits that are deterministically 0 or 1. At the other end of the spectrum are quantum computers consisting of qubits that occupy some superposition of 0 and 1. The probabilistic-bit occupies a niche between these extremes, sharing qualities with both classical and quantum-bit. The p-bit fluctuates probabilistically between 0 and 1 and can be pinned to one or the other state based on the magnitude and sign of its input.
Time: P-Computing can speed up time-intensive computations by several orders of magnitude improvement over CPUs and GPUs.
Power consumption: The speed-up neither increases the cost nor the consumed power. If there were a way for CPUs and GPUs to be as fast as P-Computing, it would cost significantly more and consume a lot more energy.
Where is the proof?
We have solved and presented solutions for multiple time-intensive problems, which sped up 100X over GPUs and CPUs on even an emulated P-Computer. We are happy to engage and speed up any relevant and crucial time-intensive computation of interest to you if you are interested.
Can I use a P-Computer today?
Yes. We can speed up computation today on an emulated P-Computer. We can get even more significant speedups with an ASIC version of the P-Computer.