Nov 2026· Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Quantum Computing and Quantum-Inspired Technologies for Spatial Data Systems and Applications· pp. 1-8· 0 citations· 4 references
TL;DR
This paper proposes the Quantum Geometry® Grand Challenge, a five-year prize and benchmark program for quantum and hybrid quantum–classical methods in computational geometry, computer-aided design, computer-aided design, geographic information science, and meshing.
Abstract
This paper proposes the Quantum Geometry® Grand Challenge, a five-year prize and benchmark program for quantum and hybrid quantum–classical methods in computational geometry, computer-aided design (CAD), geographic information science (GIS), and meshing. The central question is where, if anywhere, quantum computation improves a complete geometric workflow. Comparisons would include data preparation, encoding, execution, and output validation. The program would begin by defining benchmarks, without requiring an initial demonstration of quantum advantage. A proposed 2027 pilot would select a small number of spatial-optimization and mesh-partitioning problems and publish classical reference solvers and independent validators. Separate award categories would recognize reproducible positive and negative findings. Two illustrative problems show how the evaluation would work. The paper sets out submission requirements, comparison metrics, judging safeguards, and a staged expansion to CAD, geometric algorithms, and data representations. Quantum Geometry® LLC would initially administer the program and offer conditional founding matching support of up to $100,000 over five years. Expansion would depend on secured resources and independently reproducible pilot results. The contribution is a research-program design that can be tested and evaluation resources that others can reuse; it is not a claim of demonstrated quantum advantage.
We revisit an established Quantum Control objective, characterize its exact local metric geometry, and reposition it as a rigorous benchmark for Search and Optimization. The trap-free topology of the landscape, established two decades ago, guarantees unhindered optimal pathways, but global topology alone does not gover...
Density Functional Theory (DFT) is the established workhorse of computational materials science, yet it faces fundamental challenges with strongly correlated electrons, such as in transition metal complexes and bond-breaking processes. While quantum computing offers a theoretically exact path to resolve these problems,...
Y. Pouillon, F. Marchesin, I. Tavernelli et al.· 0 citations
The Minimum Birkhoff Decomposition (MBD) seeks a sparse weighted sum of matchings and is a challenging optimization problem with applications in network scheduling and energy trading. We scale a quantum-assisted decomposition method by combining single-layer QAOA sampling with Extended Fully-Corrective Frank-Wolfe (E-F...
Amana Liaqat, Ahmed Darwish, Stephen Diadamo et al.· 0 citations
Quantum computer deployment in space remains constrained by demanding hardware, environmental, and communications requirements. This paper reviews the opportunities and challenges of using quantum computing in space systems. It focuses on payload integration, radiation protection, quantum-memory stability, autonomous h...
Quantum computing offers a promising route for electronic-structure calculations, but practical condensed-matter applications often require solving large families of related Hamiltonians arising from $\mathbf{k}$-point sampling, compositional variation, defects, and changes in system size. Here, we develop strategies f...
Saurabh Shivpuje, Vinit Singh, Manas Sajjan et al.· 0 citations
Quantum computing offers a promising approach to non-perturbative simulations of quantum field theories, particularly for real-time dynamics and systems affected by the sign problem. Yet translating continuum field theories into quantum computations remains a challenging interdisciplinary task. Here we introduce \textt...
Xiao-Lin Wang, Xing-Yu Guo, Jin-Yang Li et al.· 0 citations