activity
20242026
most citedA Comprehensive Stress Test of Truncated Hilbert Space Bases against Green's function Monte Carlo in U(1) Lattice Gauge Theory

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing quant-phShow all

6 papers · 1 filter

quant-ph2026

Isogeny Graphs in Superposition and Quantum Onion Routing

Eleni Agathocleous, Tobias Hartung, Karl Jansen +1

Onion routing provides anonymity by layering encryption so that no relay can link sender to destination. A quantum analogue faces a core obstacle: layered quantum encryption genera…

quant-ph2025

Quantum convolutional neural networks for jet images classification

Hala Elhag, Tobias Hartung, Karl Jansen +3

Recently, interest in quantum computing has significantly increased, driven by its potential advantages over classical techniques. Quantum machine learning (QML) exemplifies one of…

quant-ph2025

Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems

Tobias Hartung, Karl Jansen

Many current and near-future applications of quantum computing utilise parametric families of quantum circuits and variational methods that can suffer from obstacles including non-…

quant-ph2025

Variational Quantum Eigensolver Approach to Prime Factorization on IBM's Noisy Intermediate Scale Quantum Computer

Mona Sobhani, Yahui Chai, Tobias Hartung +1

This paper presents a hybrid quantum-classical approach to prime factorization. The proposed algorithm is based on the Variational Quantum Eigensolver (VQE), which employs a classi…

quant-ph2024

Real-time measurement error mitigation for one-way quantum computation

Tobias Hartung, Stephan Schuster, Joachim von Zanthier +1

We propose a quantum error mitigation scheme for single-qubit measurement errors, particularly suited for one-way quantum computation. Contrary to well established error mitigation…

quant-ph2024

Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice

Tim Schwägerl, Yahui Chai, Tobias Hartung +2

Variational quantum algorithms and, in particular, variants of the varational quantum eigensolver have been proposed to address combinatorial optimization (CO) problems. Using only…