QCI's Dirac-3S photonic entropy computer solves NP-hard maximum clique problems via the Motzkin-Straus theorem, matching or outperforming classical solvers on 82% of DIMACS benchmarks without encoding overhead.

QCI's Dirac-3S photonic entropy computer solves NP-hard maximum clique problems via the Motzkin-Straus theorem, matching or outperforming classical solvers on 82% of DIMACS benchmarks without encoding overhead.
We develop a classical Local Vector algorithm and analyze QAOA for Max-k-Cut on regular graphs, proving quantum advantage at moderate girth (depth p≥9) with provable performance guarantees.
Demonstrates that neutral-atom quantum processors generate superior candidate routing solutions compared to classical methods when integrated as pricing oracles in hybrid column generation optimization frameworks.
Proves QAOA can surpass the Overlap Gap Property barrier that limits quantum-inspired classical algorithms, but requires super-polynomial circuit depths—approximately 250 layers at 50 qubits—prohibitive for current hardware.
Relative decoding framework enables higher-degree polynomial quantum filters than standard approaches, demonstrating quantum advantage in optimization with a 3.6-point gap over classical methods while unifying fermionic, qubit, and bosonic systems.
Academic teams developed hybrid quantum-classical optimization for real-time airline passenger re-accommodation using quantum algorithms, advancing practical quantum technology applications.
LP-QAOA enables multi-stage quantum optimization by learning from earlier stages to construct refined mixers, achieving higher success rates with fewer final-objective evaluations on hierarchical problems through coherent projector mixing.
CGI and D-Wave are partnering to deploy quantum optimization solutions for enterprises in transportation, logistics, and retail, scaling from proof-of-concept to production hybrid quantum-classical systems.
QAOA algorithm successfully optimized gas transmission networks on IonQ Forte-1, achieving valid solutions with shallow circuits—demonstrating practical quantum computing for energy infrastructure.
Quantum optimization breakthrough: fixed-angle conjecture disproven for depth-2 QAOA on 9-regular graphs, while confirmed for depth-1 (any regularity) and all depths on 2-regular graphs. Advances theoretical understanding of quantum algorithms.
Classiq, INGL, and IonQ collaborate on quantum optimization for natural gas transmission networks, demonstrating results on IonQ Forte-1 quantum computer.
D-Wave announced a strategic partnership with CGI to integrate its Advantage2 quantum computer and hybrid solvers into enterprise services, targeting optimization challenges in logistics, transportation, and retail sectors.
Demonstrates using Rydberg atom arrays to solve NP-hard wireless resource allocation problems by reformulating them as Maximum Independent Set problems. Results on Pasqal emulator match classical optimal solver performance.
Warm-start QAOA on IonQ Forte-1 improved feasibility but showed limited optimization gains on drug-response models. Classical greedy search outperformed quantum hardware in finding global optima, with greedy solving all instances within 200 evaluations.
TR-Hy-FALQON merges time-rescaling and second-order feedback variants to reduce circuit depth while maintaining solution stability. Achieves comparable accuracy to QAOA with fewer layers—promising for NISQ-era quantum optimization.
Researchers developed a graph neural network and reinforcement learning framework that reduces ancilla-qubit overhead by 36.7% compared to existing methods, advancing efficient resource allocation for fault-tolerant quantum computers.
Q-CTRL's Fire Opal integrates AI-powered error suppression with IBM Quantum hardware, reducing procurement complexity and improving fidelity for enterprise applications. Successfully demonstrated on 127-qubit systems for optimization problems.
Addresses quantum compression obstacles in vehicle routing via non-diagonal QRAO relaxation. Demonstrates repair-after-rounding approach on IBM Heron hardware with explicit evaluation of sparsification, compression, and approximation error trade-offs.
Proves the ground state energy of quantum p-spin Hamiltonians achievable by product states converges to a limit expressed via Parisi-type variational formula. Establishes universality across non-Gaussian interaction distributions.
IonQ demonstrated two quantum computing advances: a 14.6% speedup for industrial simulations with Synopsys, and a generative AI method reducing quantum circuit optimization time from 11+ minutes to 28 seconds.