Designing quantum optical experiments requires searching over discrete circuit topologies and continuous parameters, often with multiple realizations of the same target state. Graph-based methods commonly address this problem by optimizing a dense graph and pruning it toward a single circuit. We introduce \texttt{Grinch}, a bottom-up reward-driven generative framework that learns to sample optical graphs directly from fidelity-based rewards without relying on a pre-existing training dataset. We demonstrate the framework on multipartite entangled states, graph and cluster states, and nonlocal photonic-gate targets, obtaining multiple high-fidelity optical graphs. We identify asymptotic solutions for states that cannot be generated exactly by graphs, as well as nonlocal Toffoli gate constructions requiring two ancillas. Our work presents hardware-constraint objectives, which lead to alternative constructions of CNOT and Toffoli gates when connections between ancilla nodes are restricted. These findings illustrate a reward-driven approach to quantum optical inverse design, exploring alternative circuit topologies while directly incorporating connectivity constraints into the search process.
Fast control of long-lived quantum registers often relies on an auxiliary degree of freedom, a mediator, but real mediator excitation can introduce decoherence, leakage, or loss when the mediator is not the coherence-optimized component. We introduce dispersive interaction via analytical linear inversion (DIAL), an analytical control construction for excitation-suppressed interaction engineering in mediator-coupled quantum registers. In the dispersive regime, we show that off-resonant driving of an effective two-level mediator transition yields a diagonal Hamiltonian whose Pauli-
Z interaction rates depend linearly on the drive intensities through a transfer matrix determined by the register-resolved transition spectrum. This establishes a direct linear map from experimentally accessible controls to induced multi-qubit interactions, enabling control design without iterative propagation of the full driven dynamics. We turn this structure into the target-aware DIAL algorithm, which selects favorable off-resonant tones and determines their drive intensities for a prescribed target interaction. We benchmark the resulting controls across 100 register realizations for each register size
n=2,3,4,5, targeting the highest-order interaction
Z1⋯Zn with an interaction phase of magnitude
π/4, which generates an
n-qubit GHZ state up to local equivalence. Propagation under the full driven mediator-register dynamics yields typical gate fidelities above
0.997, while the maximum transient mediator excitation remains near
1% on average, far below what is typically possible with resonant Rabi drives. The manuscript is accompanied by an open-source Python package implementing the target-aware DIAL algorithm and the associated numerical validation workflow.
Recent publications have introduced the concept of quantum-like (QL) bits, along with their associated QL-states and QL-gate operations, emerging from the dynamics of complex synchronized networks. The present work builds on this framework to present a simulation of quantum dynamics in spin systems. We focus on the transverse field Ising model, a widely studied Hamiltonian for interacting spin systems. We show how circuits, built using the QL analog of quantum gates, can be used to prepare an arbitrary initial wavepacket and simulate the time evolution of the resulting state for extracting physical observables such as magnetization. Beyond the statevector dynamics, we introduce a set of metrics that characterize how QL-circuit operations transform the underlying graph connections. These metrics quantify the microscopic coupling, phase coherence, and effective inter-block coupling generated by the circuit. These graph-level quantities provide constraints and design targets for potential physical implementations, indicating where interconnection resources, phase control, and effective coupling strength must be engineered in a hardware realization. Overall, this study demonstrates how classical resources can be harnessed to simulate quantum systems and we discuss the advantages and limitations.