arXiv subjects

Michael Kaicher

Publications and source records attributed to Michael Kaicher.

8 recordsLinked to original sources

arXiv2026

Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor

We report on a performance comparison between physical and logical computations on a prototypical machine-learning application: solving differential equations using quantum kernel methods. The algorithm is implemented on an atom-based logical quantum processor, both at the physical and logical levels. We show that the kernel estimated from the logical implementation performs better than its physical counterpart on relevant metrics. We observe how such performance improvement can be traced back to specific noise-induced errors detected by the chosen encoding. We apply the computed quantum kernel to the task of solving differential equations, confirming how the superior performance of a logical quantum kernel is retained also at an end-to-end applicative level. Our findings show that experimental validation of end-to-end protocols can already highlight the positive impact of fault-tolerant implementations despite their higher quantum resource count, and guide application-informed architectural choices.

quant-ph↗

arXiv2026

One-to-one quantum simulation of a frustrated magnet with 256 qubits

Analog quantum simulators offer a powerful microscopic probe of quantum many-body systems, yet have largely been benchmarked against model Hamiltonians rather than real materials. Here, we use a 256-qubit Rydberg simulator to implement the effective Hamiltonian of the frustrated triangular-lattice magnet TmMgGaO$_4$. Simulated magnetization curves agree quantitatively with susceptibility measurements on single crystals, and both platforms consistently determine the antiferromagnetic phase transition. Snapshot-resolved analysis confirms that quantum fluctuations, rather than disorder, govern the intermediate paramagnetic regime. Having established this correspondence, we access non-equilibrium dynamics following a sudden quench, a regime at picosecond material timescales where entanglement growth places the problem beyond classical reach. The simulator reveals thermalization of local observables, demonstrating that analog quantum simulation can reproduce and extend the physics of a real material.

quant-ph↗

arXiv2026

Quantum simulation of general spin-1/2 Hamiltonians with parity-violating fermionic Gaussian states

We introduce equations of motion for a parity-violating fermionic mean-field theory (PV-FMFT): a numerically efficient fermionic mean-field theory based on parity-violating fermionic Gaussian states (PV-FGS). This work provides explicit equations of motion for studying the real- and imaginary-time evolution of spin-1/2 Hamiltonians with arbitrary geometries and interactions. We extend previous formulations of parity-preserving fermionic mean-field theory (PP-FMFT) by including fermionic displacement operators in the variational Ansatz. Unlike PP-FMFT, PV-FMFT can be applied to general spin-1/2 Hamiltonians, describe quenches from arbitrary initial spin-1/2 product states, and compute local and non-local observables in a straight-forward manner at the same modest computational cost as PP-FMFT -- scaling as $O(N^3)$ in the worst case for a system of $N$ spins or fermionic modes. We demonstrate that PV-FMFT can exactly capture the imaginary- and real-time dynamics of non-interacting spin-1/2 Hamiltonians. We then study the post quench-dynamics of the one- and two-dimensional Ising model in presence of longitudinal and transversal fields with PV-FMFT and compute the single site magnetization and correlation functions, and compare them against results from other state-of-the-art numerical approaches. In two-dimensional spin systems, we show that the employed spin-to-fermion mapping can break rotational symmetry within the PV-FMFT description, and we discuss the resulting consequences for the calculated correlation functions. Our work introduces PV-FMFT as a benchmark for other numerical techniques and quantum simulators, and it outlines both its capabilities and its limitations.

cond-mat.str-el↗

arXiv2025

Simulating dynamics of the two-dimensional transverse-field Ising model: a comparative study of large-scale classical numerics

The quantum dynamics of many-qubit systems is an outstanding problem that has recently driven significant advances in both numerical methods and programmable quantum processing units. In this work, we employ a comprehensive toolbox of state-of-the-art numerical approaches to classically simulate the dynamics of the two-dimensional transverse field Ising model. Our methods include three different tensor network techniques -- matrix product states, tree-tensor networks, and two-dimensional tensor-networks under the belief propagation approximation -- as well as time-dependent variational Monte Carlo with Neural Quantum States. We focus on two paradigmatic dynamical protocols: (i) quantum annealing through a critical point and (ii) post-quench dynamics. Our extensive results show the quantitative predictions of various state-of-the-art numerical methods providing a benchmark for future numerical investigations and experimental studies with the aim to push the limitations on classical and QPUs. In particular, our work connects classical simulability to different regimes associated with quantum dynamics in Rydberg arrays - namely, quasi-adiabatic dynamics, the Kibble-Zurek mechanism, and quantum quenches.

quant-ph↗

arXiv2023

Fault-tolerant quantum simulation of materials using Bloch orbitals

The simulation of chemistry is among the most promising applications of quantum computing. However, most prior work exploring algorithms for block-encoding, time-evolving, and sampling in the eigenbasis of electronic structure Hamiltonians has either focused on modeling finite-sized systems, or has required a large number of plane wave basis functions. In this work, we extend methods for quantum simulation with Bloch orbitals constructed from symmetry-adapted atom-centered orbitals so that one can model periodic \textit{ab initio} Hamiltonians using only a modest number of basis functions. We focus on adapting existing algorithms based on combining qubitization with tensor factorizations of the Coulomb operator. Significant modifications of those algorithms are required to obtain an asymptotic speedup leveraging translational (or, more broadly, Abelian) symmetries. We implement block encodings using known tensor factorizations and a new Bloch orbital form of tensor hypercontraction. Finally, we estimate the resources required to deploy our algorithms to classically challenging model materials relevant to the chemistry of Lithium Nickel Oxide battery cathodes within the surface code.

quant-ph↗

arXiv2020

Roadmap for quantum simulation of the fractional quantum Hall effect

A major motivation for building a quantum computer is that it provides a tool to efficiently simulate strongly correlated quantum systems. In this work, we present a detailed roadmap on how to simulate a two-dimensional electron gas---cooled to absolute zero and pierced by a strong transversal magnetic field---on a quantum computer. This system describes the setting of the Fractional Quantum Hall Effect (FQHE), one of the pillars of modern condensed matter theory. We give analytical expressions for the two-body integrals that allow for mixing between $N$ Landau levels at a cutoff $M$ in angular momentum and give gate count estimates for the efficient simulation of the energy spectrum of the Hamiltonian on an error-corrected quantum computer. We then focus on studying efficiently preparable initial states and their overlap with the exact ground state for noisy as well as error-corrected quantum computers. By performing an imaginary time evolution of the covariance matrix we find the generalized Hartree-Fock solution to the many-body problem and study how a multi-reference state expansion affects the state overlap. We perform small-system numerical simulations to study the quality of the two initial state Ansätze in the Lowest Landau Level (LLL) approximation.

quant-ph↗

arXiv2017

Benchmarking non-simulable quantum processes via symmetry conservation

As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized benchmarking, cannot efficiently check correctness of most of the processes involved. In particular non-Clifford gates are a requirement for not only universal quantum computation but for any algorithm or quantum simulation that yields fundamental speedup in comparison with its classical counterpart. We show that it is in fact still possible to validate such non-simulable processes by taking advantage of expected or engineered conservations laws in the system, combined with a unitary one-design strategy to randomize errors over the computational Hilbert space. We show that in the context of (fault-tolerant) quantum error correction, we can construct a one-design using the logically encoded Clifford group over the engineered error-free stabilizer subspace to obtain average error for arbitrary logically-encoded gates and algorithms. In the case of benchmarking simulation of physical systems, these can have various exotic symmetries over which one-design strategies can nonetheless be constructed. We give examples for fermionic systems which conserve particle number, as well as for the Fermi-Hubbard model. The symmetry benchmarking method preserves robustness to state preparation and measurement imperfections.

quant-ph↗

arXiv2017

Linear and logarithmic time compositions of quantum many-body operators

We develop a generalized framework for constructing many-body-interaction operations either in linear time, or in logarithmic time with a linear number of ancilla qubits. Exact gate decompositions are given in particular for Pauli strings, many-control Toffoli gates, number-~and parity-conserving interactions, Unitary Coupled Cluster operations, and sparse matrix generators. We provide a linear time protocol that works by creating a superposition of exponentially many different possible operator strings and then uses dynamical decoupling methodology to undo all the unwanted terms. A logarithmic time protocol overcomes the speed limit of the first by using ancilla registers to condition evolution to the support of the desired many-body interaction before using parallel chaining operations to expand the string length. The two techniques improve substantially on current strategies (reductions in time and space can range from linear to exponential), are applicable to different physical interaction mechanisms such as CNOT, $XX$, and $XX+YY$, and generalize to a wide range of many-body operators.

quant-ph↗