arXiv subjects

Christian Arenz

Publications and source records attributed to Christian Arenz.

At least 19 recordsLinked to original sources

arXiv2026

Enhancing the phase sensitivity of a Mach-Zehnder interferometer beyond the Heisenberg limit through dynamic squeezing

We propose a method to enhance the phase sensitivity of a Mach-Zehnder interferometer, independent of its input states. This is achieved by applying squeezing sequences to one arm of the interferometer. By alternating between squeezing along orthogonal quadratures, we demonstrate that the phase sensitivity of a Mach-Zehnder interferometer can be generically enhanced. Since this enhancement is independent of the input states, the proposed dynamic squeezing method allows for further improvement in phase sensitivity when combined with non-classical input states. We compare the dynamic squeezing approach with existing quantum sensing protocols and show that super-Heisenberg scaling can be achieved. Finally, we demonstrate that the scheme is robust against moderate photon loss.

quant-ph↗

arXiv2026

Setting angles in quantum approximate optimization at utility-scale

The quantum approximate optimization algorithm (QAOA) is a powerful heuristic that seeks to solve combinatorial optimization problems using quantum hardware and classical optimization in tandem. Various methods exist to train the parameterized quantum circuits that serve as an ansatz in QAOA. However, which method works best to identify optimal angles for a given problem instance remains poorly understood, especially at utility-scale, i.e., $100$ qubits or more. In this work, we address this challenge through utility-scale benchmarks from which we distill operational guidance for QAOA practitioners. First, we investigate approximation techniques, such as matrix product states and Pauli propagation, to find optimal angles. Second, we train QAOA on small-scale representative problems and transfer the angles to larger ones. We then validate the results on quantum hardware for utility-scale problem instances that can be meaningfully executed. In this way, we identify insights for QAOA angle setting strategies that work best for problems at the utility scale, including as a function of resource cost for the search. Crucially, the operational implications we draw from our benchmarks will help quantum optimization practitioners execute QAOA end-to-end pipelines efficiently on current and future hardware.

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

Amplification of bosonic interactions through squeezing in the presence of decoherence

We consider the amplification of bosonic interactions through parametric control that implements squeezing along orthogonal quadratures. We show that bosonic interactions described by certain classes of quadratic and quartic Hamiltonians can be enhanced in this way while simultaneously overcoming noise and decoherence. In general, the amplification method enhances both desired and undesired interactions present in the system. Depending on the case, however, detrimental processes can be less amplified than the desired couplings. We leverage this observation to improve the fidelity for preparing Bell-type entangled states between two bosonic modes in the presence of noise and losses. We also investigate noise models for which the protocol either fails or partially achieves a loss-tolerant state preparation speedup. Our work facilitates faster preparation of complex quantum states and implementation of entangling gates in the presence of decoherence mechanisms.

quant-ph↗

arXiv2026

Learning parameter curves in feedback-based quantum optimization 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 a MaxCut problem instance to an associated FQA parameter curve in a single classical inference step. Numerical experiments show that this model can accurately predict FQA parameter curves across a range of problem sizes, including problem sizes not seen during model training. 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↗

arXiv2025

Riemannian gradient descent-based quantum algorithms for ground state preparation with guarantees

We investigate Riemannian gradient flows for preparing ground states of a desired Hamiltonian on a quantum device. We show that the number of steps of the corresponding Riemannian gradient descent (RGD) algorithm that prepares a ground state to a given precision depends on the structure of the Hamiltonian. Specifically, we develop an upper bound for the number of RGD steps that depends on the spectral gap of the Hamiltonian, the overlap between ground and initial state, and the target precision. In numerical experiments we study examples where we observe for a 1D Ising chain with nearest-neighbor interactions that the RGD steps needed to prepare a ground state scales linearly with the number of spins. For all-to-all couplings a quadratic scaling is obtained. To achieve efficient implementations while keeping convergence guarantees, we develop RGD approximations by randomly projecting the Riemannian gradient into polynomial-sized subspaces. We find that the speed of convergence of the randomly projected RGD critically depends on the size of the subspace the gradient is projected into. Finally, we develop efficient quantum device implementations based on Trotterization and a quantum stochastic drift-inspired protocol. We implement the resulting quantum algorithms on IBM's quantum devices and provide data for small-scale problems.

quant-ph↗

arXiv2025

Higher-order Zeno sequences

The quantum Zeno effect typically refers to freezing the dynamics of a quantum system through frequent observations. In general, quantum Zeno dynamics is obtained with an error of order $\mathcal{O}(1/N)$, where $N$ is the number of projective measurements performed within a fixed evolution time. In this work, we develop higher-order Zeno sequences that achieve faster convergence to Zeno dynamics, yielding an improved error scaling of $\mathcal{O}(1/N^{2k})$, where $k$ describes the order of the Zeno sequence. This is achieved by relating higher-order Zeno sequences to higher-order Trotter formulas that achieve similar convergence behavior. We leverage this relation to develop higher-order Zeno sequences for different manifestations of the quantum Zeno effect, including frequent projective measurements and unitary kicks. We go on to discuss achieving quantum Zeno dynamics through periodic control fields of high frequency. We explicitly develop control fields that yield a second-order type improvement in the Zeno error scaling and present shorter Zeno sequences. Finally, we discuss the connection to randomized and Uhrig dynamical decoupling to develop more efficient implementations in the weak coupling regime.

quant-ph↗

arXiv2025

On the convergence of the variational quantum eigensolver and quantum optimal control

When does a variational quantum algorithm converge to a globally optimal solution? Despite the large literature around variational approaches to quantum computing, the answer is largely unknown. We address this open question by developing a convergence theory for the variational quantum eigensolver (VQE). By leveraging the terminology of quantum control landscapes, we prove a sufficient criterion that characterizes when convergence to a ground state of a Hamiltonian can be guaranteed for almost all initial parameter settings. More specifically, we show that if (i) a parameterized unitary transformation allows for moving in all tangent-space directions (local surjectivity) in a bounded manner and (ii) the gradient descent used for the parameter update terminates, then the VQE converges to a ground state almost surely. We develop constructions that satisfy both aspects of condition (i) and analyze two commonly employed families of quantum circuit ans\"atze. Finally, we discuss regularization techniques for guaranteeing gradient descent to terminate, as for condition (ii), and draw connections to the halting problem.

quant-ph↗

arXiv2025

Equating quantum imaginary time evolution, Riemannian gradient flows, and stochastic implementations

We identify quantum imaginary time evolution as a Riemannian gradient flow on the unitary group. We develop an upper bound for the error between the two evolutions that can be controlled through the step size of the Riemannian gradient descent which minimizes the energy of the system. We discuss implementations through adaptive quantum algorithms and present a stochastic Riemannian gradient descent algorithm in which each step is efficiently implementable on a quantum computer. We prove that for a sufficiently small step size, the stochastic evolution concentrates around the imaginary time evolution, thereby providing performance guarantees for cooling the system through stochastic Riemannian gradient descent.

quant-ph↗

arXiv2025

Developing a practical model for noise in entangled photon detection

We develop a comprehensive model for the effective two-photon density matrix produced by a parametric source of entangled photon pairs under a variety of detector configurations commonly seen in a laboratory setting: two and four photon number-resolving (PNR) and threshold detectors. We derive the probability of obtaining a single coincidence assuming Poisson-distributed photon pairs, non-unit detection efficiency, and dark counts; obtain the effective density matrix; and use this quantity to compute the fidelity of the generated quantum state. The 4 PNR case admits an analytic result valid for any combination of parameters, while all other cases leverage low-efficiency approximations to arrive at closed-form expressions. Interestingly, our model reveals appreciable fidelity improvements from four detectors as opposed to two yet minimal advantages for PNR over threshold detectors in the regimes explored. Overall, our work provides a valuable tool for the quantitative design of two-photon experiments under realistic nonidealities.

quant-ph↗

arXiv2024

Loss tolerant cross-Kerr enhancement via modulated squeezing

We develop squeezing protocols to enhance cross-Kerr interactions. We show that through alternating between squeezing along different quadratures of a single photonic mode, the cross-Kerr interaction strength can be generically amplified. As an application of the squeezing protocols we discuss speeding up the deterministic implementation of controlled phase gates in photonic quantum computing architectures. We develop bounds that characterize how fast and strong single-mode squeezing has to be applied to achieve a desired gate error and show that the protocols can overcome photon losses. Finally, we discuss experimental realizations of the squeezing strategies in optical fibers and nanophotonic waveguides.

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

Tighter Lower Bounds on Quantum Annealing Times

We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can take the local structure of the Hamiltonian into account. Consequently, the bounds are computable without knowledge of the annealer's dynamics and, in certain cases, scale with the size of the system. We discuss spin systems where the bounds are polynomially tighter than existing bounds, qualitatively capturing the scaling of the exact annealing times as a function of the number of spins.

quant-ph↗

arXiv2024

Entanglement engineering of optomechanical systems by reinforcement learning

Entanglement is fundamental to quantum information science and technology, yet controlling and manipulating entanglement -- so-called entanglement engineering -- for arbitrary quantum systems remains a formidable challenge. There are two difficulties: the fragility of quantum entanglement and its experimental characterization. We develop a model-free deep reinforcement-learning (RL) approach to entanglement engineering, in which feedback control together with weak continuous measurement and partial state observation is exploited to generate and maintain desired entanglement. We employ quantum optomechanical systems with linear or nonlinear photon-phonon interactions to demonstrate the workings of our machine-learning-based entanglement engineering protocol. In particular, the RL agent sequentially interacts with one or multiple parallel quantum optomechanical environments, collects trajectories, and updates the policy to maximize the accumulated reward to create and stabilize quantum entanglement over an arbitrary amount of time. The machine-learning-based model-free control principle is applicable to the entanglement engineering of experimental quantum systems in general.

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

Randomized Gradient Descents on Riemannian Manifolds: Almost Sure Convergence to Global Minima in and beyond Quantum Optimization

We analyze convergence of gradient-descent methods on Riemannian manifolds. In particular, we study randomization of Riemannian gradient algorithms for minimizing smooth cost functions (of Morse-Bott type). We prove that randomized gradient descent methods, where the Riemannian gradient is replaced by a random projection of it, converge to a single local optimum almost surely despite the existence of saddle points. We consider both uniformly distributed and discrete random projections. We also discuss the time required to pass a saddle point. As a major application, we consider ground-state preparation through quantum optimization over the unitary group. In mathematical terms our randomized algorithm applied to the trace function $U \to \operatorname{tr}(AU\rho U^*)$ almost surely converges to its global minimum. The minimum corresponds to the smallest eigenvalue (ground state) of the selfadjoint operator $A$ (Hamiltonian) if $\rho$ is a rank-one projector (pure state). In this setting, one can efficiently replace the uniform random projections by implementing so-called discrete unitary 2-designs.

math.OC↗

arXiv2024

Learning How to Dynamically Decouple

Current quantum computers suffer from noise that stems from interactions between the quantum system that constitutes the quantum device and its environment. These interactions can be suppressed through dynamical decoupling to reduce computational errors. However, the performance of dynamical decoupling depends on the type of the system-environment interactions that are present, which often lack an accurate model in quantum devices. We show that the performance of dynamical decoupling can be improved by optimizing its rotational gates to tailor them to the quantum hardware. We find that compared to canonical decoupling sequences, such as CPMG, XY4, and UR6, the optimized dynamical decoupling sequences yield the best performance in suppressing noise in superconducting qubits. Our work thus enhances existing error suppression methods which helps increase circuit depth and result quality on noisy hardware.

quant-ph↗

arXiv2023

Robustness of random-control quantum-state tomography

In a recently demonstrated quantum-state tomography scheme [Phys. Rev. Lett. 124, 010405 (2020)], a random control field is locally applied to a multipartite system to reconstruct the full quantum state of the system through single-observable measurements. Here, we analyze the robustness of such a tomography scheme against measurement errors. We characterize the sensitivity to measurement errors using the logarithm of the condition number of a linear system that fully describes the tomography process. Using results from random matrix theory we derive the scaling law of the logarithm of this condition number with respect to the system size when Haar-random evolutions are considered. While this expression is independent on how Haar randomness is created, we also perform numerical simulations to investigate the temporal behavior of the robustness for two specific quantum systems that are driven by a single random control field. Interestingly, we find that before the mean value of the logarithm of the condition number as a function of the driving time asymptotically approaches the value predicted for a Haar-random evolution, it reaches a plateau whose length increases with the system size.

quant-ph↗