Genesis: A Compiler for Hamiltonian Simulation on Hybrid CV-DV Quantum Computers

2025-06-20 · 1 citations

Monte Carlo Qudit Stabilizer Sampling with Pauli Frames

2025-08-30

We demonstrate that Pauli frames, a mathematical object used to efficiently sample qubit stabilizer circuits, can be used to efficiently sample qudit circuits of any prime dimension. Quantum error correcting codes are a central object of study in fault-tolerance quantum computing, which is necessary to realize useful universal quantum computing. Stabilizer codes belong to a large class of well-understood quantum codes that are crucially efficiently simulable on classical hardware using the so-called tableau representation. Popular simulation software like Stim exclusively studies and characterizes qubit codes, which entails repeatedly sampling a noisy quantum circuit with Pauli frames. We highlight the key differences (and fundamental similarities) between qubit and qudit stabilizer tableaus. It then teaches how Pauli frames generate batches of samples given a qudit tableau via two guided examples: one with a random measurement outcome but no noise, and one with a single noise gate.

Qubit Movement-Optimized Program Generation on Zoned Neutral Atom Processors

2025-02-22 · 4 citations

A zoned neutral atom architecture achieves exceptional fidelity by segregating the execution spaces of 1- and 2-qubit gates, being a promising candidate for high-accuracy quantum systems. Unfortunately, na'ively applying programs designed for static qubit topologies to zoned architectures may result in most execution time being consumed by intra-zone travels of atoms. To address this, we introduce Mantra (Minimizing trAp movemeNts for aTom aRray Architectures), which rewrites quantum programs to reduce the interleaving of single- and two-qubit gates. Mantra incorporates three strategies: (i) a fountain-shaped controlled-Z (CZ) chain, (ii) ZZ-interaction protocol without a 1-qubit gate, and (iii) preemptive gate scheduling. Mantra reduces inter-zone movements by 68%, physical gate counts by 35%, and improves circuit fidelities by 17% compared to the standard executions.

Genesis: A Compiler Framework for Hamiltonian Simulation on Hybrid CV-DV Quantum Computers

ArXiv.org · 2025-05-19

This paper introduces Genesis, the first compiler designed to support Hamiltonian Simulation on hybrid continuous-variable (CV) and discrete-variable (DV) quantum computing systems. Genesis is a two-level compilation system. At the first level, it decomposes an input Hamiltonian into basis gates using the native instruction set of the target hybrid CV-DV quantum computer. At the second level, it tackles the mapping and routing of qumodes/qubits to implement long-range interactions for the gates decomposed from the first level. Rather than a typical implementation that relies on SWAP primitives similar to qubit-based (or DV-only) systems, we propose an integrated design of connectivity-aware gate synthesis and beamsplitter SWAP insertion tailored for hybrid CV-DV systems. We also introduce an OpenQASM-like domain-specific language (DSL) named CVDV-QASM to represent Hamiltonian in terms of Pauli-exponentials and basic gate sequences from the hybrid CV-DV gate set. Genesis has successfully compiled several important Hamiltonians, including the Bose-Hubbard model, $\mathbb{Z}_2-$Higgs model, Hubbard-Holstein model, Heisenberg model and Electron-vibration coupling Hamiltonians, which are critical in domains like quantum field theory, condensed matter physics, and quantum chemistry. Our implementation is available at Genesis-CVDV-Compiler(https://github.com/ruadapt/Genesis-CVDV-Compiler).

Sdim: A Qudit Stabilizer Simulator

ArXiv.org · 2025-11-16

Quantum computers have steadily improved over the last decade, but developing fault-tolerant quantum computing (FTQC) techniques, required for useful, universal computation remains an ongoing effort. Key elements of FTQC such as error-correcting codes and decoding are supported by a rich bed of stabilizer simulation software such as Stim and CHP, which are essential for numerically characterizing these protocols at realistic scales. Recently, experimental groups have built nascent high-dimensional quantum hardware, known as qudits, which have a myriad of attractive properties for algorithms and FTQC. Despite this, there are no widely available qudit stabilizer simulators. We introduce the first open-source realization of such a simulator for all dimensions. We demonstrate its correctness against existing state vector simulations and benchmark its performance in evaluating and sampling quantum circuits. This simulator is the essential computational infrastructure to explore novel qudit error correction as earlier stabilizer simulators have been for qubits.

A Case for Quantum Circuit Cutting for NISQ Applications: Impact of topology, determinism, and sparsity

arXiv (Cornell University) · 2024-12-23

We make the case that variational algorithm ansatzes for near-term quantum computing are well-suited for the quantum circuit cutting strategy. Previous demonstrations of circuit cutting focused on the exponential execution and postprocessing costs due to the cuts needed to partition a circuit topology, leading to overly pessimistic evaluations of the approach. This work observes that the ansatz Clifford structure and variational parameter pruning significantly reduce these costs. By keeping track of the limited set of correct subcircuit initializations and measurements, we reduce the number of experiments needed by up to 16x, matching and beating the error mitigation offered by classical shadows tomography. By performing reconstruction as a sparse tensor contraction, we scale the feasible ansatzes to over 200 qubits with six ansatz layers, beyond the capability of prior work.

Tetris: A Compilation Framework for VQA Applications in Quantum Computing

2024-06-29 · 9 citations

Quantum computing has shown promise in solving complex problems by leveraging the principles of superposition and entanglement. Variational quantum algorithms (VQA) are a class of algorithms suited for near-term quantum computers due to their modest requirements of qubits and depths of computation. This paper introduces Tetris – a compilation framework for VQA applications on near-term quantum devices. Tetris focuses on reducing two-qubit gates in the compilation process since a two-qubit gate has an order of magnitude more significant error and execution time than a single-qubit gate. Tetris exploits unique opportunities in the circuit synthesis stage often overlooked by the state-of-the-art VQA compilers for reducing the number of two-qubit gates. Tetris comes with a refined IR of Pauli string to express such a two-qubit gate optimization opportunity. Moreover, Tetris is equipped with a fast bridging approach that mitigates the hardware mapping cost. Overall, Tetris demonstrates a reduction of up to $41.3 \%$ in CNOT gate counts, $37.9 \%$ in circuit depth, and $\mathbf{4 2. 6 \%}$ in circuit duration for various molecules of different sizes and structures compared with the state-of-the-art approaches. Tetris is open-sourced at this link.

Automated Modal Identification and Tracking of a Cable-Stayed Bridge with p_LSCF

Experimental Techniques · 2024-11-06 · 2 citations

ComposerX: Multi-Agent Symbolic Music Composition with LLMs

arXiv (Cornell University) · 2024 · 6 citations

• Computer Science
• Computer Science
• Literature

Music composition represents the creative side of humanity, and itself is a complex task that requires abilities to understand and generate information with long dependency and harmony constraints. While demonstrating impressive capabilities in STEM subjects, current LLMs easily fail in this task, generating ill-written music even when equipped with modern techniques like In-Context-Learning and Chain-of-Thoughts. To further explore and enhance LLMs' potential in music composition by leveraging their reasoning ability and the large knowledge base in music history and theory, we propose ComposerX, an agent-based symbolic music generation framework. We find that applying a multi-agent approach significantly improves the music composition quality of GPT-4. The results demonstrate that ComposerX is capable of producing coherent polyphonic music compositions with captivating melodies, while adhering to user instructions.

Bridge scour monitoring based on active heating and temperature measurement method

Structural Health Monitoring · 2024-10-04 · 1 citations

Bridge scour has always been one of the main threats to bridge safety. Since bridge collapse caused by scour occurs relatively sudden, it is necessary to monitor the scour of bridge piers in real-time and take effective measures in time for the locations where bridge scour is serious. Therefore, a bridge scour monitoring method based on active heating and temperature measurement was proposed in this paper. The method uses heating cables and DS18B20 sensors to make active heating and temperature measurement cables, arranges the cables around the bridge piers, and realizes real-time positioning of bridge scour depth and water level height by analyzing the temperature distributions along the cables. The feasibility of this method for monitoring bridge scour was verified through finite element simulation and experimental testing. The simulation and test results are basically consistent, and the results prove that the method can effectively monitor bridge scour, and has advantages such as low cost, easy installation, and accurate positioning.