arXiv subjects

Peter K. Schuhmacher

Publications and source records attributed to Peter K. Schuhmacher.

11 recordsLinked to original sources

arXiv2026

A mathematical justification to apply the secular approximation to the Redfield equation

Quantum master equations are widely used to describe the dynamics of open quantum systems. All these different master equations rely on specific approximations that may or may not be justified. Starting from a microscopic model, applying the standard Born and Markov approximations results in the Redfield equation that does not guarantee to preserve positivity. The latter is typically achieved by additionally applying the secular approximation resulting in a quantum master equation in Lindblad form. There are other ways to obtain an equation in Lindblad form, one of which is the recently proposed Universal Lindblad Equation. It has been shown that it is in the same equivalence class of approximations as the Redfield master equation although avoiding the heuristic secular approximation [arXiv:2004.01469]. In this work, we prove that the solutions of the master equation obtained by applying the secular approximation are also obtained by an approximation of the same order as the one performed to obtain the Redfield equation. We hereby provide a mathematical justification for the secular approximation. We show that the result of applying the secular approximation is obtained naturally by applying a self-consistency argument. This shows that the resulting master equation is also in the same equivalence class of approximations as the Redfield master equation and the Universal Lindblad Equation. We furthermore compare it to the Universal Lindblad Equation numerically and show numerical evidence that the master equation obtained through the secular approximation yields more accurate solutions.

quant-ph↗

arXiv2026

Asymmetric quantum error correction efficiently tackles application-specific noise effects

Noise is a major challenge for current quantum computers. It can be broadly categorized into bit-flip and phase-flip errors. These two types do not necessarily affect the executed algorithm, thus also the application, in the same way. We illustrate this general effect for the example of the quantum approximate optimization algorithm (QAOA) applied to a small instance of the flight-gate assignment (FGA) problem. We compare bit-flip and phase-flip Pauli noise under both layer-level and gate-level noise models, using two circuit decompositions of the same ideal QAOA unitary: a CNOT-based decomposition and a native-$R_{ZZ}$ decomposition. In the simulations, bit-flip noise produces the larger degradation in the performance of the quantum optimization. The asymmetry is most visible in the layer-level and native-$R_{ZZ}$ simulations. We explain this by how the errors affect mixing, final measurements, and how they propagate inside the circuit. We then exploit these insights to tackle noise particularly efficiently using asymmetric error-correcting codes. As an illustration, we use the quantum parity code (QPC), a generalization of the 9-qubit Shor code, and show that a smaller asymmetric code can achieve nearly the same improvement as a larger symmetric choice. This demonstrates that error-correction resources should be assigned not only according to physical error rates, but also according to how strongly each error channel affects the application. As a result, asymmetric quantum error correction proves useful even in cases where the noise model is symmetric. Finally, we discuss how information about the noise obtained through calibration can be exploited in our approach.

quant-ph↗

arXiv2026

QCI Connect: A Modular Full-Stack Quantum Computing Platform

In a world of various competing quantum computing architectures, hardware-agnostic, full-stack platforms are necessary to bring the full power of quantum computing hardware to domain experts via the cloud. QCI Connect and its Software Development Kit provide a reference architecture for a full-stack platform with a modular design and open-source interface definitions, built to facilitate a community-driven application ecosystem. Here, we present its overall design and features, central interfaces, and lessons learned, both for users of the platform and as a reference guide for future developments.

quant-ph↗

arXiv2026

Quantum Simulation of Magnetic Materials: from Ab-Initio to NISQ

Quantum computers are increasingly accessible, yet demonstrations of physically meaningful simulations for real materials remain scarce. In our work we simulate low-energy magnetic excitations, specifically spin-wave spectra, of chromium tri-halide monolayers. Starting from ab-initio electronic structure calculations for these two-dimensional magnets, we derive an effective spin model and simulate low-energy spin excitations using a real-time propagation of the spin system on the commercial quantum computing cloud platform IQM Resonance. The results for systems with up to 48 qubits are validated against classical benchmarks. While some spectral features remain challenging for today's NISQ devices, our simulation achieves good agreement at quasi-constant wall-time scaling, compared to the exponential scaling of classical methods. Our results demonstrate that, even in the absence of quantum advantage, useful quantum simulations of real materials are becoming possible for domain experts via commercial cloud access to quantum computers.

quant-ph↗

arXiv2025

Application-Aware Benchmarking on NISQ Hardware using Expectation Value Fidelities

We present a low-cost protocol for benchmarking applications on generic quantum hardware in the circuit model. Using families of Clifford circuits which mimic the application circuit structure, we are able to predict how measured expectation value fidelities scale with circuit depth. We consider the specific example of simulating a kicked-Ising model on superconducting hardware, showing our benchmark to be more accurate than predictions which use the gate error data obtained through randomized benchmarking. We also demonstrate how our work can be used to benchmark the performance and limitations of quantum error mitigation techniques. Our method is targeted at applications which have a natural decomposition in terms of Pauli rotations, but can be applied to any input circuit with this decomposition.

quant-ph↗

arXiv2024

Quantum Software Ecosystem Design

The rapid advancements in quantum computing necessitate a scientific and rigorous approach to the construction of a corresponding software ecosystem, a topic underexplored and primed for systematic investigation. This chapter takes an important step in this direction: It presents scientific considerations essential for building a quantum software ecosystem that makes quantum computing available for scientific and industrial problem solving. Central to this discourse is the concept of hardware-software co-design, which fosters a bidirectional feedback loop from the application layer at the top of the software stack down to the hardware. This approach begins with compilers and low-level software that are specifically designed to align with the unique specifications and constraints of the quantum processor, proceeds with algorithms developed with a clear understanding of underlying hardware and computational model features, and extends to applications that effectively leverage the capabilities to achieve a quantum advantage. We analyze the ecosystem from two critical perspectives: the conceptual view, focusing on theoretical foundations, and the technical infrastructure, addressing practical implementations around real quantum devices necessary for a functional ecosystem. This approach ensures that the focus is towards promising applications with optimized algorithm-circuit synergy, while ensuring a user-friendly design, an effective data management and an overall orchestration. Our chapter thus offers a guide to the essential concepts and practical strategies necessary for developing a scientifically grounded quantum software ecosystem.

quant-ph↗

arXiv2023

Mean-Field Approximate Optimization Algorithm

The Quantum Approximate Optimization Algorithm (QAOA) is suggested as a promising application on early quantum computers. Here, a quantum-inspired classical algorithm, the mean-field Approximate Optimization Algorithm (mean-field AOA), is developed by replacing the quantum evolution of the QAOA with classical spin dynamics through the mean-field approximation. Due to the alternating structure of the QAOA, this classical dynamics can be found exactly for any number of QAOA layers. We benchmark its performance against the QAOA on the Sherrington-Kirkpatrick (SK) model and the partition problem, and find that the mean-field AOA outperforms the QAOA in both cases for most instances. Our algorithm can thus serve as a tool to delineate optimization problems that can be solved classically from those that cannot, i.e. we believe that it will help to identify instances where a true quantum advantage can be expected from the QAOA. To quantify quantum fluctuations around the mean-field trajectories, we solve an effective scattering problem in time, which is characterized by a spectrum of time-dependent Lyapunov exponents. These provide an indicator for the hardness of a given optimization problem relative to the mean-field AOA.

quant-ph↗

arXiv2023

Exact Continuum Representation of Long-range Interacting Systems and Emerging Exotic Phases in Unconventional Superconductors

Continuum limits are a powerful tool in the study of many-body systems, yet their validity is often unclear when long-range interactions are present. In this work, we rigorously address this issue and put forth an exact representation of long-range interacting lattices that separates the model into a term describing its continuous analog, the integral contribution, and a term that fully resolves the microstructure, the lattice contribution. For any system dimension, any lattice, any power-law interaction, and for linear, nonlinear, and multi-atomic lattices, we show that the lattice contribution can be described by a differential operator based on the multidimensional generalization of the Riemann zeta function, namely the Epstein zeta function. We employ our representation in Fourier space to solve the important problem of long-range interacting unconventional superconductors. We derive a generalized Bardeen--Cooper--Schrieffer gap equation and find emerging exotic phases in two-dimensional superconductors with topological phase transitions. Finally, we utilize non-equilibrium Higgs spectroscopy to analyze the impact of long-range interactions on the collective excitations of the condensate. We show that the interactions can be used to fine-tune the Higgs mode's stability, ranging from exponential decay of the oscillation amplitude up to complete stabilization.

cond-mat.str-el↗

arXiv2020

Quantum Simulation of a Discrete-Time Quantum Stochastic Walk

Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this paper, we propose a trajectory-based quantum simulation protocol to effectively implement a family of discrete-time QSWs in a quantum device. After deriving the protocol for a 2-vertex graph with a single edge, we show how our protocol generalizes to a graph with arbitrary topology and connectivity. The straight-forward generalization leads to simple scaling of the protocol to complex graphs. Finally, we show how to simulate a restricted class of continuous-time QSWs by a discrete-time QSW, and how this is amenable to our simulation protocol for discrete-time QSWs.

quant-ph↗

arXiv2018

Gap-independent cooling and hybrid quantum-classical annealing

In this letter we present an efficient gap-independent cooling scheme for a quantum annealer that benefits from finite temperatures. We choose a system based on superconducting flux qubits as a prominent example of current quantum annealing platforms. We propose coupling the qubit system transversely to a coplanar waveguide to counter noise and heating that arise from always-present longitudinal thermal noise. We provide a schematic circuit layout for the system and show how, for feasible coupling strengths, we achieve global performance enhancements. Specifically, we achieve cooling improvements of about $50\%$ in the adiabatic and a few hundred percent in the non-adiabatic regime, respectively.

quant-ph↗

arXiv2016

Quantum Simulation of a Quantum Stochastic Walk

The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent movement of the walker, and therefore, directionality, is a generalization on the fully coherent quantum walk. While a quantum stochastic walk can always be described in Lindblad formalism, this does not mean that it can be microscopically derived in the standard weak-coupling limit under the Born-Markov approximation. This restricts the class of quantum stochastic walks that can be experimentally realized in a simple manner. To circumvent this restriction, we introduce a technique to simulate open system evolution on a fully coherent quantum computer, using a quantum trajectories style approach. We apply this technique to a broad class of quantum stochastic walks, and show that they can be simulated with minimal experimental resources. Our work opens the path towards the experimental realization of quantum stochastic walks on large graphs with existing quantum technologies.

quant-ph↗