arXiv subjects

Karl Jansen

Publications and source records attributed to Karl Jansen.

At least 55 records · Page 3Linked to original sources

arXiv2025

Expressive equivalence of classical and quantum restricted Boltzmann machines

Quantum computers offer the potential for efficiently sampling from complex probability distributions, attracting increasing interest in generative modeling within quantum machine learning. This surge in interest has driven the development of numerous generative quantum models, yet their trainability and scalability remain significant challenges. A notable example is a quantum restricted Boltzmann machine (QRBM), which is based on the Gibbs state of a parameterized non-commuting Hamiltonian. While QRBMs are expressive, their non-commuting Hamiltonians make gradient evaluation computationally demanding, even on fault-tolerant quantum computers. In this work, we propose a semi-quantum restricted Boltzmann machine (sqRBM), a model designed for classical data that mitigates the challenges associated with previous QRBM proposals. The sqRBM Hamiltonian is commuting in the visible subspace while remaining non-commuting in the hidden subspace. This structure allows us to derive closed-form expressions for both output probabilities and gradients. Leveraging these analytical results, we demonstrate that sqRBMs share a close relationship with classical restricted Boltzmann machines (RBM). Our theoretical analysis predicts that, to learn a given probability distribution, an RBM requires three times as many hidden units as an sqRBM, while both models have the same total number of parameters. We validate these findings through numerical simulations involving up to 100 units. Our results suggest that sqRBMs could enable practical quantum machine learning applications in the near future by significantly reducing quantum resource requirements.

quant-ph↗

arXiv2025

How quantum computing can enhance biomarker discovery

Biomarkers play a central role in medicine's gradual progress towards proactive, personalized precision diagnostics and interventions. However, finding biomarkers that provide very early indicators of a change in health status, for example for multi-factorial diseases, has been challenging. Discovery of such biomarkers stands to benefit significantly from advanced information processing and means to detect complex correlations, which quantum computing offers. In this perspective paper, quantum algorithms, particularly in machine learning, are mapped to key applications in biomarker discovery. The opportunities and challenges associated with the algorithms and applications are discussed. The analysis is structured according to different data types - multi-dimensional, time series, and erroneous data - and covers key data modalities in healthcare - electronic health records (EHRs), omics, and medical images. An outlook is provided concerning open research challenges.

q-bio.OT↗

arXiv2025

Adaptive Observation Cost Control for Variational Quantum Eigensolvers

The objective to be minimized in the variational quantum eigensolver (VQE) has a restricted form, which allows a specialized sequential minimal optimization (SMO) that requires only a few observations in each iteration. However, the SMO iteration is still costly due to the observation noise -- one observation at a point typically requires averaging over hundreds to thousands of repeated quantum measurement shots for achieving a reasonable noise level. In this paper, we propose an adaptive cost control method, named subspace in confident region (SubsCoRe), for SMO. SubsCoRe uses the Gaussian process (GP) surrogate, and requires it to have low uncertainty over the subspace being updated, so that optimization in each iteration is performed with guaranteed accuracy. The adaptive cost control is performed by first setting the required accuracy according to the progress of the optimization, and then choosing the minimum number of measurement shots and their distribution such that the required accuracy is satisfied. We demonstrate that SubsCoRe significantly improves the efficiency of SMO, and outperforms the state-of-the-art methods.

quant-ph↗

arXiv2025

Fermionic wave packet scattering: a quantum computing approach

Quantum computing provides a novel avenue towards simulating dynamical phenomena, and, in particular, scattering processes relevant for exploring the structure of matter. However, preparing and evolving particle wave packets on a quantum device is a nontrivial task. In this work, we propose a method to prepare Gaussian wave packets with momentum on top of the interacting ground state of a fermionic Hamiltonian. Using Givens rotation, we show how to efficiently obtain expectation values of observables throughout the evolution of the wave packets on digital quantum computers. We demonstrate our technique by applying it to the staggered lattice formulation of the Thirring model and studying the scattering of two wave packets. Monitoring the particle density and the entropy produced during the scattering process, we characterize the phenomenon and provide a first step towards studying more complicated collision processes on digital quantum computers. In addition, we perform a small-scale demonstration on IBM's quantum hardware, showing that our method is suitable for current and near-term quantum devices.

quant-ph↗

arXiv2025

Imaginary Hamiltonian variational ansatz for combinatorial optimization problems

Obtaining exact solutions to combinatorial optimization problems using classical computing is computationally expensive. The current tenet in the field is that quantum computers can address these problems more efficiently. While promising algorithms require fault-tolerant quantum hardware, variational algorithms have emerged as viable candidates for near-term devices. The success of these algorithms hinges on multiple factors, with the design of the ansatz having the utmost importance. It is known that popular approaches such as quantum approximate optimization algorithm (QAOA) and quantum annealing suffer from adiabatic bottlenecks, that lead to either larger circuit depth or evolution time. On the other hand, the evolution time of imaginary time evolution is bounded by the inverse energy gap of the Hamiltonian, which is constant for most non-critical physical systems. In this work, we propose imaginary Hamiltonian variational ansatz ($i$HVA) inspired by quantum imaginary time evolution to solve the MaxCut problem. We introduce a tree arrangement of the parametrized quantum gates, enabling the exact solution of arbitrary tree graphs using the one-round $i$HVA. For randomly generated $D$-regular graphs, we numerically demonstrate that the $i$HVA solves the MaxCut problem with a small constant number of rounds and sublinear depth, outperforming QAOA, which requires rounds increasing with the graph size. Furthermore, our ansatz solves MaxCut exactly for graphs with up to 24 nodes and $D \leq 5$, whereas only approximate solutions can be derived by the classical near-optimal Goemans-Williamson algorithm. We validate our simulated results with hardware demonstrations on a graph with 67 nodes.

quant-ph↗

arXiv2024

Gaussian boson sampling for binary optimization

Binary optimization is a fundamental area in computational science, with wide-ranging applications from logistics to cryptography, where the tasks are often formulated as Quadratic or Polynomial Unconstrained Binary Optimization problems (QUBO/PUBO). In this work, we propose to use a parametrized Gaussian Boson Sampler (GBS) with threshold detectors to address such problems. We map general PUBO instance onto a quantum Hamiltonian and optimize the Conditional Value-at-Risk of its energy with respect to the GBS ansatz. In particular, we observe that, when the algorithm reduces to standard Variational Quantum Eigensolver, the cost function is analytical. Therefore, it can be computed efficiently, along with its gradient, for low-degree polynomials using only classical computing resources. Numerical experiments on 3-SAT and Graph Partitioning problems show significant performance gains over random guessing, providing a first proof of concept for our proposed approach.

quant-ph↗

arXiv2024

Progress in lattice simulations for two Higgs doublet models

The custodial Two-Higgs-Doublet-Model with SU(2) gauge fields is studied on the lattice. This model has the same global symmetry structure as the Standard Model but the additional Higgs field enlarges the scalar spectrum and opens the possibility for the occurrence of spontaneous symmetry breaking of the global symmetries. Both the spectrum and the running of the gauge coupling of the custodial 2HDM are studied on a line of constant Standard Model physics with cutoff ranging from 300 to 600 GeV. The lower bounds of the realizable masses for the additional BSM scalar states are found to be well bellow the W boson mass. In fact, for the choice of quartic couplings in this work the estimated lower mass for one of the BSM states is found to be about $\sim 0.2m_{W}$ and independent of the cutoff.

hep-lat↗

arXiv2024

Analysis of the confinement string in (2 + 1)-dimensional Quantum Electrodynamics with a trapped-ion quantum computer

Compact lattice Quantum Electrodynamics is a complex quantum field theory with dynamical gauge and matter fields and it has similarities with Quantum Chromodynamics, in particular asymptotic freedom and confinement. We consider a (2+1)-dimensional lattice discretization of Quantum Electrodynamics with the inclusion of dynamical fermionic matter. We define a suitable quantum algorithm to measure the static potential as a function of the distance between two charges on the lattice and we use a variational quantum calculation to explore the Coulomb, confinement and string breaking regimes. A symmetry-preserving and resource-efficient variational quantum circuit is employed to prepare the ground state of the theory at various values of the coupling constant, corresponding to different physical distances, allowing the accurate extraction of the static potential from a quantum computer. We demonstrate that results from quantum experiments on the Quantinuum H1-1 trapped-ion device and emulator, with full connectivity between qubits, agree with classical noiseless simulations using circuits with 10 and 24 qubits. Moreover, we visualize the electric field flux configurations that mostly contribute in the wave-function of the quantum ground state in the different regimes of the potential, thus giving insights into the mechanisms of confinement and string breaking. These results are a promising step forward in the grand challenge of solving higher dimensional lattice gauge theory problems with quantum computing algorithms.

hep-lat↗

arXiv2024

Simulating matrix models with tensor networks

Matrix models, as quantum mechanical systems without explicit spatial dependence, provide valuable insights into higher-dimensional gauge and gravitational theories, especially within the framework of string theory, where they can describe quantum black holes via the holographic principle. Simulating these models allows for exploration of their kinematic and dynamic properties, particularly in parameter regimes that are analytically intractable. In this study, we examine the potential of tensor network techniques for such simulations. Specifically, we construct ground states as matrix product states and analyse features such as their entanglement structure.

hep-th↗

arXiv2024

Small-scale Hamiltonian optimization of interpolating operators for Lagrangian lattice quantum field theory

Lattice quantum field theory calculations may potentially combine the advantages of Hamiltonian formulations with the scalability and control of conventional Lagrangian frameworks. However, such hybrid approaches need to consider (1) the differences in renormalized coupling values between the two formulations, and (2) finite-volume and discretization effects when the Hamiltonian component of the calculation is characterized by a smaller volume or coarser lattice spacing than the Lagrangian component. This work investigates the role of both factors in the application of Hamiltonian-optimized interpolating operator constructions for the conventional Lagrangian framework. The numerical investigation is realized for the pseudoscalar meson in the Schwinger model, using tensor-network and Monte-Carlo calculations. It is demonstrated that tensor-network-optimized constructions are robust to both (1) and (2). In particular, accurate optimized constructions for the pseudoscalar meson can be obtained from calculations with a smaller number of Hamiltonian lattice sites, even when the meson mass itself receives significant finite-volume corrections. To the extent that these results generalize to theories with more complicated spectra, the method holds promise for near-term applications in large-scale calculations of lattice quantum field theory.

hep-lat↗

arXiv2024

Learning to generate high-dimensional distributions with low-dimensional quantum Boltzmann machines

In recent years, researchers have been exploring ways to generalize Boltzmann machines (BMs) to quantum systems, leading to the development of variations such as fully-visible and restricted quantum Boltzmann machines (QBMs). Due to the non-commuting nature of their Hamiltonians, restricted QBMs face trainability issues, whereas fully-visible QBMs have emerged as a more tractable option, as recent results demonstrate their sample-efficient trainability. These results position fully-visible QBMs as a favorable choice, offering potential improvements over fully-visible BMs without suffering from the trainability issues associated with restricted QBMs. In this work, we show that low-dimensional, fully-visible QBMs can learn to generate distributions typically associated with higher-dimensional systems. We validate our findings through numerical experiments on both artificial datasets and real-world examples from the high energy physics problem of jet event generation. We find that non-commuting terms and Hamiltonian connectivity improve the learning capabilities of QBMs, providing flexible resources suitable for various hardware architectures. Furthermore, we provide strategies and future directions to maximize the learning capacity of fully-visible QBMs.

quant-ph↗

arXiv2024

Developing a Framework for Sonifying Variational Quantum Algorithms: Implications for Music Composition

This chapter examines the Variational Quantum Harmonizer, a software tool and musical interface that focuses on the problem of sonification of the minimization steps of Variational Quantum Algorithms (VQA), used for simulating properties of quantum systems and optimization problems assisted by quantum hardware. Particularly, it details the sonification of Quadratic Unconstrained Binary Optimization (QUBO) problems using VQA. A flexible design enables its future applications both as a sonification tool for auditory displays in scientific investigation, and as a hybrid quantum-digital musical instrument for artistic endeavours. In turn, sonification can help researchers understand complex systems better and can serve for the training of quantum physics and quantum computing. The VQH structure, including its software implementation, control mechanisms, and sonification mappings are detailed. Moreover, it guides the design of QUBO cost functions in VQH as a music compositional object. The discussion is extended to the implications of applying quantum-assisted simulation in quantum-computer aided composition and live-coding performances. An artistic output is showcased by the piece \textit{Hexagonal Chambers} (Thomas and Itaboraí, 2023).

cs.SD↗

arXiv2024

Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice

Variational quantum algorithms and, in particular, variants of the varational quantum eigensolver have been proposed to address combinatorial optimization (CO) problems. Using only shallow ansatz circuits, these approaches are deemed suitable for current noisy intermediate-scale quantum hardware. However, the resources required for training shallow variational quantum circuits often scale superpolynomially in problem size. In this study we numerically investigate what this scaling result means in practice for solving CO problems using Max-Cut as a benchmark. For fixed resources, we compare the average performance of training a shallow variational quantum circuit, sampling with replacement, and a greedy algorithm starting from the same initial point as the quantum algorithm. We identify a minimum problem size for which the quantum algorithm can consistently outperform sampling and, for each problem size, characterize the separation between the quantum algorithm and the greedy algorithm. Furthermore, we extend the average case analysis by investigating the correlation between the performance of the algorithms by instance. Our results provide a step towards meaningful benchmarks of variational quantum algorithms for CO problems for a realistic set of resources.

quant-ph↗

arXiv2024

Lattice study of SU(2) gauge theory coupled to four adjoint Higgs fields

Gauge theories with matter fields in various representations play an important role in different branches of physics. Recently, it was proposed that several aspects of the interesting pseudogap phase of cuprate superconductors near optimal doping may be explained by an emergent $SU(2)$ gauge symmetry. Around the transition with positive hole-doping, one can construct a $(2+1)-$dimensional $SU(2)$ gauge theory coupled to four adjoint scalar fields which gives rise to a rich phase diagram with a myriad of phases having different broken symmetries. We study the phase diagram of this model on the Euclidean lattice using the Hybrid Monte Carlo algorithm. We find the existence of multiple broken phases as predicted by previous mean field studies. Depending on the quartic couplings, the $SU(2)$ gauge symmetry is broken down either to $U(1)$ or $\mathbb{Z}_2$ in the perturbative description of the model. We further study the confinement-deconfinement transition in this theory, and find that both the broken phases are deconfining in the range of volumes that we studied. However, there exists a marked difference in the behavior of the Polyakov loop between the two phases.

hep-lat↗

arXiv2024

Concurrent VQE for Simulating Excited States of the Schwinger Model

This work explores the application of the concurrent variational quantum eigensolver (cVQE) for computing excited states of the Schwinger model. By designing suitable ansatz circuits utilizing universal SO(4) or SO(8) qubit gates, we demonstrate how to efficiently obtain the lowest two, four, and eight eigenstates with one, two, and three ancillary qubits for both vanishing and non-vanishing background electric field cases. Simulating the resulting quantum circuits classically with tensor network techniques, we demonstrate the capability of our approach to compute the two lowest eigenstates of systems with up to $\mathcal{O}(100)$ qubits. Given that our method allows for measuring the low-lying spectrum precisely, we also present a novel technique for estimating the additive mass renormalization of the lattice based on the energy gap. As a proof-of-principle calculation, we prepare the ground and first-excited states with one ancillary and four physical qubits on quantum hardware, demonstrating the practicality of using the cVQE to simulate excited states.

quant-ph↗

arXiv2024

Towards determining the (2+1)-dimensional Quantum Electrodynamics running coupling with Monte Carlo and quantum computing methods

In this paper, we examine a compact $U(1)$ lattice gauge theory in $(2+1)$ dimensions and present a strategy for studying the running coupling and extracting the non-perturbative $Λ$-parameter. To this end, we combine Monte Carlo simulations and quantum computing, where the former can be used to determine the numerical value of the lattice spacing $a$, and the latter allows for reaching the perturbative regime at very small values of the bare coupling and, correspondingly, small values of $a$. The methodology involves a series of sequential steps (i.e., the step scaling function) to bridge results from small lattice spacings to non-perturbative large-scale lattice calculations. Focusing on the pure gauge case, we demonstrate that these quantum circuits, adapted to gauge degrees of freedom, are able to capture the relevant physics by studying the expectation value of the plaquette operator, for matching with corresponding Monte Carlo simulations. We also present results for the static potential and static force, which can be related to the renormalized coupling. The procedure outlined in this work can be extended to Abelian and non-Abelian lattice gauge theories with matter fields and might provide a way towards studying lattice quantum chromodynamics utilizing both quantum and classical methods.

hep-lat↗

arXiv2024

Physics-Informed Bayesian Optimization of Variational Quantum Circuits

In this paper, we propose a novel and powerful method to harness Bayesian optimization for Variational Quantum Eigensolvers (VQEs) -- a hybrid quantum-classical protocol used to approximate the ground state of a quantum Hamiltonian. Specifically, we derive a VQE-kernel which incorporates important prior information about quantum circuits: the kernel feature map of the VQE-kernel exactly matches the known functional form of the VQE's objective function and thereby significantly reduces the posterior uncertainty. Moreover, we propose a novel acquisition function for Bayesian optimization called Expected Maximum Improvement over Confident Regions (EMICoRe) which can actively exploit the inductive bias of the VQE-kernel by treating regions with low predictive uncertainty as indirectly ``observed''. As a result, observations at as few as three points in the search domain are sufficient to determine the complete objective function along an entire one-dimensional subspace of the optimization landscape. Our numerical experiments demonstrate that our approach improves over state-of-the-art baselines.

cs.LG↗

arXiv2024

First-Order Phase Transition of the Schwinger Model with a Quantum Computer

We explore the first-order phase transition in the lattice Schwinger model in the presence of a topological $θ$-term by means of the variational quantum eigensolver (VQE). Using two different fermion discretizations, Wilson and staggered fermions, we develop parametric ansatz circuits suitable for both discretizations, and compare their performance by simulating classically an ideal VQE optimization in the absence of noise. The states obtained by the classical simulation are then prepared on the IBM's superconducting quantum hardware. Applying state-of-the art error-mitigation methods, we show that the electric field density and particle number, observables which reveal the phase structure of the model, can be reliably obtained from the quantum hardware. To investigate the minimum system sizes required for a continuum extrapolation, we study the continuum limit using matrix product states, and compare our results to continuum mass perturbation theory. We demonstrate that taking the additive mass renormalization into account is vital for enhancing the precision that can be obtained with smaller system sizes. Furthermore, for the observables we investigate we observe universality, and both fermion discretizations produce the same continuum limit.

hep-lat↗