arXiv subjects

Dimitrios Bantounas

Publications and source records attributed to Dimitrios Bantounas.

3 recordsLinked to original sources

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

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↗

arXiv2025

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↗