arXiv subjects

Sebastian Nagies

Publications and source records attributed to Sebastian Nagies.

6 recordsLinked to original sources

arXiv2026

Quantum resources in non-stoquastic quantum annealing

Quantum annealing promises to solve combinatorial optimization problems by preparing the ground state of a target Hamiltonian. Standard annealing protocols are, however, stoquastic and can thus be simulated by sign-problem-free quantum Monte-Carlo methods. To obtain a true quantum advantage, it has been proposed to use non-stoquastic catalyst Hamiltonians. Active only at intermediate stages of the protocol, these can, for certain problems, convert first-order into second-order quantum phase transitions and thus permit an exponential speedup over the stoquastic protocol. At the same time, the non-stoquastic catalyst renders quantum Monte-Carlo methods inefficient. It remains, however, an open question how other classical computation methods are affected by the non-stoquastic terms. We address this question by computing quantum resources -- entanglement entropy and stabilizer R\'enyi entropy -- whose presence makes classical computations based on tensor networks and stabilizer-tableau methods exponentially hard. We compare these with the spectral gap along the annealing path for two paradigmatic benchmark models, the fully connected $p$-spin model and a geometrically local Ising model. While the exact behavior shows a subtle dependency on the underlying model and the annealing path, our numerics suggest consistently that the scaling of entanglement and non-stabilizerness is at least maintained in the deeply non-stoquastic regime and in some cases even significantly enhanced. Our results thus suggest that improvements of quantum performance in non-stoquastic annealing coincide with significant presence of quantum computational resources.

quant-ph↗

arXiv2025

Practical Noise Mitigation for Quantum Annealing via Dynamical Decoupling: Toward Industry-Relevant Optimization using Trapped Ions

Quantum annealing is a framework for solving combinatorial optimization problems. While it offers a promising path towards a practical application of quantum hardware, its performance in real-world devices is severely limited by environmental noise that can degrade solution quality. We investigate the suppression of local field noise in quantum annealing protocols through the periodic application of dynamical decoupling pulses implementing global spin flips. As test problems, we construct minimal Multiple Object Tracking QUBO instances requiring only five and nine qubits, as well as cutting stock instances of five and six qubits. Moreover, using the Sherrington--Kirkpatrick model, we demonstrate the robustness of our protocol to problem structure and size. To further place our results in a practical context, we consider a trapped-ion platform based on magnetic gradient-induced coupling as a reference architecture, using it to define experimentally realistic noise and coupling parameters. We show that external magnetic field fluctuations, typical in such setups, significantly degrade annealing fidelity, while moderate dynamical decoupling pulse rates, which are achievable in current experiments, restore performance to near-ideal levels. Our analytical and numerical results reveal a universal scaling behavior, with fidelity determined by a generalized parameter combining noise amplitude and dynamical decoupling pulse interval. While our analysis is grounded in the trapped-ion platform, the proposed noise mitigation strategy and resulting performance improvements are applicable to a broad range of quantum annealing implementations and establish a practical and scalable route for error mitigation in near-term devices.

quant-ph↗

arXiv2025

Enhancing Expressivity of Quantum Neural Networks Based on the SWAP test

Quantum neural networks (QNNs) based on parametrized quantum circuits are promising candidates for machine learning applications, yet many architectures lack clear connections to classical models, potentially limiting their ability to leverage established classical neural network techniques. We examine QNNs built from SWAP test circuits and discuss their equivalence to classical two-layer feedforward networks with quadratic activations under amplitude encoding. Evaluation on real-world and synthetic datasets shows that while this architecture learns many practical binary classification tasks, it has fundamental expressivity limitations: polynomial activation functions do not satisfy the universal approximation theorem, and we show analytically that the architecture cannot learn the parity check function beyond two dimensions, regardless of network size. To address this, we introduce generalized SWAP test circuits with multiple Fredkin gates sharing an ancilla, implementing product layers with polynomial activations of arbitrary even degree. This modification enables successful learning of parity check functions in arbitrary dimensions as well as binary n-spiral tasks, and we provide numerical evidence that the expressivity enhancement extends to alternative encoding schemes such as angle (Z) and ZZ feature maps. We validate the practical feasibility of our proposed architecture by implementing a classically pretrained instance on the IBM Torino quantum processor, achieving 84% classification accuracy on the three-dimensional parity check despite hardware noise. Our work establishes a framework for analyzing and enhancing QNN expressivity through correspondence with classical architectures, and demonstrates that SWAP test-based QNNs possess broad representational capacity relevant to both classical and potentially quantum learning tasks.

quant-ph↗

arXiv2024

Boosting quantum annealing performance through direct polynomial unconstrained binary optimization

Quantum annealing aims at solving optimization problems of practical relevance using quantum-computing hardware. Problems of interest are typically formulated in terms of quadratic unconstrained binary optimization (QUBO) Hamiltonians. However, many optimization problems are much more naturally formulated in terms of polynomial unconstrained binary optimization (PUBO) functions of higher order. As we show with various problem examples, leveraging the PUBO formulation can bring considerable savings in terms of required number of qubits. Moreover, in numerical benchmarks for the paradigmatic 3-SAT problem, we find scenarios where the scaling of the minimum energy gap during the optimization sweep differs significantly, suggesting the possibility of an exponentially faster annealing time when using the PUBO as compared to the QUBO formulation. This advantage persists even when considering the overhead caused by the higher-order interactions necessary for PUBO cost Hamiltonians. As an interesting side effect, the analysis on minimum energy gaps of different 3-SAT instance generators reveals different degrees of hardness, which will be of interest also for classical benchmark calculations. Our findings show a promising path to improving the resource efficiency and sweeping speed of quantum annealing protocols on both analog and digital platforms, which are important prerequisites when aiming at solving larger optimization problems with relevance to industry.

quant-ph↗

arXiv2024

The role of higher-order terms in trapped-ion quantum computing with magnetic gradient induced coupling

Trapped-ion hardware based on the Magnetic Gradient Induced Coupling (MAGIC) scheme is emerging as a promising platform for quantum computing. Nevertheless, in this -- as in any other -- quantum-computing platform, many technical questions still have to be resolved before large-scale and error-tolerant applications are possible. In this work, we present a thorough discussion of the structure and effects of higher-order terms in the MAGIC setup, which can occur due to anharmonicities in the external potential of the ion crystal (e.g., through Coulomb repulsion) or through curvature of the applied magnetic field. These terms generate systematic shifts in the leading-order interactions and take the form of three-spin couplings, two-spin couplings, local fields, as well as diverse phonon-phonon conversion mechanisms. We find that most of these are negligible in realistic situations, with only two contributions that need careful attention. First, there are undesired longitudinal fields contributing shifts to the resonance frequency, whose strength increases with chain length and phonon occupation numbers; while their mean effect can easily be compensated by additional $Z$ rotations, phonon number fluctuations need to be avoided for precise gate operations. Second, anharmonicities of the Coulomb interaction can lead to well-known two-to-one conversions of phonon excitations. Both of these error terms can be mitigated by sufficiently cooling the phonons to the ground-state. Our detailed analysis constitutes an important contribution on the way of making magnetic-gradient trapped-ion quantum technology fit for large-scale applications, and it may inspire new ways to purposefully design interaction terms.

quant-ph↗

arXiv2024

Beyond braid statistics: Constructing a lattice model for anyons with exchange statistics intrinsic to one dimension

Anyons obeying fractional exchange statistics arise naturally in two dimensions: hard-core two-body constraints make the configuration space of particles not simply-connected. The braid group describes how topologically-inequivalent exchange paths can be associated to non-trivial geometric phases for abelian anyons. Braid-anyon exchange statistics can also be found in one dimension (1D), but this requires broken Galilean invariance to distinguish different ways for two anyons to exchange. However, recently it was shown that an alternative form of exchange statistics can occur in 1D because hard-core three-body constraints also make the configuration space not simply-connected. Instead of the braid group, the topology of exchange paths and their associated non-trivial geometric phases are described by the traid group. In this article we propose a first concrete model realizing this alternative form of anyonic exchange statistics. Starting from a bosonic lattice model that implements the desired geometric phases with number-dependent Peierls phases, we then define anyonic operators so that the kinetic energy term in the Hamiltonian becomes local and quadratic with respect to them. The ground-state of this traid-anyon-Hubbard model exhibits several indications of exchange statistics intermediate between bosons and fermions, as well as signs of emergent approximate Haldane exclusion statistics. The continuum limit results in a Galilean invariant Hamiltonian with eigenstates that correspond to previously constructed continuum wave functions for traid anyons. This provides not only an a-posteriori justification of our lattice model, but also shows that our construction serves as an intuitive approach to traid anyons, i.e. anyons intrinsic to 1D.

cond-mat.quant-gas↗