arXiv subjects

Michael J. Hartmann

Publications and source records attributed to Michael J. Hartmann.

At least 19 recordsLinked to original sources

arXiv2026

Hybrid quantum-classical neural network for sample-efficient recognition of topological phases

With increasing maturity of quantum computers, standard methods for characterizing global properties of their output quantum states via direct measurements and classical post-processing are becoming increasingly impractical due to large measurement costs. Although quantum neural networks could directly process quantum states to identify underlying characteristics with reduced measurement efforts, they often require deep quantum circuits that cannot be implemented on existing devices. To overcome these challenges, we introduce a hybrid quantum-classical neural network that consists of a shallow parameterized quantum circuit, measurements, and a classical neural network. The parameterized quantum circuit performs a nonlocal transformation of the measurement basis, which is jointly trained with the classical neural network to maximize the statistical distance between data obtained by measuring different quantum states. Using supervised learning, we demonstrate that the hybrid neural network distinguishes the topological phase of the surface code from a symmetry-enriched topological phase and random product states. Moreover, this hybrid neural network reduces both inference and training sample complexities of recognizing the topological phase by approximately one order of magnitude compared to a classical neural network trained on randomized Pauli measurements. As this hybrid neural network features a shallow quantum circuit that can be readily implemented on existing quantum computers, it enables the efficient characterization of complex quantum states.

quant-ph↗

arXiv2026

Hybrid Quantum-Classical Neural Networks for Recognizing Quantum Phases

Identifying quantum phases of matter is key to understanding strongly correlated materials, but remains a challenging task for both conventional computers and current quantum processors. Here, we introduce and implement a hybrid quantum-classical neural network for quantum phase recognition by combining a hardware-efficient parameterized quantum circuit and a feedforward neural network. We jointly train both components with superconducting quantum hardware in the optimization loop, to experimentally demonstrate a classifier for the quantum phases of surface code lattices with up to 4x4 sites in a magnetic field. To learn nonlocal features of the topological phase, we train the hybrid neural network to distinguish topological ground states of the surface code from a featureless ensemble of product states. This allows the trained classifier to distinguish topological ground states from randomly chosen product states, even when subjected to any single-qubit Pauli error. The classifier reaches accuracies above 85% in single-shot measurements, and above 99% when averaging over ten measurements. We expect hybrid neural networks such as the one presented here to be a promising approach for characterizing quantum states in scenarios where classical methods exhibit an unfavorable scaling of sample complexity.

quant-ph↗

arXiv2026

Quantum gates with parametrically driven multi-qubit couplers

Superconducting quantum processors could significantly profit from enhanced connectivity together with precise control of interactions and gates between qubits. Here we investigate plaquettes of four qubits that are coupled via a central tunable coupling circuit, so that not only gates between qubits connected by an edge of the plaquette can be executed but also between qubits across the diagonal. By numerically and analytically analyzing parametrically driven processes, we explore $\sqrt{\text{iSWAP}}$-gates between any pair of qubits, also across the diagonal, as well as three-qubit interactions and gates. For experimentally available circuit parameters, we for example find $\sqrt{\text{iSWAP}}$-gates with a gate time of 50 ns and 99.9\% fidelity, which is decreased to 99.4\% if two such gates are executed in parallel on disjoint qubit pairs in the plaquette. For three-qubit gates we find fidelities of 95\% fidelity at a gate time of 200 ns.

quant-ph↗

arXiv2026

Thermodynamic-limit dispersion relations on trapped-ion quantum hardware

We run a numerical linked-cluster expansion with a quantum algorithm (NLCE+QA), computing ground-state energies and one quasi-particle dispersions in the thermodynamic limit using a 20-qubit trapped-ion quantum processing unit (QPU). The NLCE+QA framework extracts thermodynamic-limit properties from small-cluster calculations, making it naturally suited for near-term quantum devices. Projector-based block-diagonalization schemes such as projective cluster-additive transformation (PCAT) are essential to NLCE+QA, and they involve matrix inversion and square root operations that amplify measurement noise. A central question is therefore whether current hardware can provide expectation values that are accurate enough to withstand non-linear classical post-processing. We explore this challenge for the transverse-field Ising model (TFIM) in one dimension, on a ladder geometry, as well as in a longitudinal field in one dimension. For the quantum algorithm, we consider adiabatic state preparation (ASP), as well as a variational quantum eigensolver (VQE) trained on a classical device. The final expectation values are obtained from the QPU, using a novel alternative to the Hadamard test that we name the CX-test. We explore the regimes currently attainable on quantum devices and comment on the improvements needed for quantum computers to achieve results beyond classical reach.

quant-ph↗

arXiv2026

Sample-Based Quantum Diagonalization with Amplitude Amplification

Recently, sample-based quantum diagonalization (SQD) has emerged as a promising approach to compute ground and excited states of problem Hamiltonians.This method classically diagonalizes a Hamiltonian in a subspace that is spanned by samples obtained from a quantum computer. However, by its nature, SQD suffers from a fundamental sampling problem, as some basis states that are required for a targeted accuracy may only be sampled extremely rarely. To alleviate this limitation, we introduce the SQD-AA algorithm that combines SQD with amplitude amplification (AA). SQD-AA uses AA to sequentially reduce probabilities of already measured bitstrings, thus making the observation of new ones more likely. We observe a reduction in the total query complexity of more than a factor 100 for algebraically and exponentially decaying model distributions, and analytically show a quadratic advantage for the latter. Moreover, we evaluate real molecules in an early fault-tolerant scenario and compare SQD-AA to SQD and iterative quantum phase estimation (iQPE). For all considered examples, we observe the lowest total number of T-gates for SQD-AA while only requiring circuits that are 3-4 orders of magnitude shallower than those needed for iQPE. Given this substantial reduction in circuit depth compared to iQPE while saving 2 orders of magnitude in total runtime compared to SQD, we expect a significant regime in early fault-tolerance where SQD-AA runs feasibly, but iQPE circuits are too deep to execute confidently.

quant-ph↗

arXiv2025

Hierarchical divide and conquer quantum approach to combinatorial optimization problems with tunable reduction

Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum computers have qubits. Here we introduce a divide and conquer approach that partitions the optimization problem into subgraphs that can be represented on smaller quantum processors. We then find all states of the subgraphs that can possibly be part of the solution to the entire problem by determining the cost or energy ranges in which the local subgraph energies of these states must be contained. This allows us to reduce the problem by only considering the subspace spanned by these states. We then recombine the system using a binary encoding for each subgraph with a local energy ordering. This process can be iterated until no further reduction is possible. We also find that the number of necessary qubits can be reduced further when only retaining states in a fraction of the relevant energy range at very little expense in terms of approximation ratio to the global ground state. In numerical simulations, we find that our approach allows us to solve combinatorial optimization problems on weighted random 3-regular graphs with $|\mathcal{V}|=40$ discrete variables on $\sim |\mathcal{V}| / 4$ qubits while retaining a possible approximation ratio of $\sim99.9\%$. We also observe an increasing reduction with larger system sizes.

quant-ph↗

arXiv2025

Ground State Energy via Adiabatic Evolution and Phase Measurement for a Molecular Hamiltonian on an Ion-Trap Quantum Computer

Estimating molecular ground-state energies is a central application of quantum computing, requiring both the preparation of accurate quantum states and efficient energy readout. Understanding the effect of hardware noise on these experiments is crucial to distinguish errors that have low impact, errors that can be mitigated, and errors that must be reduced at the hardware level. We ran a state preparation and energy measurement protocol on an ion-trap quantum computer, without any non-scalable off-loading of computational tasks to classical computers, and show that leakage errors are the main obstacle to chemical accuracy. More specifically, we apply adiabatic state preparation to prepare the ground state of a six-qubit encoding of the H3+ molecule and extract its energy using a noise-resilient variant of iterative quantum phase estimation. Our results improve upon the classical Hartree-Fock energy. Analyzing the effect of hardware noise on the result, we find that while coherent and incoherent noise have little influence, the hardware results are mainly impacted by leakage errors. Absent leakage errors, noisy numerical simulations show that with our experimental settings we would have achieved close to chemical accuracy, even shot noise included. These insights highlight the importance of targeting leakage suppression in future algorithm and hardware development.

quant-ph↗

arXiv2025

Quantum Convolutional Neural Network for Phase Recognition in Two Dimensions

Quantum convolutional neural networks (QCNNs) are quantum circuits for characterizing complex quantum states. They have been proposed for recognizing quantum phases of matter at low sampling cost and have been designed for condensed matter systems in one dimension. Here we construct a QCNN that can perform phase recognition in two dimensions and correctly identify the phase transition from a Toric Code phase with $\mathbb{Z}_2$-topological order to the paramagnetic phase. The network also exhibits a noise threshold up to which the topological order is recognized. Furthermore, it captures correlations between all stabilizer elements of the Toric Code, which cannot be accessed by direct measurements. This increases the threshold for errors leading to such correlations and allows for correctly identifying the topological phase in the presence of strong correlated errors. Our work generalizes phase recognition with QCNNs to higher spatial dimensions and intrinsic topological order, where exploration and characterization via classical numerics become challenging.

quant-ph↗

arXiv2025

Variational Time Evolution Compression for Solving Impurity Models on Quantum Hardware

Dynamical mean-field theory (DMFT) is a useful tool to analyze models of strongly correlated fermions like the Hubbard model. In DMFT, the lattice of the model is replaced by a single impurity site embedded in an effective bath. The resulting single impurity Anderson model (SIAM) can then be solved self-consistently with a quantum-classical hybrid algorithm. This procedure involves repeatedly preparing the ground state on a quantum computer and evolving it in time to measure the Greens function. We here develop an approximation of the time evolution operator for this setting by training a Hamiltonian variational ansatz. The parameters of the ansatz are obtained via a variational quantum algorithm that utilizes a small number of time steps, given by the Suzuki-Trotter expansion of the time evolution operator, to guide the evolution of the parameters. The resulting circuit has a fixed depth for the time evolution depending on the size of the bath and is significantly shallower than a comparable Suzuki-Trotter expansion.

quant-ph↗

arXiv2025

Scalable Fluxonium-Transmon Architecture for Error Corrected Quantum Processors

We propose a hybrid quantum computing architecture composed of alternating fluxonium and transmon qubits, that are coupled via transmon tunable couplers. We show that this system offers excellent scaling properties, characterized by engineered zero $ZZ$-crosstalk in the idle regime, a substantial reduction of level-crowding challenges through the alternating arrangement of different qubit types within the lattice, and parameter regimes that circumvent the capacitive loading problem commonly associated with fluxoniums. In numerical simulations, we show a parametrically driven CZ-gate that achieves a closed-system infidelity that is orders of magnitude below the coherence limit for gate durations $\gtrsim 30\,\rm{ns}$ using a two-tone flux pulse on the tunable coupler. Furthermore, we show that this gate scheme retains its fidelity in the presence of spectator qubits, making it a scalable solution for large lattices. Moreover, for the implementation of error correcting codes, our approach can leverage the long coherence times and large non-linearities of fluxoniums as data qubits, while fixed-frequency transmons with established readout techniques can serve as measurement ancillas.

quant-ph↗

arXiv2025

Optimizing Superconducting Three-Qubit Gates for Surface-Code Error Correction

Quantum error correction (QEC) is one of the crucial building blocks for developing quantum computers that have significant potential for reaching a quantum advantage in applications. Prominent candidates for QEC are stabilizer codes for which periodic readout of stabilizer operators is typically implemented via successive two-qubit entangling gates, and is repeated many times during a computation. To improve QEC performance, it is thus beneficial to make the stabilizer readout faster and less prone to fault-tolerance-breaking errors. Here we design a 3-qubit CZZ gate for superconducting transmon qubits that maps the parity of two data qubits onto one measurement qubit in a single step. We find that the gate can be executed in a duration of $35\,$ns with a fidelity of F$=99.96 \, \%$. To optimize the gate, we use an error model obtained from the microscopic gate simulation to systematically suppress Pauli errors that are particularly harmful to the QEC protocol. Using this error model, we investigate the implementation of this 3-qubit gate in a surface code syndrome readout schedule. We find that for the rotated surface code, the implementation of CZZ gates increases the error threshold by nearly 50\% to $\approx 1.2\,\%$ and decreases the logical error rate, in the experimental relevant regime, by up to one order of magnitude, compared to the standard CZ readout protocol. We also show that for the unrotated surface code, strictly fault-tolerant readout schedules can be found. This opens a new perspective for below-threshold surface-code error correction, where it can be advantageous to use multi-qubit gates instead of two-qubit gates to obtain a better QEC performance.

quant-ph↗

arXiv2025

Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates

Quantum error correction (QEC) is considered a deciding component in enabling practical quantum computing. Stabilizer codes, and in particular topological surface codes, are promising candidates for implementing QEC by redundantly encoding quantum information. While it is widely believed that a strictly fault-tolerant protocol can only be implemented using single- and two-qubit gates, several quantum computing platforms, based on trapped ions, neutral atoms and also superconducting qubits support native multi-qubit operations, e.g. using multi-ion entangling gates, Rydberg blockade or parallelized tunable couplers, respectively. In this work, we show that stabilizer measurement circuits for unrotated surface codes can be fault-tolerant using single auxiliary qubits and three-qubit gates. These gates enable lower-depth circuits leading to fewer fault locations and potentially shorter QEC cycle times. Concretely, we find that in an optimistic parameter regime where fidelities of three-qubit gates are the same as those of two-qubit gates, the logical error rate can be up to one order of magnitude lower and the threshold can be significantly higher, increasing from $\approx 0.76 \%$ to $\approx 1.05 \%$. Our results, which are applicable to a wide range of platforms, thereby motivate further investigation into multi-qubit gates as components for fault-tolerant QEC, as they can lead to substantial advantages in terms of time and physical qubit resources required to reach a target logical error rate.

quant-ph↗

arXiv2025

Quantum Wasserstein Compilation: Unitary Compilation using the Quantum Earth Mover's Distance

Despite advances in the development of quantum computers, the practical application of quantum algorithms requiring deep circuit depths or high-fidelity transformations remains outside the current range of the so-called noisy intermediate-scale quantum devices. Now and beyond, quantum circuit compilation (QCC) is a crucial component of any quantum algorithm execution. Besides translating a circuit into hardware-specific gates, it can optimize circuit depth and adapt to noise. Variational quantum circuit compilation (VQCC) optimizes the parameters of an ansatz according to the goal of reproducing a given unitary transformation. In this work, we present a VQCC-objective function called the quantum Wasserstein compilation (QWC) cost function based on the quantum Wasserstein distance of order 1. We show that the QWC cost function upper bounds the average infidelity of two circuits. An estimation method based on measurements of local Pauli-observable is utilized in a generative adversarial network to learn a given quantum circuit. We demonstrate the efficacy of the QWC cost function by compiling hardware efficient ansatz (HEA) as both the target and the ansatz and comparing to cost functions such as the Loschmidt echo test (LET) and the Hilbert-Schmidt test (HST). Finally, our experiments demonstrate that QWC as a cost function is the least affected by barren plateaus when compared to LET and HST for deep enough circuits.

quant-ph↗

arXiv2025

Efficient Quantum Cooling Algorithm for Fermionic Systems

We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known ground state. We derive suitable interaction Hamiltonians that originate from ladder operators of the free theory and initiate resonant gaps between system and fridge. We further propose a spectroscopic scan to find the relevant eigenenergies of the system using energy measurements on the fridge. With these insights, we design a ground state cooling algorithm for fermionic systems that is efficient, i.e. its runtime is polynomial in the system size, as long as the initial state is prepared in a low-energy sector of polynomial size. We achieve the latter via a pseudo-adiabatic sweep from a parameter regime whose ground state can be easily prepared. We estimate that our algorithm has a polynomial runtime for systems where the spectral gap decreases at most polynomially in system size, and is faster than the adiabatic algorithm for a large range of settings. We generalize the algorithm to prepare thermal states and demonstrate our findings on the Fermi-Hubbard model.

quant-ph↗

arXiv2025

Designing fast quantum gates using optimal control with a reinforcement-learning ansatz

Fast quantum gates are crucial not only for the contemporary era of noisy intermediate-scale quantum devices but also for the prospective development of practical fault-tolerant quantum computing. Leakage errors, which arise from data qubits jumping beyond the confines of the computational subspace, are the main challenges in realizing non-adiabatically driven, fast gates. In this work, we propose and illustrate the usefulness of reinforcement learning (RL) to generate fast two-qubit gates in practical multilevel superconducting qubits. In particular, we show that the RL controller offers great effectiveness in finding piecewise constant gate pulse sequences that act on two transmon data qubits coupled by a tunable coupler to generate a controlled-Z (CZ) gate with a gate time of 10 ns and an error rate of $\sim 4\times 10^{-3}$. Using a gradient-based method to solve the same optimization problem often does not achieve high fidelity for such fast gates. However, we show that using the gate pulses discovered by RL as an ansatz for the gradient-based controller can substantially enhance fidelity compared to using RL alone. While for a 10 ns pulse, this improvement is marginal, the combined RL + gradient approach decreases the gate errors below $10^{-4}$ for a gate of length 20 ns.

quant-ph↗

arXiv2024

Large-scale simulations of Floquet physics on near-term quantum computers

Periodically driven quantum systems exhibit a diverse set of phenomena but are more challenging to simulate than their equilibrium counterparts. Here, we introduce the Quantum High-Frequency Floquet Simulation (QHiFFS) algorithm as a method to simulate fast-driven quantum systems on quantum hardware. Central to QHiFFS is the concept of a kick operator which transforms the system into a basis where the dynamics is governed by a time-independent effective Hamiltonian. This allows prior methods for time-independent simulation to be lifted to simulate Floquet systems. We use the periodically driven biaxial next-nearest neighbor Ising (BNNNI) model, a natural test bed for quantum frustrated magnetism and criticality, as a case study to illustrate our algorithm. We implemented a 20-qubit simulation of the driven two-dimensional BNNNI model on Quantinuum's trapped ion quantum computer. Our error analysis shows that QHiFFS exhibits not only a cubic advantage in driving frequency $ω$ but also a linear advantage in simulation time $t$ compared to~Trotterization.

quant-ph↗

arXiv2024

Shot-noise reduction for lattice Hamiltonians

Efficiently estimating energy expectation values of quantum lattice systems on quantum computers is a crucial subroutine for various quantum algorithms, which can lead to significant overhead due to the high measurement shot numbers required. We introduce a measurement strategy tailored to quantum lattice systems and (noisy) energy eigenstates. It is based on a geometric partitioning of the Hamiltonian into local patches, and performing the measurements in the eigenbases of those patches. The resulting energy estimator has a smaller variance than the ones of Pauli grouping schemes, which leads to a reduction of the total number of shots. We provide rigorous guarantees for this variance improvement for energy eigentstates, also in the presence of depolarizing noise. As one can choose the subsystem size, one can ensure that measurement circuits remain within implementable depths. In numerical experiments, we demonstrate the shot count reduction for various 2D lattice models, including the transverse field XY and Ising models, as well as the Fermi-Hubbard model. We find sampling improvements of several orders of magnitude already for plaquettes of two by two qubits, where the required readout circuits remain very moderate in depth.

quant-ph↗

arXiv2024

Error-tolerant quantum convolutional neural networks for symmetry-protected topological phases

The analysis of noisy quantum states prepared on current quantum computers is getting beyond the capabilities of classical computing. Quantum neural networks based on parametrized quantum circuits, measurements and feed-forward can process large amounts of quantum data to reduce measurement and computational costs of detecting non-local quantum correlations. The tolerance of errors due to decoherence and gate infidelities is a key requirement for the application of quantum neural networks on near-term quantum computers. Here we construct quantum convolutional neural networks (QCNNs) that can, in the presence of incoherent errors, recognize different symmetry-protected topological phases of generalized cluster-Ising Hamiltonians from one another as well as from topologically trivial phases. Using matrix product state simulations, we show that the QCNN output is robust against symmetry-breaking errors below a threshold error probability and against all symmetry-preserving errors provided the error channel is invertible. This is in contrast to string order parameters and the output of previously designed QCNNs, which vanish in the presence of any symmetry-breaking errors. To facilitate the implementation of the QCNNs on near-term quantum computers, the QCNN circuits can be shortened from logarithmic to constant depth in system size by performing a large part of the computation in classical post-processing. These constant-depth QCNNs reduce sample complexity exponentially with system size in comparison to the direct sampling using local Pauli measurements.

quant-ph↗