Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A Modular Quantum Emulator for Multi-Step Fermionic Catalysis: Eliminating the Jordan-Wigner Bottleneck via Qudit Encoding

Santos C. Borom

Published Jul 16, 2026• 0 citations
Publisher

Abstract

(Dated: July 14, 2026) Simulating the dynamical trajectories of complex metalloenzymes, such as the nitrogenase FeMo-cofactor, remains classically intractable due to real-time entanglement growth and non-adiabatic surface crossings. Here, we introduce the Modular Quantum Emulator (MQE), a polynomialcomplexity quantum architecture designed for the chemically accurate emulation of multi-step fermionic catalysis. The MQE employs a universal four-dimensional qudit encoding that natively absorbs fermionic exchange signs. This entirely eliminates the Jordan-Wigner parity string bottleneck, reducing the entangling gate count from quartic to quadratic scaling. To track multi-step stoichiometry, the emulator utilizes a dual-manifold design: a logical register for electronic structure and a virtual register for coherent cofactor phase accumulation. We prove a structural isomorphism wherein this virtual register natively functions as the phase clock for Quantum Phase Estimation, enabling exact energy extraction with zero ancilla overhead. Finally, we establish strict polynomial resource bounds for complete catalytic trajectories and demonstrate that the architecture seamlessly accommodates eight systematic physical extensions—including open-system dissipation and relativistic kinematics—without altering its asymptotic complexity class. Validated across seventeen biochemical mechanisms, this framework fundamentally shifts the computational paradigm from static variational minimization to exact, polynomially-bounded dynamical emulation.

DOI
10.26434/chemrxiv.15006143/v1

Related papers

The Modular Quantum Emulator: Chemically Accurate, Polynomial-Cost Simulation of Multi-Step Metalloenzyme Catalysis in a Dissipative Protein Environment

Santos C. Borom

(Dated: July 19, 2026) Quantum algorithms for molecular dynamics propagate a wavepacket through configuration space, while quantum electronic-structure methods return a ground-state energy at one fixed geometry. Neither addresses the object a chemist means by a catalytic mechanism: a closed sequence of identified intermediates linked by proton-coupled electron transfers, non-adiabatic crossings, and a stoichiometric budget that must balance over the turnover. Here we introduce the Modular Quantum Emulator (MQE), a qudit architecture that takes that \emph{ mechanism } as the object of computation. Two registers are carried: a logical register assigning one four-level qudit per spatial orbital, whose states are that orbital's four occupancies, and a single auxiliary register counting cofactor turnover around the cycle. Stoichiometric bookkeeping makes the auxiliary register mandatory, and our central result is that it simultaneously performs four further roles---it is the clock for quantum phase estimation, so energies are extracted with no additional qubits; it shelters idle population from dephasing; it confines environmental coupling, leaving the electronic reduced state exactly unitary under open-system dynamics; and its winding number classifies the mechanism, predicting that a centred two-electron elimination requires a turnover electron count divisible by four, satisfied throughout the nitrogenase family and violated by two- and six-electron cycles. Electron number, phase closure, trace and spin sector are enforced as circuit-level invariants and verified at every step. Because the auxiliary sector is algebraically independent of the electronic Hamiltonian, nuclear quantum effects, relativistic and spin--orbit coupling, open-system dissipation and periodic boundary conditions are absorbed without altering the asymptotic cost. Every gate introduced compiles to the native GPI/GPI2/ZZ pulse set of trapped-ion hardware, the basis changes attaining the KAK lower bound of two entangling operations. Validation of these circuits across seventeen catalytic mechanisms, on chemically relevant active spaces small enough to admit exact reference energies, recovers every stoichiometric invariant and returns twenty-five phase-estimation measurements within 1.6~mHa of the exact result.

•Jul 21, 2026•0 citations

The Modular Quantum Emulator: Chemically Accurate, Polynomial-Cost Simulation of Multi-Step Metalloenzyme Catalysis in a Dissipative Protein Environment

Santos C. Borom

Quantum algorithms for molecular dynamics propagate a wavepacket through configuration space, while quantum electronic-structure methods return a ground-state energy at one fixed geometry. Neither addresses the object a chemist means by a catalytic mechanism: a closed sequence of identified intermediates linked by proton-coupled electron transfers, non-adiabatic crossings, and a stoichiometric budget that must balance over the turnover. Here we introduce the Modular Quantum Emulator (MQE), a qudit architecture that takes that \emph{ mechanism } as the object of computation. Two registers are carried: a logical register assigning one four-level qudit per spatial orbital, whose states are that orbital's four occupancies, and a single auxiliary register counting cofactor turnover around the cycle. Stoichiometric bookkeeping makes the auxiliary register mandatory, and our central result is that it simultaneously performs four further roles---it is the clock for quantum phase estimation, so energies are extracted with no additional qubits; it shelters idle population from dephasing; it confines environmental coupling, leaving the electronic reduced state exactly unitary under open-system dynamics; and its winding number classifies the mechanism, predicting that a centred two-electron elimination requires a turnover electron count divisible by four, satisfied throughout the nitrogenase family and violated by two- and six-electron cycles. Electron number, phase closure, trace and spin sector are enforced as circuit-level invariants and verified at every step. Because the auxiliary sector is algebraically independent of the electronic Hamiltonian, nuclear quantum effects, relativistic and spin--orbit coupling, open-system dissipation and periodic boundary conditions are absorbed without altering the asymptotic cost. Every gate introduced compiles to the native GPI/GPI2/ZZ pulse set of trapped-ion hardware, the basis changes attaining the KAK lower bound of two entangling operations. Validation of these circuits across seventeen catalytic mechanisms, on chemically relevant active spaces small enough to admit exact reference energies, recovers every stoichiometric invariant and returns twenty-five phase-estimation measurements within 1.6~mHa of the exact result.

•Aug 10, 2026•0 citations

Accelerating Multidimensional Quantum Factoring: Sub-O(n^(3/2)) Gate Regimes, 4n-Qubit Streamed Estimation, and Unconditional Correctness

Denis Gnitiyov

Abstract: Oded Regev's multidimensional quantum factoring algorithm (J. ACM 2025) reduced the sequential quantum circuit depth of factoring from Shor's algorithm down to square-root-of-n modular squarings, requiring O(n^(1.5)) quantum gates per run across O(sqrt(n)) runs. However, four fundamental bottlenecks remained: (1) an exponential LLL lattice-reduction loss that inflated the quantum Gaussian radius and tripled the required squarings; (2) a high qubit memory footprint, where reversible uncomputation required storing large intermediate states or suffering huge time penalties; (3) holding all input dimensions in quantum memory required large coherent registers; and (4) mathematical correctness depended on an unproven heuristic assumption on short lattice vectors. We present a unified quantum-classical architecture that resolves these bottlenecks and establishes new complexity frontiers for quantum factorization: (1) Lattice Post-Processing Overhaul: By replacing LLL with polynomial-time Block Korkine-Zolotarev (BKZ) reduction and quantum sample amplification, we eliminate the exponential transference loss, shrinking the Gaussian radius exponent by 3x and cutting critical-path modular depth by 6x through Windowed Horizon Aggregation. (2) Pebbling-Free Dual-Inverse Arithmetic: By integrating radius compression into dual-inverse Zeckendorf-Fibonacci reversible arithmetic, we eliminate intermediate storage checkpoints with zero time penalty, reducing total memory to approximately 7.44n qubits. (3) Streamed Estimation in 4n Qubits: Combining radius compression with streamed backwards Fibonacci quantum phase estimation shrinks the required ladder depth by 3x, executing the entire attack on a recycled control register using only 4n coherent qubits (or 3n qubits with in-place arithmetic). For RSA-2048, this cuts continuous coherence runtime from 8.0 hours down to 8.2 minutes (a 58x speedup over Shor's algorithm). (4) Sub-O(n^(1.5)) Gate Frontier: We prove an Arithmetic-Geometric Mean (AM-GM) transference lower bound showing that unstructured lattices cannot break below n^(1.5) gates in polynomial classical time, and circumvent this barrier for smooth-quotient composite moduli using a block-projected pipeline to achieve O(n^(4/3) log n) quantum gates. (5) Unconditional Correctness: Using Cedric Pilatte's analytic number theory framework (zero-density estimates and p-torsion stabilization), we unconditionally prove that the lattice algorithm factors any composite number N in strictly polynomial classical time with single-batch success probability of at least 31.25% (approaching 37.5%). Under the Generalized Riemann Hypothesis, factoring requires only 4n qubits and small prime bases. --- AI Research and Authorship Disclosure: In full accordance with international scientific disclosure standards, open-access repository guidelines on AI-assisted research, and ACM/IEEE policies on generative artificial intelligence, the provenance, governance, and execution of this work are delineated as follows: 1. Conceptual Initiative, Research Vision, and Workflow Direction (Denis Gnitiyov):The foundational research initiative to achieve this breakthrough was conceived and launched by Denis Gnitiyov upon studying Oded Regev's multidimensional quantum factoring framework. Acknowledging that the high-level advanced mathematics (higher-dimensional lattice geometry, analytic number theory, and fault-tolerant quantum circuit synthesis) exceeds manual human calculation, Denis Gnitiyov conceived the project vision, established the initiative to systematically eliminate the theoretical and physical bottlenecks of the Regev paradigm, directed the multi-LLM research workflow, and maintained supervisory governance over the end-to-end scientific pipeline. 2. Paper Architecture, Bottleneck Formulation, and Orchestration (Gemini Flash 3.8):Gemini Flash 3.8 served as the paper builder, systems architect, and research orchestrator. Operating under Denis Gnitiyov's initiative, Gemini Flash 3.8 ingested and dissected Regev's multidimensional factoring research, systematically analyzed the theoretical framework to identify and formulate the four foundational bottlenecks, structured the overarching modular paper architecture, formulated the specific mathematical target problems to be solved, and handled the complete synthesis, typesetting, and mathematical structuring of the LaTeX manuscript. 3. Advanced Mathematical Discovery, Derivations, and Proof Engineering (Gemini Argon 4):Gemini Argon 4 served as the primary mathematical reasoning and discovery engine. In response to the technical bottlenecks and problem formulations established by Gemini Flash 3.8, Gemini Argon 4 derived the formal mathematical proofs and quantum circuit synthesis, including lattice transference separation under BKZ, the AM-GM transference barrier and smooth-quotient algorithm, Pilatte's unconditional p-torsion bounds, and reversible Zeckendorf-Fibonacci arithmetic.

•Oct 17, 2026•0 citations

Simulating Chemical Dynamics on Analog Quantum Computers

V. C. Olaya-Agudelo

Accurately simulating molecular dynamics during chemical reactions remains a central challenge in computational chemistry. These processes are inherently quantum mechanical, involving coupled electronic and nuclear motion and non-adiabatic effects. A fully quantum description is therefore required, yet the associated computational cost grows exponentially with system size. Even with modern supercomputers, storing and evolving a molecular wavefunction rapidly becomes intractable, limiting exact simulations of chemical dynamics. Quantum simulation offers a promising alternative by using controllable quantum systems to directly reproduce molecular dynamics. However, fully digital, qubit-based approaches remain impractical for chemistry due to limited qubit numbers, coherence times, and gate fidelities. This motivates the exploration of more resource-efficient quantum architectures. In this thesis, we demonstrate that mixed-qudit-boson (MQB) quantum simulators provide a practical platform for simulating chemical dynamics in the quantum regime. In MQB devices, multilevel qudits encode electronic states while bosonic modes natively represent vibrational degrees of freedom, avoiding costly qubit encodings of nuclear motion and substantially reducing resource requirements. The thesis makes three main contributions. First, it reports the direct observation of geometric-phase interference in non-adiabatic dynamics using an MQB simulation of the Jahn–Teller model. Second, it extends the MQB framework to open-system chemical dynamics through programmable Lindblad dissipation. Third, it presents a resource analysis showing that MQB simulators can reduce resource costs by several orders of magnitude relative to qubit-only approaches. Together, these results establish MQB quantum simulators as a promising route for studying chemical dynamics beyond the reach of classical computation.

•Jan 1, 2026•0 citations

Quantum computing enhanced computational catalysis

Vera von Burg, Guang Hao Low, Thomas Häner +4 more

The quantum computation of electronic energies can break the curse of dimensionality that plagues manyparticle quantum mechanics.It is for this reason that a universal quantum computer has the potential to fundamentally change computational chemistry and materials science, areas in which strong electron correlations present severe hurdles for traditional electronic structure methods.Here we present a state-of-the-art analysis of accurate energy measurements on a quantum computer for computational catalysis, using improved quantum algorithms with more than an order of magnitude improvement over the best previous algorithms.As a prototypical example of local catalytic chemical reactivity we consider the case of a ruthenium catalyst that can bind, activate, and transform carbon dioxide to the high-value chemical methanol.We aim at accurate resource estimates for the quantum computing steps required for assessing the electronic energy of key intermediates and transition states of its catalytic cycle.In particular, we present quantum algorithms for double-factorized representations of the four-index integrals that can significantly reduce the computational cost over previous algorithms, and we discuss the challenges of increasing active space sizes to accurately deal with dynamical correlations.We address the requirements for future quantum hardware in order to make a universal quantum computer a successful and reliable tool for quantum computing enhanced computational materials science and chemistry, and identify open questions for further research.

arXiv:2007.14460•Physical Review Research•Jul 16, 2021•321 citations

The HALO Engine: $\mathcal{O}(1)$-Step Compilation and Localized String Rupture for Lattice Gauge Theories on Quantum Hardware

Abhiroop Gohar

Simulating real-time dynamics in lattice gauge theories (LGTs) is severely constrained by the circuit depth overhead of standard fermion-to-qubit mappings, which scale linearly or quadratically with system size. To overcome this depth-scaling bottleneck, we introduce the Hardware-Aware Lattice Optimization (HALO) compiler, an architecture executing global time-evolution in an immutable $\mathcal{O}(1)$ circuit depth per Trotter step. By natively mapping composite gauge links to hardware topologies, HALO achieves a $91.36\%$ reduction in entangling gate overhead compared to unoptimized Jordan-Wigner baselines, compressing a 16-qubit global step to 56 CNOTs and bypassing extensive $\mathcal{O}(N)$ scaling limits. We validate this compiler on IBM superconducting transmon processors by simulating the mesoscopic Quantum Link Model (QLM) truncation of the Schwinger model. Coupling $\mathcal{O}(1)$ compilation with Zero-Noise Extrapolation (ZNE), we track localized string rupture, extracting the dynamical crossover of pair creation at $t \approx 0.790$ with an $18.3 \pm 2.2\%$ rupture probability. Furthermore, we map the dynamical phase diagram, identifying the confinement phase boundary at $g_c = 1.0$. Finally, we introduce a scalable 2D unit-cell blueprint, paving a direct pathway toward the fault-tolerant simulation of two-dimensional Quantum Chromodynamics (QCD).

quant-pharXiv:2608.19243•Aug 17, 2026•0 citations
(Dated: July 14, 2026) Simulating the dynamical trajectories of complex metalloenzymes, such as the nitrogenase FeMo-cofactor, remains classically intractable due to real-time entanglement growth and non-adiabatic surface crossings. Here, we introduce the Modular Quantum Emulator (MQE), a polynomialcomplexity quantum architecture designed for the chemically accurate emulation of multi-step fermionic catalysis. The MQE employs a universal four-dimensional qudit encoding that natively absorbs fermionic exchange signs. This entirely eliminates the Jordan-Wigner parity string bottleneck, reducing the entangling gate count from quartic to quadratic scaling. To track multi-step stoichiometry, the emulator utilizes a dual-manifold design: a logical register for electronic structure and a virtual register for coherent cofactor phase accumulation. We prove a structural isomorphism wherein this virtual register natively functions as the phase clock for Quantum Phase Estimation, enabling exact energy extraction with zero ancilla overhead. Finally, we establish strict polynomial resource bounds for complete catalytic trajectories and demonstrate that the architecture seamlessly accommodates eight systematic physical extensions—including open-system dissipation and relativistic kinematics—without altering its asymptotic complexity class. Validated across seventeen biochemical mechanisms, this framework fundamentally shifts the computational paradigm from static variational minimization to exact, polynomially-bounded dynamical emulation.
(Dated: July 19, 2026) Quantum algorithms for molecular dynamics propagate a wavepacket through configuration space, while quantum electronic-structure methods return a ground-state energy at one fixed geometry. Neither addresses the object a chemist means by a catalytic mechanism: a closed sequence of identified intermediates linked by proton-coupled electron transfers, non-adiabatic crossings, and a stoichiometric budget that must balance over the turnover. Here we introduce the Modular Quantum Emulator (MQE), a qudit architecture that takes that \emph{ mechanism } as the object of computation. Two registers are carried: a logical register assigning one four-level qudit per spatial orbital, whose states are that orbital's four occupancies, and a single auxiliary register counting cofactor turnover around the cycle. Stoichiometric bookkeeping makes the auxiliary register mandatory, and our central result is that it simultaneously performs four further roles---it is the clock for quantum phase estimation, so energies are extracted with no additional qubits; it shelters idle population from dephasing; it confines environmental coupling, leaving the electronic reduced state exactly unitary under open-system dynamics; and its winding number classifies the mechanism, predicting that a centred two-electron elimination requires a turnover electron count divisible by four, satisfied throughout the nitrogenase family and violated by two- and six-electron cycles. Electron number, phase closure, trace and spin sector are enforced as circuit-level invariants and verified at every step. Because the auxiliary sector is algebraically independent of the electronic Hamiltonian, nuclear quantum effects, relativistic and spin--orbit coupling, open-system dissipation and periodic boundary conditions are absorbed without altering the asymptotic cost. Every gate introduced compiles to the native GPI/GPI2/ZZ pulse set of trapped-ion hardware, the basis changes attaining the KAK lower bound of two entangling operations. Validation of these circuits across seventeen catalytic mechanisms, on chemically relevant active spaces small enough to admit exact reference energies, recovers every stoichiometric invariant and returns twenty-five phase-estimation measurements within 1.6~mHa of the exact result.
Quantum algorithms for molecular dynamics propagate a wavepacket through configuration space, while quantum electronic-structure methods return a ground-state energy at one fixed geometry. Neither addresses the object a chemist means by a catalytic mechanism: a closed sequence of identified intermediates linked by proton-coupled electron transfers, non-adiabatic crossings, and a stoichiometric budget that must balance over the turnover. Here we introduce the Modular Quantum Emulator (MQE), a qudit architecture that takes that \emph{ mechanism } as the object of computation. Two registers are carried: a logical register assigning one four-level qudit per spatial orbital, whose states are that orbital's four occupancies, and a single auxiliary register counting cofactor turnover around the cycle. Stoichiometric bookkeeping makes the auxiliary register mandatory, and our central result is that it simultaneously performs four further roles---it is the clock for quantum phase estimation, so energies are extracted with no additional qubits; it shelters idle population from dephasing; it confines environmental coupling, leaving the electronic reduced state exactly unitary under open-system dynamics; and its winding number classifies the mechanism, predicting that a centred two-electron elimination requires a turnover electron count divisible by four, satisfied throughout the nitrogenase family and violated by two- and six-electron cycles. Electron number, phase closure, trace and spin sector are enforced as circuit-level invariants and verified at every step. Because the auxiliary sector is algebraically independent of the electronic Hamiltonian, nuclear quantum effects, relativistic and spin--orbit coupling, open-system dissipation and periodic boundary conditions are absorbed without altering the asymptotic cost. Every gate introduced compiles to the native GPI/GPI2/ZZ pulse set of trapped-ion hardware, the basis changes attaining the KAK lower bound of two entangling operations. Validation of these circuits across seventeen catalytic mechanisms, on chemically relevant active spaces small enough to admit exact reference energies, recovers every stoichiometric invariant and returns twenty-five phase-estimation measurements within 1.6~mHa of the exact result.
Abstract: Oded Regev's multidimensional quantum factoring algorithm (J. ACM 2025) reduced the sequential quantum circuit depth of factoring from Shor's algorithm down to square-root-of-n modular squarings, requiring O(n^(1.5)) quantum gates per run across O(sqrt(n)) runs. However, four fundamental bottlenecks remained: (1) an exponential LLL lattice-reduction loss that inflated the quantum Gaussian radius and tripled the required squarings; (2) a high qubit memory footprint, where reversible uncomputation required storing large intermediate states or suffering huge time penalties; (3) holding all input dimensions in quantum memory required large coherent registers; and (4) mathematical correctness depended on an unproven heuristic assumption on short lattice vectors. We present a unified quantum-classical architecture that resolves these bottlenecks and establishes new complexity frontiers for quantum factorization: (1) Lattice Post-Processing Overhaul: By replacing LLL with polynomial-time Block Korkine-Zolotarev (BKZ) reduction and quantum sample amplification, we eliminate the exponential transference loss, shrinking the Gaussian radius exponent by 3x and cutting critical-path modular depth by 6x through Windowed Horizon Aggregation. (2) Pebbling-Free Dual-Inverse Arithmetic: By integrating radius compression into dual-inverse Zeckendorf-Fibonacci reversible arithmetic, we eliminate intermediate storage checkpoints with zero time penalty, reducing total memory to approximately 7.44n qubits. (3) Streamed Estimation in 4n Qubits: Combining radius compression with streamed backwards Fibonacci quantum phase estimation shrinks the required ladder depth by 3x, executing the entire attack on a recycled control register using only 4n coherent qubits (or 3n qubits with in-place arithmetic). For RSA-2048, this cuts continuous coherence runtime from 8.0 hours down to 8.2 minutes (a 58x speedup over Shor's algorithm). (4) Sub-O(n^(1.5)) Gate Frontier: We prove an Arithmetic-Geometric Mean (AM-GM) transference lower bound showing that unstructured lattices cannot break below n^(1.5) gates in polynomial classical time, and circumvent this barrier for smooth-quotient composite moduli using a block-projected pipeline to achieve O(n^(4/3) log n) quantum gates. (5) Unconditional Correctness: Using Cedric Pilatte's analytic number theory framework (zero-density estimates and p-torsion stabilization), we unconditionally prove that the lattice algorithm factors any composite number N in strictly polynomial classical time with single-batch success probability of at least 31.25% (approaching 37.5%). Under the Generalized Riemann Hypothesis, factoring requires only 4n qubits and small prime bases. --- AI Research and Authorship Disclosure: In full accordance with international scientific disclosure standards, open-access repository guidelines on AI-assisted research, and ACM/IEEE policies on generative artificial intelligence, the provenance, governance, and execution of this work are delineated as follows: 1. Conceptual Initiative, Research Vision, and Workflow Direction (Denis Gnitiyov):The foundational research initiative to achieve this breakthrough was conceived and launched by Denis Gnitiyov upon studying Oded Regev's multidimensional quantum factoring framework. Acknowledging that the high-level advanced mathematics (higher-dimensional lattice geometry, analytic number theory, and fault-tolerant quantum circuit synthesis) exceeds manual human calculation, Denis Gnitiyov conceived the project vision, established the initiative to systematically eliminate the theoretical and physical bottlenecks of the Regev paradigm, directed the multi-LLM research workflow, and maintained supervisory governance over the end-to-end scientific pipeline. 2. Paper Architecture, Bottleneck Formulation, and Orchestration (Gemini Flash 3.8):Gemini Flash 3.8 served as the paper builder, systems architect, and research orchestrator. Operating under Denis Gnitiyov's initiative, Gemini Flash 3.8 ingested and dissected Regev's multidimensional factoring research, systematically analyzed the theoretical framework to identify and formulate the four foundational bottlenecks, structured the overarching modular paper architecture, formulated the specific mathematical target problems to be solved, and handled the complete synthesis, typesetting, and mathematical structuring of the LaTeX manuscript. 3. Advanced Mathematical Discovery, Derivations, and Proof Engineering (Gemini Argon 4):Gemini Argon 4 served as the primary mathematical reasoning and discovery engine. In response to the technical bottlenecks and problem formulations established by Gemini Flash 3.8, Gemini Argon 4 derived the formal mathematical proofs and quantum circuit synthesis, including lattice transference separation under BKZ, the AM-GM transference barrier and smooth-quotient algorithm, Pilatte's unconditional p-torsion bounds, and reversible Zeckendorf-Fibonacci arithmetic.
Accurately simulating molecular dynamics during chemical reactions remains a central challenge in computational chemistry. These processes are inherently quantum mechanical, involving coupled electronic and nuclear motion and non-adiabatic effects. A fully quantum description is therefore required, yet the associated computational cost grows exponentially with system size. Even with modern supercomputers, storing and evolving a molecular wavefunction rapidly becomes intractable, limiting exact simulations of chemical dynamics. Quantum simulation offers a promising alternative by using controllable quantum systems to directly reproduce molecular dynamics. However, fully digital, qubit-based approaches remain impractical for chemistry due to limited qubit numbers, coherence times, and gate fidelities. This motivates the exploration of more resource-efficient quantum architectures. In this thesis, we demonstrate that mixed-qudit-boson (MQB) quantum simulators provide a practical platform for simulating chemical dynamics in the quantum regime. In MQB devices, multilevel qudits encode electronic states while bosonic modes natively represent vibrational degrees of freedom, avoiding costly qubit encodings of nuclear motion and substantially reducing resource requirements. The thesis makes three main contributions. First, it reports the direct observation of geometric-phase interference in non-adiabatic dynamics using an MQB simulation of the Jahn–Teller model. Second, it extends the MQB framework to open-system chemical dynamics through programmable Lindblad dissipation. Third, it presents a resource analysis showing that MQB simulators can reduce resource costs by several orders of magnitude relative to qubit-only approaches. Together, these results establish MQB quantum simulators as a promising route for studying chemical dynamics beyond the reach of classical computation.
The quantum computation of electronic energies can break the curse of dimensionality that plagues manyparticle quantum mechanics.It is for this reason that a universal quantum computer has the potential to fundamentally change computational chemistry and materials science, areas in which strong electron correlations present severe hurdles for traditional electronic structure methods.Here we present a state-of-the-art analysis of accurate energy measurements on a quantum computer for computational catalysis, using improved quantum algorithms with more than an order of magnitude improvement over the best previous algorithms.As a prototypical example of local catalytic chemical reactivity we consider the case of a ruthenium catalyst that can bind, activate, and transform carbon dioxide to the high-value chemical methanol.We aim at accurate resource estimates for the quantum computing steps required for assessing the electronic energy of key intermediates and transition states of its catalytic cycle.In particular, we present quantum algorithms for double-factorized representations of the four-index integrals that can significantly reduce the computational cost over previous algorithms, and we discuss the challenges of increasing active space sizes to accurately deal with dynamical correlations.We address the requirements for future quantum hardware in order to make a universal quantum computer a successful and reliable tool for quantum computing enhanced computational materials science and chemistry, and identify open questions for further research.
The HALO Engine: O(1)\mathcal{O}(1)O(1)-Step Compilation and Localized String Rupture for Lattice Gauge Theories on Quantum Hardware
Simulating real-time dynamics in lattice gauge theories (LGTs) is severely constrained by the circuit depth overhead of standard fermion-to-qubit mappings, which scale linearly or quadratically with system size. To overcome this depth-scaling bottleneck, we introduce the Hardware-Aware Lattice Optimization (HALO) compiler, an architecture executing global time-evolution in an immutable O(1)\mathcal{O}(1)O(1) circuit depth per Trotter step. By natively mapping composite gauge links to hardware topologies, HALO achieves a 91.36%91.36\%91.36% reduction in entangling gate overhead compared to unoptimized Jordan-Wigner baselines, compressing a 16-qubit global step to 56 CNOTs and bypassing extensive O(N)\mathcal{O}(N)O(N) scaling limits. We validate this compiler on IBM superconducting transmon processors by simulating the mesoscopic Quantum Link Model (QLM) truncation of the Schwinger model. Coupling O(1)\mathcal{O}(1)O(1) compilation with Zero-Noise Extrapolation (ZNE), we track localized string rupture, extracting the dynamical crossover of pair creation at t≈0.790t \approx 0.790t≈0.790 with an 18.3±2.2%18.3 \pm 2.2\%18.3±2.2% rupture probability. Furthermore, we map the dynamical phase diagram, identifying the confinement phase boundary at gc=1.0g_c = 1.0gc​=1.0. Finally, we introduce a scalable 2D unit-cell blueprint, paving a direct pathway toward the fault-tolerant simulation of two-dimensional Quantum Chromodynamics (QCD).