Israeli trapped-ion quantum computing developer Quantum Art has published the theoretical and mathematical foundations underpinning its wave-simulation framework in a research preprint titled “Solving wave propagation problems via geometric quantum state preparation on dispersion manifolds. The research expands upon the company’s initial May 2026 electromagnetic demonstration with an Israeli government agency, establishing that the solver applies across general hyperbolic physical systems—including acoustics, seismic geophysics, radar propagation, and structural stress analysis.
Simulating steady-state wave propagation across expansive geometries at fine resolution represents a classical supercomputing bottleneck. While Quantum Linear System Solvers (QLSS)—such as the Harrow-Hassidim-Lloyd (HHL) algorithm and Quantum Singular Value Transformation (QSVT)—can theoretically compress spatial degrees of freedom exponentially, their runtime scales at least linearly with the matrix condition number κ(A). Because κ(A) scales as O(N2/d) for discretized differential operators on an N-point grid in d dimensions, standard QLSS implementations lose their exponential quantum advantage. Quantum Art circumvents matrix inversion entirely by recasting the problem into geometric quantum state preparation directly on the wave equation’s resonant dispersion manifold.
| [ Quantum Art Wave Solver: Algorithmic Architecture & Resource Scaling ] | ||
|---|---|---|
| Algorithmic Dimension | Standard QLSS / Generic Inversion | Quantum Art Geometric Manifold Approach |
| • Mathematical Formulation | • Discretized Helmholtz equation matrix inversion via HHL / QSVT. | • Direct quantum state preparation on resonant dispersion surface k2 = ω2 / c2 with Fourier phase encoding. |
| • Condition-Number Scaling | • Governed by κ(A) = O(N2/d); exponential quantum advantage lost as grid size expands. | • Independent of domain size and grid spacing; avoids condition-number limits via analytical Fourier diagonalization. |
| • Post-Selection Overhead | • Decays exponentially with volume ratio between resonant surface and full Fourier space. | • Scales strictly as Psucc ∼ 1/Ns, where Ns is the number of emitter sources (constant for fixed sources). |
| • Gate & Circuit Complexity | • High-degree polynomial scaling in matrix dimensions and condition number. | • Total two-qubit gate and T-gate complexity bounded by O(n2) for an n-qubit coordinate register. |
| • Required Qubit Scale | • Thousands of fault-tolerant qubits for deep matrix inversion circuits. | • ~100 logical qubits represent 1018 to 1021 classical grid points (3D domain over tens of km). |
Direct State Preparation on Resonant Dispersion Surfaces
In the frequency domain, monochromatic wave fields satisfy the Helmholtz equation (ω2/c2 + ∇2)u = f. In Fourier space, the differential operator diagonalizes to ω2/c2 − k2. However, because the inverse operator develops a singularity on the physical dispersion manifold where k2 = ω2/c2, standard quantum arithmetic methods that prepare the entire Fourier space and attempt to post-select valid states face an exponential drop in success probability as the Fourier volume grows.
Quantum Art resolves this by constructing the quantum register directly on the resonant surface. Drawing on a quantum analogue of the Midpoint circle (Bresenham) computer graphics algorithm, the circuit evaluates a quantum square-root routine to initialize an equal superposition over a narrow ring (or spherical shell in 3D) around the dispersion manifold. Once the resonant manifold is prepared, source locations (xj, yj) are imprinted as phase shifts via controlled phase rotations.
Because the state is confined to the physical dispersion ring from the outset, the post-selection success probability becomes independent of the computational domain size. Instead, success depends only on the number of discrete wave sources (Psucc ∼ 1/Ns), introducing only a constant-factor repetition overhead for applications with localized emitters.
Hardware Mapping: Trapped-Ion Architecture and Resource Projections
The total computational complexity of the algorithm is dominated by the quantum arithmetic required for square-root and reciprocal subroutines, resulting in an overall asymptotic two-qubit and T-gate complexity of O(n2). Total qubit workspace is bounded by 5n for an n-bit coordinate register.
According to the authors’ resource estimates, modeling a three-dimensional high-frequency wave field spanning tens of kilometers at centimeter-scale resolution requires roughly 1018 to 1021 classical grid points—a volume that exceeds the working memory of modern supercomputers. Under Quantum Art’s geometric encoding, that exact volume maps onto approximately 100 logical qubits.
Quantum Art plans to execute these circuits using its native trapped-ion hardware architecture. By leveraging reconfigurable ion transport and native multi-qubit entangling gates, the company aims to compress circuit depth and minimize gate error accumulation compared to standard two-qubit decomposition schemes on early fault-tolerant systems.
Read the research preprint on the arXiv repository here and review the commercial announcement via PR Newswire here.
In GQI Portal
The players behind the news
The team that writes QCR tracks every company, deal and technology in the GQI Factory, GQI's verified database of the quantum industry. Next up: every story linked to its players, coming to QCR's paid plans.
- Players Companies and institutions across the quantum industry, by segment.
- Scorecards How the players compare on hardware, software, funding and more.
Newsletter
QCR Alerts in your inbox
The latest reporting and analysis from Quantum Computing Report. Free, unsubscribe any time.