New Quantum Algorithms for problems of interest to us are extremely difficult to make. We can reason with Digital Logic Circuits but Quantum Circuits are made up of matrices of complex numbers which are highly non-intuitive.
Automatski has invented some pathbreaking new Quantum Algorithms
- Quantum Circuit Optimization
- Quantum Circuit Equivalence
The most common approaches used are
Heuristics
Tensor Networks
Local Algorithms
Pattern Matching & Substitution
Rule Based Substitution
ZX Calculus
We created a method by which we can create Equivalent 100X-1000X lower T-Count Circuits. We can reduce T-Count from billions to a couple of millions on production grade applications, so this is a huge deal.
And it works for any set of gates, any hardware backend. Needless to say our method can accurately measure circuit equivalence too.
And these are just some of our innovations in algorithms.