arXiv subjects

Alicia B. Magann

Publications and source records attributed to Alicia B. Magann.

At least 19 recordsLinked to original sources

arXiv2026

Learning parameter curves in feedback-based quantum algorithms

Feedback-based quantum algorithms (FQAs) operate by iteratively growing a quantum circuit to optimize a given task. At each step, feedback from qubit measurements is used to inform the next quantum circuit update. In practice, the sampling cost associated with these measurements can be significant. Here, we ask whether FQA parameter sequences can be predicted using classical machine learning, obviating the need for qubit measurements altogether. To this end, we train a teacher-student model to map problem instances to associated FQA parameter curves in a single classical inference step. We first study weighted MaxCut problem instances, where numerical experiments show that this machine learning model can accurately predict FQA parameter curves across a range of problem sizes, including sizes not seen during model training. We then extend the analysis to transverse-field Ising models on graphs, and analyze how this learning strategy performs and generalizes beyond the original MaxCut setting. To evaluate performance, we compare the predicted parameter curves in simulation against FQA reference curves and linear quantum annealing schedules. We observe similar results to the former and performance improvements over the latter. These results suggest that machine learning can offer a heuristic, practical path to reducing sampling costs and resource overheads in quantum algorithms.

quant-ph↗

arXiv2026

A Model Predictive Control-Inspired Quantum Algorithm

We introduce a new hybrid quantum-classical algorithm inspired by an advanced control strategy known as model predictive control (MPC). This algorithm unifies the optimization-based design of variational quantum algorithms (VQAs) with the feedback-based design of feedback-based quantum algorithms (FQAs). Variational circuit parameters are optimized using a layer-wise receding horizon strategy, where observable measurements after every layer initialize a classically simulated dynamic model used to predict quantum state evolution and optimize over future parameterized gates. This hybrid algorithm can be used for applications such as ground state preparation and approximate combinatorial optimization, and presents an ideal use case for the integration of quantum computers with high-performance computing, where the latter resource can be used to increase the scale and efficiency of the predictions critical to MPC. We show through mathematical proof and numerical evidence that the MPC-based algorithm can be guaranteed to at least match the performance of FQAs. Through simulations on Max-Cut problems and a two-dimensional transverse-field Ising model, we demonstrate that relaxed implementations of the MPC-based algorithm can also provide improved performance in practice compared to an FQA.

quant-ph↗

arXiv2026

Trajectory-independent speed limits for controlled open quantum systems

Existing quantum speed limits for controlled open quantum systems depend on the specified trajectory. For example, lower bounds on quantum annealing times in the presence of dissipation depend explicitly on the chosen annealing schedule. Recently, schedule-independent speed limits have been derived for annealing in the closed quantum system setting (SciPost Phys. 18, 159 (2025)). In this work, we generalize these results to open quantum systems, deriving schedule-independent lower bounds for quantum annealing times in systems described by a Lindblad master equation. We analyze the interplay between coherent control and dissipation in single- and two-qubit examples, demonstrating that the derived lower bounds capture key scaling behavior with respect to the strength of the dissipator. Finally, we apply the bound to thermal state preparation and show that the bound matches the expected asymptotic behavior for an Ising model in the high temperature limit.

quant-ph↗

arXiv2026

Spectral Gaps via Imaginary Time

The spectral gap occupies a role of central importance in many open problems in physics. We present an approach for evaluating the spectral gap of a Hamiltonian from a simple ratio of two expectation values, both of which are evaluated using a quantum state that is evolved in imaginary time. In principle, the only requirement is that the initial state is supported on both the ground and first excited states. We demonstrate this approach for the Fermi-Hubbard and transverse-field Ising models through numerical simulation. We then go on to explore avenues for its implementation on quantum computers using imaginary-time quantum dynamical emulation.

quant-ph↗

arXiv2025

Fast-feedback protocols for calibration and drift control in quantum computers

We introduce two classes of lightweight, adaptive calibration protocols for quantum computers that leverage fast feedback. The first enables shot-by-shot updates to device parameters using measurement outcomes from simple, indefinite-outcome quantum circuits. This low-latency approach supports rapid tuning of one or more parameters in real time to mitigate drift. The second protocol updates parameters after collecting measurements from definite-outcome circuits (e.g.~syndrome extraction circuits for quantum error correction), balancing efficiency with classical control overheads. We use numerical simulations to demonstrate that both methods can calibrate 1- and 2-qubit gates rapidly and accurately even in the presence of decoherence, state preparation and measurement (SPAM) errors, and parameter drift. We propose and demonstrate effective adaptive strategies for tuning the hyperparameters of both protocols. Finally, we demonstrate the feasibility of real-time in-situ calibration of qubits performing quantum error correction, using only syndrome data, via numerical simulations of syndrome extraction in the [[5,1,3]] code.

quant-ph↗

arXiv2025

Platform Architecture for Tight Coupling of High-Performance Computing with Quantum Processors

We propose an architecture, called NVQLink, for connecting high-performance computing (HPC) resources to the control system of a quantum processing unit (QPU) to accelerate workloads necessary to the operation of the QPU. We aim to support every physical modality of QPU and every type of QPU system controller (QSC). The HPC resource is optimized for real-time (latency-bounded) processing on tasks with latency tolerances of tens of microseconds. The network connecting the HPC and QSC is implemented on commercially available Ethernet and can be adopted relatively easily by QPU and QSC builders, and we report a round-trip latency measurement of 3.96 microseconds (max) with prospects of further optimization. We describe an extension to the CUDA-Q programming model and runtime architecture to support real-time callbacks and data marshaling between the HPC and QSC. By doing so, NVQLink extends heterogeneous, kernel-based programming to the QSC, allowing the programmer to address CPU, GPU, and FPGA subsystems in the QSC, all in the same C++ program, avoiding the use of a performance-limiting HTTP interface. We provide a pattern for QSC builders to integrate with this architecture by making use of multi-level intermediate representation dialects and progressive lowering to encapsulate QSC code.

quant-ph↗

arXiv2024

Non-Variational ADAPT algorithm for quantum simulations

We explore a non-variational quantum state preparation approach combined with the ADAPT operator selection strategy in the application of preparing the ground state of a desired target Hamiltonian. In this algorithm, energy gradient measurements determine both the operators and the gate parameters in the quantum circuit construction. We compare this non-variational algorithm with ADAPT-VQE and with feedback-based quantum algorithms in terms of the rate of energy reduction, the circuit depth, and the measurement cost in molecular simulation. We find that despite using deeper circuits, this new algorithm reaches chemical accuracy at a similar measurement cost to ADAPT-VQE. Since it does not rely on a classical optimization subroutine, it may provide robustness against circuit parameter errors due to imperfect control or gate synthesis.

quant-ph↗

arXiv2024

Quantum Dynamical Emulation of Imaginary Time Evolution

We introduce a constructive method for mapping non-unitary dynamics to a weighted set of unitary operations. We utilize this construction to derive a new correspondence between real and imaginary time, which we term Imaginary Time Quantum Dynamical Emulation (ITQDE). This correspondence enables an imaginary time evolution to be constructed from the overlaps of states evolved in opposite directions. We develop ITQDE as a tool for estimating the ground and thermal state properties associated with a given Hamiltonian. We additionally provide a prescription for leveraging ITQDE to estimate the complete Hamiltonian spectrum. We go on to develop a quantum algorithm for computing Hamiltonian spectra based on ITQDE, which we validate through numerical simulations and quantum hardware implementations. We conclude with a discussion of how ITQDE can be utilized more broadly to derive novel thermodynamic results, including a generalisation of the Hubbard-Stratonovich transformation.

quant-ph↗

arXiv2024

Hamiltonian simulation in Zeno subspaces

We investigate the quantum Zeno effect as a framework for designing and analyzing quantum algorithms for Hamiltonian simulation. We show that frequent projective measurements of an ancilla qubit register can be used to simulate quantum dynamics on a target qubit register with a circuit complexity similar to randomized approaches. The classical sampling overhead in the latter approaches is traded for ancilla qubit overhead in Zeno-based approaches. A second-order Zeno sequence is developed to improve scaling and implementations through unitary kicks are discussed. We show that the circuits over the combined register can be identified as a subroutine commonly used in post-Trotter Hamiltonian simulation methods. We build on this observation to reveal connections between different Hamiltonian simulation algorithms.

quant-ph↗

arXiv2024

Spectral gaps of two- and three-dimensional many-body quantum systems in the thermodynamic limit

We present an expression for the spectral gap, opening up new possibilities for performing and accelerating spectral calculations of quantum many-body systems. We develop and demonstrate one such possibility in the context of tensor network simulations. Our approach requires only minor modifications of the widely used simple update method and is computationally lightweight relative to other approaches. We validate it by computing spectral gaps of the 2D and 3D transverse-field Ising models and find strong agreement with previously reported perturbation theory results.

quant-ph↗

arXiv2024

Requirements for building effective Hamiltonians using quantum-enhanced density matrix downfolding

Density matrix downfolding (DMD) is a technique for regressing low-energy effective Hamiltonians from quantum many-body Hamiltonians. One limiting factor in the accuracy of classical implementations of DMD is the presence of difficult-to-quantify systematic errors attendant to sampling the observables of quantum many-body systems on an approximate low-energy subspace. We propose a hybrid quantum-classical protocol for circumventing this limitation, relying on the prospective ability of quantum computers to efficiently prepare and sample from states in well-defined low-energy subspaces with systematically improvable accuracy. We introduce three requirements for when this is possible, including a notion of compressibility that quantifies features of Hamiltonians and low-energy subspaces thereof for which quantum DMD might be efficient. Assuming that these requirements are met, we analyze design choices for our protocol and provide resource estimates for implementing quantum-enhanced DMD on both the doped 2-D Fermi-Hubbard model and an ab initio model of a cuprate superconductor.

quant-ph↗

arXiv2023

Randomized adaptive quantum state preparation

We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit, where each adaptive step is informed by feedback from gradient measurements in which the associated tangent space directions are randomized. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states. We investigate different randomization procedures and develop lower bounds on the expected cost function change, which allows for drawing connections to barren plateaus and for assessing the applicability of the algorithm to large-scale problems.

quant-ph↗

arXiv2023

Feedback-based quantum algorithms for ground state preparation

The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years. These algorithms utilize a hybrid quantum-classical computing framework to prepare ground states on quantum computers. However, this requires solving a classical optimization problem that can become prohibitively expensive in high dimensions. Here, we develop formulations of feedback-based quantum algorithms for ground state preparation that can be used to address this challenge for two broad classes of Hamiltonians: Fermi-Hubbard Hamiltonians, and molecular Hamiltonians represented in second quantization. Feedback-based quantum algorithms are optimization-free; in place of classical optimization, quantum circuit parameters are set according to a deterministic feedback law derived from quantum Lyapunov control principles. This feedback law guarantees a monotonic improvement in solution quality with respect to the depth of the quantum circuit. A variety of numerical illustrations are provided that analyze the convergence and robustness of feedback-based quantum algorithms for these problem classes.

quant-ph↗

arXiv2023

Self-healing of Trotter error in digital adiabatic state preparation

Adiabatic time evolution can be used to prepare a complicated quantum many-body state from one that is easier to synthesize and Trotterization can be used to implement such an evolution digitally. The complex interplay between non-adiabaticity and digitization influences the infidelity of this process. We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as $\mathcal O(T^{-2} δt^2)$ instead of $\mathcal O(T^2 δt^2)$ expected from general Trotter error bounds, where $δt$ is the time step and $T$ is the total time. This result suggests a self-healing mechanism and explains why, despite increasing $T$, infidelities for fixed-$δt$ digitized evolutions still decrease for a wide variety of Hamiltonians. It also establishes a correspondence between the Quantum Approximate Optimization Algorithm (QAOA) and digitized quantum annealing.

quant-ph↗

arXiv2023

Quantum tracking control of the orientation of symmetric top molecules

The goal of quantum tracking control is to identify shaped fields to steer observable expectation values along designated time-dependent tracks. The fields are determined via an iteration-free procedure, which is based on inverting the underlying dynamical equations governing the controlled observables. In this article, we generalize the ideas in Phys. Rev. A 98, 043429 (2018) to the task of orienting symmetric top molecules in 3D. To this end, we derive equations for the control fields capable of directly tracking the expected value of the 3D dipole orientation vector along a desired path in time. We show this framework can be utilized for tracking the orientation of linear molecules as well, and present numerical illustrations of these principles for symmetric top tracking control problems.

quant-ph↗

arXiv2023

Lyapunov control-inspired strategies for quantum combinatorial optimization

The prospect of using quantum computers to solve combinatorial optimization problems via the quantum approximate optimization algorithm (QAOA) has attracted considerable interest in recent years. However, a key limitation associated with QAOA is the need to classically optimize over a set of quantum circuit parameters. This classical optimization can have significant associated costs and challenges. Here, we provide an expanded description of Lyapunov control-inspired strategies for quantum optimization, as presented in [Magann et al., Phys. Rev. Lett. 129, 250502 (2022)], that do not require any classical optimization effort. Instead, these strategies utilize feedback from qubit measurements to assign values to the quantum circuit parameters in a deterministic manner, such that the combinatorial optimization problem solution improves monotonically with the quantum circuit depth. Numerical analyses are presented that investigate the utility of these strategies towards MaxCut on weighted and unweighted 3-regular graphs, both in ideal implementations and also in the presence of measurement noise. We also discuss how how these strategies compare with QAOA, how they may be used to seed QAOA optimizations in order to improve performance for near-term applications, and explore connections to quantum annealing.

quant-ph↗

arXiv2023

Feedback-based quantum optimization

It is hoped that quantum computers will offer advantages over classical computers for combinatorial optimization. Here, we introduce a feedback-based strategy for quantum optimization, where the results of qubit measurements are used to constructively assign values to quantum circuit parameters. We show that this procedure results in an estimate of the combinatorial optimization problem solution that improves monotonically with the depth of the quantum circuit. Importantly, the measurement-based feedback enables approximate solutions to the combinatorial optimization problem without the need for any classical optimization effort, as would be required for the quantum approximate optimization algorithm (QAOA). We experimentally demonstrate this feedback-based protocol on a superconducting quantum processor for the graph-partitioning problem MaxCut, and present a series of numerical analyses that further investigate the protocol's performance.

quant-ph↗

arXiv2022

Sequential optical response suppression for chemical mixture characterization

The characterization of mixtures of non-interacting, spectroscopically similar quantum components has important applications in chemistry, biology, and materials science. We introduce an approach based on quantum tracking control that allows for determining the relative concentrations of constituents in a quantum mixture, using a single pulse which enhances the distinguishability of components of the mixture and has a length that scales linearly with the number of mixture constituents. To illustrate the method, we consider two very distinct model systems: mixtures of diatomic molecules in the gas phase, as well as solid-state materials composed of a mixture of components. A set of numerical analyses are presented, showing strong performance in both settings.

quant-ph↗