Skip to content

Author

M. Roetteler

4 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Two-Stage Quantum-Classical Distribution Network Reconfiguration via Cycle-Edge Encoding

Distribution network reconfiguration (DNR) is a combinatorial optimization problem that seeks a low-loss network topology subject to topological and electrical operating constraints. In this work, we propose a two-stage quantum-classical method for DNR. First, an iterative linear-ramp Quantum Alternating Operator Ansat...

Nowar Alashkar, C. Kennedy, Phillip C. Lotshaw et al. · 0 citations
Open access Oct 2024

Hybrid quantum-classical approach for combinatorial problems at hadron colliders

In recent years, quantum computing has drawn significant interest within the field of high-energy physics. We explore the potential of quantum algorithms to resolve the combinatorial problems in particle physics experiments. As a concrete example, we consider top quark pair production in the fully hadronic channel at t...

Zhong-Tian Dong, Taejoon Kim, K. Kong et al. · 4 citations
Preprint Sep 2026

Towards Scaling Quantum Fine-Tuning of Foundational Time Series Models for Classification

The wing module is introduced, a self-contained few-qubit circuit that feeds additional information into the core circuit through a sparse, one-way coupling, and reframe scaling for quantum fine-tuning: added qubits help when they carry added inputs, not merely more parameters.

Sang Hyub Kim, Julien Baglio, R. Krishnakumar et al. · 0 citations
Preprint Sep 2026

Computing 256-bit elliptic curve discrete logarithms in 26 days on a fault-tolerant trapped-ion quantum computer with 20,000 qubits

One of the strengths of our recently proposed Walking Cat Architecture for a trapped-ion quantum computer is that it is straightforward to extend and optimize for a specific application. As a proof-of-concept, here we present such optimizations for solving the $256$-bit elliptic curve discrete logarithm problem (ECDLP)...

Thomas Häner, Felix Tripier, Jacob Young et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.