arXiv subjects

Josua Unger

Publications and source records attributed to Josua Unger.

9 recordsLinked to original sources

arXiv2026

Quantum Optimisation for Protein-Protein Interaction Network Alignment

Protein-protein interaction (PPI) network alignment combines topological and sequence information to identify conserved modules across species, but global alignment remains challenging: heuristics sacrifice optimality, while exact methods lack scalability. We model the alignment as a weighted maximum common induced subgraph problem and reformulate it through the modular product graph to a minimum-weight vertex cover on the complement, with node weights carrying sequence similarity. To solve this problem, we develop a hybrid framework combining kernelisation, branch-and-bound, and seven Quantum Approximate Optimisation Algorithm (QAOA) formulations. These formulations differ in how the cover constraints are enforced, from penalty terms in the cost Hamiltonian to mixers confined to the feasible subspace. For single round QAOA, we derive closed-form expressions for the expected cost of four circulant mixer variants, enabling performance characterisation without circuit simulation. Applied to synthetic and real-world networks reduced to KEGG pathways, the QAOA formulations achieve high topological conservation on the aligned core while at least maintaining biological conservation comparable to leading classical aligners, at the cost of reduced node coverage. Across selected KEGG pathways, the aligned subnetworks retain disease-associated proteins, preserving biologically relevant information. Cheaper formulations leave more edges uncovered, while enforcing feasibility in the mixer raises circuit depth by one to two orders of magnitude. Together, these results highlight the potential of quantum optimisation for PPI network alignment and the resource trade-offs that will shape its scalability as quantum hardware matures.

quant-ph↗

arXiv2026

Qudit extension of parameterized IQP circuits: A generative quantum machine learning approach to integer data

Parameterized Instantaneous Quantum Polynomial (IQP) circuits have proven useful in quantum generative learning models, particularly for binary distributions. However, when applied to non-binary datasets, they exhibit notable limitations: mapping integer values into qubit-compatible binary representations often destroys the original metric structure of the data. In this paper we aim to extend them to a qudits formulation operating on an integer mapping of the data. The IQP quantum circuit is adapted to encode each integer valued pixel into a bit-string of fixed length and quantum gates are transformed to follow the qudit formalism. As a generative machine learning approach, a suitable loss function for the circuit training and the calculation of the covariance matrix among features are developed and validated on the energy deposits from single-particle electron showers in the electromagnetic calorimeter of the CLIC detector. The method proposed in this work can be also extended to other applications that utilize quantum generative machine learning for non-binary data.

quant-ph↗

arXiv2026

Parity-unfolded distillation architecture for noise-biased platforms

We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations $ Z^{1/2^{k}}$ rather than approximating them with the conventional (Clifford + $T$) gate set. The architecture is enabled by efficient distillation of gates from an arbitrary level of the Clifford hierarchy, which we refer to as parity unfolding. With it, a state $|Z_k\rangle = Z^{1/2^{k}}|{+}\rangle$ can be prepared fault-tolerantly using $2^{k+3} + O(2^{k/2})$ biased-noise qubits on a planar chip with nearest-neighbour connectivity. For algorithms requiring native $Z^{1/2^{k}}$ gates, such as the Quantum Fourier Transform and phase estimation, the proposed scheme allows to reduce resource overheads for up to $k=7$, i.e., up to $T^{1/32}$. Furthermore, when used for the synthesis of arbitrary small-angle rotations, parity-unfolded distillation of ($T$ + $\sqrt{T}$) reduces the minimum achievable logical error rate by 43% while cutting the resource requirements by 26%, when compared to unfolded distillation of only the $T$ gate.

quant-ph↗

arXiv2024

Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization

We present a construction for circuits with low gate count and depth, implementing three- and four-body Pauli-Z product operators as they appear in the form of plaquette-shaped constraints in QAOA when using the parity mapping. The circuits can be implemented on any quantum device with nearest-neighbor connectivity on a square-lattice, using only one gate type and one orientation of two-qubit gates at a time. We find an upper bound for the circuit depth which is independent of the system size. The procedure is readily adjustable to hardware-specific restrictions, such as a minimum required spatial distance between simultaneously executed gates, or gates only being simultaneously executable within a subset of all the qubits, for example a single line.

quant-ph↗

arXiv2023

Encoding-Independent Optimization Problem Formulation for Quantum Computing

We present an encoding and hardware-independent formulation of optimization problems for quantum computing. Using this generalized approach, we present an extensive library of optimization problems and their various derived spin encodings. Common building blocks that serve as a construction kit for building these spin Hamiltonians are identified. This paves the way towards a fully automatic construction of Hamiltonians for arbitrary discrete optimization problems. The presented freedom in the problem formulation is a key step for tailoring optimal spin Hamiltonians for different hardware platforms.

quant-ph↗

arXiv2022

Quantum Groups and Asymptotic Symmetries

This thesis is devoted to the study of Lie bialgebra and Hopf algebra structures related to certain versions of non-commutative geometry constructed on infinite-dimensional Lie algebras that arise in the context of asymptotic symmetries of spacetime. We prove a number of theorems about cohomology groups that aid the classification of the Lie bialgebras and explicitly construct and analyze selected Hopf algebras. Particularly interesting behavior was found by studying the contraction limit of spacetimes with cosmological constant and the inclusion of central charges on the level of Lie bialgebras and Hopf algebras. Phenomenological consequences, like deformed in-vacuo dispersion relations, known from the study of $κ$-Poincaré quantum groups, are investigated. Furthermore, we examine how a new proposal in the context of the black hole information loss paradox and counterarguments against it are affected.

math-ph↗

arXiv2021

$κ$-deformed complex fields and discrete symmetries

We present a construction of $κ$-deformed complex scalar field theory with the objective of shedding light on the way discrete symmetries and CPT invariance are affected by the deformation. Our starting point is the observation that, in order to have an appropriate action of Lorentz symmetries on antiparticle states, these should be described by four-momenta living on the complement of the portion of de Sitter group manifold to which $κ$-deformed particle four-momenta belong. Once the equations of motions are properly worked out from the deformed action we obtain that particle and antiparticle are characterized by different mass-shell constraints leading to a subtle form of departure from CPT invariance. The remaining part of our work is dedicated to a detailed description of the action of deformed Poincaré and discrete symmetries on the complex field.

hep-th↗

arXiv2019

Quantum ergosphere and brick wall entropy

We revisit the "brick wall" model for black hole entropy taking into account back-reaction effects on the horizon structure. We do so by adopting an evaporating metric in the quasi-static approximation in which departures from the standard Schwarzschild metric are governed by a small luminosity factor. One of the effects of the back-reaction is to create an ergosphere-like region which naturally tames the usual divergence in the calculation of the partition function of the field. The black hole luminosity sets the width of such "quantum ergosphere". We find a finite horizon contribution to the entropy which, for the luminosity associated to the Hawking flux, agrees remarkably well with the Bekenstein-Hawking relation.

gr-qc↗

arXiv2018

Three-loop MSSM Higgs-Boson Mass Predictions and Regularization by Dimensional Reduction

The evaluation of three-loop contributions to the MSSM Higgs-boson mass is considered at the orders enhanced by the strong gauge coupling and top or bottom Yukawa couplings, i.e. at the orders $O(α_{t,b}α_s^2,α_{t,b}^2α_s,α_{t,b}^3)$. We prove that regularization by dimensional reduction preserves supersymmetry at the required level. Thus generating counterterms by multiplicative renormalization is correct. Technically, we extend a previous two-loop analysis to the three-loop level. The extension covers not only the genuine three-loop Higgs potential counterterms but also a large sector of two-loop counterterms, required for subrenormalization.

hep-ph↗