Breakthroughs
Automatski combines system building with applied research in cryptography, error correction, quantum walks, Monte Carlo methods, QUBO libraries, SAT solving, and algorithm reference implementations. These proof points help customers and investors evaluate both depth and execution range.
Automatski has factorized a large RSA number using Shor's algorithm on quantum computers with 126 logical qubits, demonstrating the kind of cryptography workload that matters to post-quantum security planning.
Automatski has demonstrated elliptic-curve discrete logarithm cracking using Shor's algorithm with 63 logical qubits, directly connecting quantum computing progress to blockchain, identity, and public-key infrastructure risk.
Quantum error correction determines how quickly quantum computers become useful at scale. Automatski works on discovering new quantum codes and optimizing existing code structures using annealer-backed methods.
Automatski ports quantum walk methods to its quantum backend, supporting Szegedy models, continuous-time quantum walks, quantum walk evolution, and quantum search.
Algorithm libraries
Several products are positioned as reference implementations or benchmarked algorithm collections.
112 QUBO formulations with examples give customers a practical library for converting real-world optimization problems into annealer-ready models.
Methods include VMC, DMC, GFMC, AFQMC, FCIQMC, PIMC, CT-QMC, SSE, worldline, and lattice QMC for scientific simulation and quantum chemistry research.
A universal Monte Carlo approach benchmarked across 10 problems, created for use cases where classical stochastic integration costs become a bottleneck.
A hybrid QAOA implementation for generic problems represented as Pauli exponentials, useful for optimization, physics, and algorithm research.
An industrial QKD simulator platform covering QKD simulation, network simulation, quantum network digital twins, security testbeds, telecom planning, KMS simulation, research, education, and cloud-native deployment.
A very large-scale SAT solver for hard Boolean and cryptographic problems, designed to move toward supercomputer and HPC deployment.