arXiv AI By Debanjan Konar, Zain Hafeez, Vaneet Aggarwal

A Bi-directional Multi-solution Scalable Grover Search Algorithm

Read the original on arXiv AI →

arXiv:2404. 15616v2 Announce Type: replace-cross Abstract: Grover's search algorithms, including various Partial Grover Searches (PGS), suffer from scaling issues when multiple solutions are sought, as the number of iterations scales with the number of solutions or marked states, making implementation more computationally expensive.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 7

LLM-Driven Algorithm Design for Quantum Circuit Synthesis based on Binary Decision Diagrams

The paper introduces QuantumEvo, an evolutionary framework that employs a large language model (LLM) to generate heuristics for ordering variables in binary decision diagrams (BDDs) used in reversible quantum circuit synthesis. By searching over heuristic families and directly manipulating BDD variable orderings, QuantumEvo produces the HGA-QE heuristic, which modifies the sifting step of a genetic algorithm to better align with quantum circuit cost (QCC). Across benchmark sets, HGA-QE achieves a 70.9% tie-or-win rate against the best per-function baseline and strictly outperforms it on 13.5% of functions, demonstrating competitive QCC performance and a clear advantage on benchmarks from different data sources.

By Yoonju Sim, Federico Berto, Chuanbo Hua, Jinkyoo Park, Changhyun Kwon
arXiv Computation and Language
6d ago

Cross-Backend QIEO: Universal Runtime Portability across OpenMP5, CUDA, HIP, and Multi-Language Interfaces

Cross-Backend QIEO is a runtime core for quantum-inspired evolutionary optimization that unifies execution across OpenMP5, CUDA, HIP, and multiple high-level languages. It compiles a single C++ implementation per hardware target and dispatches to CPU, multi-core, NVIDIA, or AMD backends at runtime, adapting kernels to each device’s memory hierarchy. The framework is validated with real-world bindings: a Python neural‑network hyperparameter optimizer achieving 88.60 % MNIST accuracy, a MATLAB wind‑farm layout optimizer matching particle swarm results and outperforming genetic algorithms, and a Julia package that reduces mean SSE by 2.1× in Lotka–Volterra parameter estimation.

By Aman Mittal, Ferdin Sagai Don Bosco, Kasturi Venkata Srikanth, Abhishek Singh, Aditya Singh, Abhishek Chopra
arXiv Machine Learning
Aug 10

Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates

arXiv:2608. 06762v1 Announce Type: new Abstract: Bisimulation metrics quantify behavioral similarity in Markov decision processes, but their Wasserstein fixed-point operator updates every state pair and incurs quadratic pairwise work.

By Ibne Farabi Shihab, Joyanta Jyoti Mondal