Related papers: Optical resonators constitute a universal spin sim…
This paper proposes an algorithmic method to heuristically solve the famous Travelling Salesman Problem (TSP) when the salesman's path evolves in continuous state space and discrete time but with otherwise arbitrary (nonlinear) dynamics.…
We present a physics inspired heuristic method for solving combinatorial optimization problems. Our approach is specifically motivated by the desire to avoid trapping in metastable local minima- a common occurrence in hard problems with…
We discuss the problem of spin-orbit interaction in a 2D chaotic or diffusive quantum dot in the presence of exchange correlations. Spin-orbit scattering breaks spin rotation invariance, and in the crossover regime between different…
We review a recent theoretical proposal for a universal quantum computing platform based on tunable nonlinear electromechanical nano-oscillators, in which qubits are encoded in the anharmonic vibrational modes of mechanical resonators…
We develop a fourth-order Magnus expansion based quantum algorithm for the simulation of many-body problems involving two-level quantum systems with time-dependent Hamiltonians, $\mathcal{H}(t)$. A major hurdle in the utilization of the…
We develop a universal approach enabling the study of any multimode quantum optical system evolving under a quadratic Hamiltonian. Our strategy generalizes the standard symplectic analysis and permits the treatment of multimode systems even…
This paper presents a comprehensive numerical framework for simulating radiation-plasma systems. The radiative transfer process spans multiple flow regimes due to varying fluid opacity across different regions, necessitating a robust…
This paper proposes a novel approach to Hamiltonian simulation using Decision Diagrams (DDs), which are an exact representation based on exploiting redundancies in representations of quantum states and operations. While the simulation of…
The irreps $(SU(2),{\cal H},U)$ of SU(2) of dimension $(2S+1)^N$, i.e. operators acting on the space ${\cal H}={\cal H}_N={\bf C}^{(2S+1)^N}$ of $N$ identical particles with spin $S$, are described by Clebsch-Gordan decomposition into…
Estimating simulation-ready scenes from real-world observations is crucial for downstream planning and policy learning tasks. Regretfully, existing methods struggle in cluttered environments, often exhibiting prohibitive computational cost,…
Realistic and controllable simulation is critical for advancing end-to-end autonomous driving, yet existing approaches often struggle to support novel view synthesis under large viewpoint changes or to ensure geometric consistency. We…
We consider the state determination problem using Mutually Unbiased Bases(MUBs). For spin-1, spin-3/2 and spin-2 systems, analogous to Pauli operators of spin-1/2 system, which are experimentally implementable and correspond to the optimum…
As robotic systems increasingly operate in unstructured, cluttered, and previously unseen environments, there is a growing need for manipulators that combine compliance, adaptability, and precise control. This work presents a real-time…
We present general methods for simulating black-box Hamiltonians using quantum walks. These techniques have two main applications: simulating sparse Hamiltonians and implementing black-box unitary operations. In particular, we give the best…
It is possible to simulate the dynamics of a single spin-$1/2$ ($\mathsf{PT~}$ symmetric) system by conveniently embedding it into a subspace of a larger Hilbert space with unitary dynamics. Our goal is to formulate a many body…
We present a continuous nonlinear optimization model for the Spin Glass Problem (SGP), building on a classical result by Rosenberg (1972), which shows that for a class of multilinear polynomial problems the optimal values of the continuous…
We investigate the feasibility of simulating different model Hamiltonians used in high-temperature superconductivity. We briefly discuss the most common models and then focus on the simulation of the so-called t-J-U Hamiltonian using…
We provide a simple algorithm for constructing Hamiltonian graph cycles (visiting every vertex exactly once) on a set of arbitrarily large finite subgraphs of aperiodic two-dimensional Ammann-Beenker (AB) tilings. Using this result, and the…
In the last two decades, significant effort has been put in understanding and designing so-called structure-preserving numerical methods for the simulation of mechanical systems. Geometric integrators attempt to preserve the geometry…
We investigate the power of quantum systems for the simulation of Hamiltonian time evolutions on a cubic lattice under the constraint of translational invariance. Given a set of translationally invariant local Hamiltonians and short range…